Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 92.77 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:867 2.41 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:856 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bc410 : : */ : void : ExecHashTableInsert(HashJoinTable hashtable, : TupleTableSlot *slot, : uint32 hashvalue) : { 0.00 : 5bc410: 55 push %rbp 0.00 : 5bc411: 48 89 e5 mov %rsp,%rbp 0.00 : 5bc414: 48 89 5d d8 mov %rbx,-0x28(%rbp) 0.00 : 5bc418: 4c 89 6d e8 mov %r13,-0x18(%rbp) 0.00 : 5bc41c: 49 89 fd mov %rdi,%r13 0.00 : 5bc41f: 4c 89 7d f8 mov %r15,-0x8(%rbp) 0.00 : 5bc423: 4c 89 65 e0 mov %r12,-0x20(%rbp) 0.00 : 5bc427: 48 89 f7 mov %rsi,%rdi 0.00 : 5bc42a: 4c 89 75 f0 mov %r14,-0x10(%rbp) 0.40 : 5bc42e: 48 83 ec 40 sub $0x40,%rsp 0.00 : 5bc432: 89 d3 mov %edx,%ebx : MinimalTuple tuple = ExecFetchSlotMinimalTuple(slot); 0.00 : 5bc434: e8 17 7b ff ff callq 5b3f50 0.40 : 5bc439: 49 89 c7 mov %rax,%r15 : uint32 hashvalue, : int *bucketno, : int *batchno) : { : uint32 nbuckets = (uint32) hashtable->nbuckets; : uint32 nbatch = (uint32) hashtable->nbatch; 0.00 : 5bc43c: 41 8b 45 40 mov 0x40(%r13),%eax : ExecHashGetBucketAndBatch(HashJoinTable hashtable, : uint32 hashvalue, : int *bucketno, : int *batchno) : { : uint32 nbuckets = (uint32) hashtable->nbuckets; 0.00 : 5bc440: 41 8b 55 00 mov 0x0(%r13),%edx : uint32 nbatch = (uint32) hashtable->nbatch; : : if (nbatch > 1) 0.00 : 5bc444: 83 f8 01 cmp $0x1,%eax 0.00 : 5bc447: 0f 86 0b 01 00 00 jbe 5bc558 : { : /* we can do MOD by masking, DIV by shifting */ : *bucketno = hashvalue & (nbuckets - 1); : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); 0.00 : 5bc44d: 41 8b 4d 04 mov 0x4(%r13),%ecx : uint32 nbatch = (uint32) hashtable->nbatch; : : if (nbatch > 1) : { : /* we can do MOD by masking, DIV by shifting */ : *bucketno = hashvalue & (nbuckets - 1); 0.00 : 5bc451: 44 8d 72 ff lea -0x1(%rdx),%r14d : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); 0.00 : 5bc455: 89 da mov %ebx,%edx 0.00 : 5bc457: 83 e8 01 sub $0x1,%eax : uint32 nbatch = (uint32) hashtable->nbatch; : : if (nbatch > 1) : { : /* we can do MOD by masking, DIV by shifting */ : *bucketno = hashvalue & (nbuckets - 1); 0.00 : 5bc45a: 41 21 de and %ebx,%r14d : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); 0.00 : 5bc45d: d3 ea shr %cl,%edx 0.00 : 5bc45f: 21 c2 and %eax,%edx : &bucketno, &batchno); : : /* : * decide whether to put the tuple in the hash table or a temp file : */ : if (batchno == hashtable->curbatch) 0.00 : 5bc461: 41 39 55 44 cmp %edx,0x44(%r13) 0.00 : 5bc465: 74 31 je 5bc498 : { : /* : * put the tuple into a temp file for later batches : */ : Assert(batchno > hashtable->curbatch); : ExecHashJoinSaveTuple(tuple, 0.00 : 5bc467: 48 63 d2 movslq %edx,%rdx 0.00 : 5bc46a: 89 de mov %ebx,%esi 0.00 : 5bc46c: 4c 89 ff mov %r15,%rdi 0.00 : 5bc46f: 48 c1 e2 03 shl $0x3,%rdx 0.00 : 5bc473: 49 03 55 68 add 0x68(%r13),%rdx : hashvalue, : &hashtable->innerBatchFile[batchno]); : } : } 0.00 : 5bc477: 48 8b 5d d8 mov -0x28(%rbp),%rbx 0.00 : 5bc47b: 4c 8b 65 e0 mov -0x20(%rbp),%r12 0.00 : 5bc47f: 4c 8b 6d e8 mov -0x18(%rbp),%r13 0.00 : 5bc483: 4c 8b 75 f0 mov -0x10(%rbp),%r14 0.00 : 5bc487: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 5bc48b: c9 leaveq : { : /* : * put the tuple into a temp file for later batches : */ : Assert(batchno > hashtable->curbatch); : ExecHashJoinSaveTuple(tuple, 0.00 : 5bc48c: e9 cf 10 00 00 jmpq 5bd560 0.00 : 5bc491: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : /* : * put the tuple in hash table : */ : HashJoinTuple hashTuple; : int hashTupleSize; : double ntuples = (hashtable->totalTuples - hashtable->skewTuples); 0.40 : 5bc498: f2 41 0f 10 45 58 movsd 0x58(%r13),%xmm0 : : /* Create the HashJoinTuple */ : hashTupleSize = HJTUPLE_OVERHEAD + tuple->t_len; : hashTuple = (HashJoinTuple) dense_alloc(hashtable, hashTupleSize); 0.00 : 5bc49e: 4c 89 ef mov %r13,%rdi : /* : * put the tuple in hash table : */ : HashJoinTuple hashTuple; : int hashTupleSize; : double ntuples = (hashtable->totalTuples - hashtable->skewTuples); 0.00 : 5bc4a1: f2 0f 11 45 c0 movsd %xmm0,-0x40(%rbp) 0.40 : 5bc4a6: f2 41 0f 10 4d 60 movsd 0x60(%r13),%xmm1 0.40 : 5bc4ac: f2 0f 11 4d c8 movsd %xmm1,-0x38(%rbp) : : /* Create the HashJoinTuple */ : hashTupleSize = HJTUPLE_OVERHEAD + tuple->t_len; : hashTuple = (HashJoinTuple) dense_alloc(hashtable, hashTupleSize); 0.00 : 5bc4b1: 41 8b 07 mov (%r15),%eax 0.00 : 5bc4b4: 83 c0 10 add $0x10,%eax 0.00 : 5bc4b7: 48 98 cltq 0.00 : 5bc4b9: 48 89 c6 mov %rax,%rsi 0.40 : 5bc4bc: 48 89 45 d0 mov %rax,-0x30(%rbp) 0.00 : 5bc4c0: e8 fb fa ff ff callq 5bbfc0 : : hashTuple->hashvalue = hashvalue; 0.00 : 5bc4c5: 89 58 08 mov %ebx,0x8(%rax) : memcpy(HJTUPLE_MINTUPLE(hashTuple), tuple, tuple->t_len); /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:856 2.41 : 5bc4c8: 41 8b 17 mov (%r15),%edx 0.00 : 5bc4cb: 48 8d 58 10 lea 0x10(%rax),%rbx 0.00 : 5bc4cf: 4c 89 fe mov %r15,%rsi : int hashTupleSize; : double ntuples = (hashtable->totalTuples - hashtable->skewTuples); : : /* Create the HashJoinTuple */ : hashTupleSize = HJTUPLE_OVERHEAD + tuple->t_len; : hashTuple = (HashJoinTuple) dense_alloc(hashtable, hashTupleSize); 0.00 : 5bc4d2: 49 89 c4 mov %rax,%r12 : : hashTuple->hashvalue = hashvalue; : memcpy(HJTUPLE_MINTUPLE(hashTuple), tuple, tuple->t_len); 0.00 : 5bc4d5: 48 89 df mov %rbx,%rdi 0.00 : 5bc4d8: e8 13 d7 ea ff callq 469bf0 : * We always reset the tuple-matched flag on insertion. This is okay : * even when reloading a tuple from a batch file, since the tuple : * could not possibly have been matched to an outer tuple before it : * went into the batch file. : */ : HeapTupleHeaderClearMatch(HJTUPLE_MINTUPLE(hashTuple)); 0.00 : 5bc4dd: 66 81 63 0a ff 7f andw $0x7fff,0xa(%rbx) : : /* Push it onto the front of the bucket's list */ : hashTuple->next = hashtable->buckets[bucketno]; 0.00 : 5bc4e3: 49 63 d6 movslq %r14d,%rdx 0.00 : 5bc4e6: 49 8b 45 18 mov 0x18(%r13),%rax 0.40 : 5bc4ea: 48 8b 04 d0 mov (%rax,%rdx,8),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:867 92.77 : 5bc4ee: 49 89 04 24 mov %rax,(%r12) : hashtable->buckets[bucketno] = hashTuple; 0.40 : 5bc4f2: 49 8b 45 18 mov 0x18(%r13),%rax 0.00 : 5bc4f6: 4c 89 24 d0 mov %r12,(%rax,%rdx,8) : : /* : * Increase the (optimal) number of buckets if we just exceeded the : * NTUP_PER_BUCKET threshold, but only when there's still a single batch. : */ : if ((hashtable->nbatch == 1) && 0.00 : 5bc4fa: 41 83 7d 40 01 cmpl $0x1,0x40(%r13) 0.00 : 5bc4ff: 74 7f je 5bc580 0.00 : 5bc501: 41 8b 55 0c mov 0xc(%r13),%edx : hashtable->nbuckets_optimal *= 2; : hashtable->log2_nbuckets_optimal += 1; : } : : /* Account for space used, and back off if we've used too much */ : hashtable->spaceUsed += hashTupleSize; 0.40 : 5bc505: 48 8b 45 d0 mov -0x30(%rbp),%rax 0.00 : 5bc509: 49 03 85 90 00 00 00 add 0x90(%r13),%rax : if (hashtable->spaceUsed > hashtable->spacePeak) 0.00 : 5bc510: 49 3b 85 a0 00 00 00 cmp 0xa0(%r13),%rax : hashtable->nbuckets_optimal *= 2; : hashtable->log2_nbuckets_optimal += 1; : } : : /* Account for space used, and back off if we've used too much */ : hashtable->spaceUsed += hashTupleSize; 0.00 : 5bc517: 49 89 85 90 00 00 00 mov %rax,0x90(%r13) : if (hashtable->spaceUsed > hashtable->spacePeak) 0.00 : 5bc51e: 77 50 ja 5bc570 : hashtable->spacePeak = hashtable->spaceUsed; : if (hashtable->spaceUsed + 0.00 : 5bc520: 48 63 c2 movslq %edx,%rax 0.00 : 5bc523: 48 c1 e0 03 shl $0x3,%rax 0.00 : 5bc527: 49 03 85 90 00 00 00 add 0x90(%r13),%rax 0.00 : 5bc52e: 49 3b 85 98 00 00 00 cmp 0x98(%r13),%rax 0.00 : 5bc535: 0f 87 8d 00 00 00 ja 5bc5c8 : Assert(batchno > hashtable->curbatch); : ExecHashJoinSaveTuple(tuple, : hashvalue, : &hashtable->innerBatchFile[batchno]); : } : } 0.40 : 5bc53b: 48 8b 5d d8 mov -0x28(%rbp),%rbx 0.00 : 5bc53f: 4c 8b 65 e0 mov -0x20(%rbp),%r12 0.00 : 5bc543: 4c 8b 6d e8 mov -0x18(%rbp),%r13 0.00 : 5bc547: 4c 8b 75 f0 mov -0x10(%rbp),%r14 0.40 : 5bc54b: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 5bc54f: c9 leaveq 0.00 : 5bc550: c3 retq 0.00 : 5bc551: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : *bucketno = hashvalue & (nbuckets - 1); : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); : } : else : { : *bucketno = hashvalue & (nbuckets - 1); 0.00 : 5bc558: 44 8d 72 ff lea -0x1(%rdx),%r14d 0.00 : 5bc55c: 31 d2 xor %edx,%edx 0.00 : 5bc55e: 41 21 de and %ebx,%r14d 0.00 : 5bc561: e9 fb fe ff ff jmpq 5bc461 0.00 : 5bc566: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 5bc56d: 00 00 00 : } : : /* Account for space used, and back off if we've used too much */ : hashtable->spaceUsed += hashTupleSize; : if (hashtable->spaceUsed > hashtable->spacePeak) : hashtable->spacePeak = hashtable->spaceUsed; 0.00 : 5bc570: 49 89 85 a0 00 00 00 mov %rax,0xa0(%r13) 0.00 : 5bc577: eb a7 jmp 5bc520 0.00 : 5bc579: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : : /* : * Increase the (optimal) number of buckets if we just exceeded the : * NTUP_PER_BUCKET threshold, but only when there's still a single batch. : */ : if ((hashtable->nbatch == 1) && 0.00 : 5bc580: 41 8b 55 0c mov 0xc(%r13),%edx 0.00 : 5bc584: 81 fa ff ff ff 3f cmp $0x3fffffff,%edx 0.00 : 5bc58a: 0f 8f 75 ff ff ff jg 5bc505 0.00 : 5bc590: f2 0f 10 45 c0 movsd -0x40(%rbp),%xmm0 0.00 : 5bc595: f2 0f 5c 45 c8 subsd -0x38(%rbp),%xmm0 0.00 : 5bc59a: f2 0f 11 45 c0 movsd %xmm0,-0x40(%rbp) 0.00 : 5bc59f: f2 0f 2a c2 cvtsi2sd %edx,%xmm0 0.40 : 5bc5a3: f2 0f 10 4d c0 movsd -0x40(%rbp),%xmm1 0.00 : 5bc5a8: 66 0f 2e c8 ucomisd %xmm0,%xmm1 0.00 : 5bc5ac: 0f 82 53 ff ff ff jb 5bc505 : (hashtable->nbuckets_optimal <= INT_MAX/2) && /* overflow protection */ : (ntuples >= (hashtable->nbuckets_optimal * NTUP_PER_BUCKET))) : { : hashtable->nbuckets_optimal *= 2; 0.00 : 5bc5b2: 8d 04 12 lea (%rdx,%rdx,1),%eax : hashtable->log2_nbuckets_optimal += 1; 0.00 : 5bc5b5: 41 83 45 10 01 addl $0x1,0x10(%r13) : */ : if ((hashtable->nbatch == 1) && : (hashtable->nbuckets_optimal <= INT_MAX/2) && /* overflow protection */ : (ntuples >= (hashtable->nbuckets_optimal * NTUP_PER_BUCKET))) : { : hashtable->nbuckets_optimal *= 2; 0.00 : 5bc5ba: 41 89 45 0c mov %eax,0xc(%r13) 0.00 : 5bc5be: 89 c2 mov %eax,%edx 0.00 : 5bc5c0: e9 40 ff ff ff jmpq 5bc505 0.00 : 5bc5c5: 0f 1f 00 nopl (%rax) : if (hashtable->spaceUsed > hashtable->spacePeak) : hashtable->spacePeak = hashtable->spaceUsed; : if (hashtable->spaceUsed + : hashtable->nbuckets_optimal * sizeof(HashJoinTuple) : > hashtable->spaceAllowed) : ExecHashIncreaseNumBatches(hashtable); 0.00 : 5bc5c8: 4c 89 ef mov %r13,%rdi : Assert(batchno > hashtable->curbatch); : ExecHashJoinSaveTuple(tuple, : hashvalue, : &hashtable->innerBatchFile[batchno]); : } : } 0.00 : 5bc5cb: 48 8b 5d d8 mov -0x28(%rbp),%rbx 0.00 : 5bc5cf: 4c 8b 65 e0 mov -0x20(%rbp),%r12 0.00 : 5bc5d3: 4c 8b 6d e8 mov -0x18(%rbp),%r13 0.00 : 5bc5d7: 4c 8b 75 f0 mov -0x10(%rbp),%r14 0.00 : 5bc5db: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 5bc5df: c9 leaveq : if (hashtable->spaceUsed > hashtable->spacePeak) : hashtable->spacePeak = hashtable->spaceUsed; : if (hashtable->spaceUsed + : hashtable->nbuckets_optimal * sizeof(HashJoinTuple) : > hashtable->spaceAllowed) : ExecHashIncreaseNumBatches(hashtable); 0.00 : 5bc5e0: e9 fb fa ff ff jmpq 5bc0e0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 69.01 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:924 9.86 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:924 7.04 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 2.82 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:918 2.82 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1035 2.82 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 1.41 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 1.41 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 1.41 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1103 1.41 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1099 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000007a5750 : : * can't see it.) : */ : bool : HeapTupleSatisfiesMVCC(HeapTuple htup, Snapshot snapshot, : Buffer buffer) : { /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:918 2.82 : 7a5750: 55 push %rbp 0.00 : 7a5751: 48 89 e5 mov %rsp,%rbp 0.00 : 7a5754: 4c 89 6d f0 mov %r13,-0x10(%rbp) 0.00 : 7a5758: 4c 89 75 f8 mov %r14,-0x8(%rbp) 0.00 : 7a575c: 41 89 d6 mov %edx,%r14d 0.00 : 7a575f: 48 89 5d e0 mov %rbx,-0x20(%rbp) 0.00 : 7a5763: 4c 89 65 e8 mov %r12,-0x18(%rbp) 0.00 : 7a5767: 48 83 ec 20 sub $0x20,%rsp : HeapTupleHeader tuple = htup->t_data; 0.00 : 7a576b: 48 8b 5f 10 mov 0x10(%rdi),%rbx : * can't see it.) : */ : bool : HeapTupleSatisfiesMVCC(HeapTuple htup, Snapshot snapshot, : Buffer buffer) : { 0.00 : 7a576f: 49 89 f5 mov %rsi,%r13 : HeapTupleHeader tuple = htup->t_data; : : Assert(ItemPointerIsValid(&htup->t_self)); : Assert(htup->t_tableOid != InvalidOid); : : if (!HeapTupleHeaderXminCommitted(tuple)) /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:924 9.86 : 7a5772: 0f b7 4b 14 movzwl 0x14(%rbx),%ecx 69.01 : 7a5776: 0f b7 d1 movzwl %cx,%edx 0.00 : 7a5779: f6 c6 01 test $0x1,%dh 0.00 : 7a577c: 75 72 jne 7a57f0 : { : if (HeapTupleHeaderXminInvalid(tuple)) 0.00 : 7a577e: 89 d0 mov %edx,%eax 0.00 : 7a5780: 25 00 03 00 00 and $0x300,%eax 0.00 : 7a5785: 3d 00 02 00 00 cmp $0x200,%eax 0.00 : 7a578a: 0f 84 06 01 00 00 je 7a5896 : return false; : : /* Used by pre-9.0 binary upgrades */ : if (tuple->t_infomask & HEAP_MOVED_OFF) 0.00 : 7a5790: f6 c6 40 test $0x40,%dh 0.00 : 7a5793: 0f 84 27 01 00 00 je 7a58c0 : { : TransactionId xvac = HeapTupleHeaderGetXvac(tuple); 0.00 : 7a5799: 45 31 e4 xor %r12d,%r12d 0.00 : 7a579c: 66 f7 c2 00 c0 test $0xc000,%dx 0.00 : 7a57a1: 74 04 je 7a57a7 0.00 : 7a57a3: 44 8b 63 08 mov 0x8(%rbx),%r12d : : if (TransactionIdIsCurrentTransactionId(xvac)) 0.00 : 7a57a7: 44 89 e7 mov %r12d,%edi 0.00 : 7a57aa: e8 f1 ec d1 ff callq 4c44a0 0.00 : 7a57af: 84 c0 test %al,%al 0.00 : 7a57b1: 0f 85 df 00 00 00 jne 7a5896 : return false; : if (!TransactionIdIsInProgress(xvac)) 0.00 : 7a57b7: 44 89 e7 mov %r12d,%edi 0.00 : 7a57ba: e8 f1 c4 ed ff callq 681cb0 0.00 : 7a57bf: 84 c0 test %al,%al 0.00 : 7a57c1: 0f 85 1f 01 00 00 jne 7a58e6 : { : if (TransactionIdDidCommit(xvac)) 0.00 : 7a57c7: 44 89 e7 mov %r12d,%edi 0.00 : 7a57ca: e8 11 ab d1 ff callq 4c02e0 0.00 : 7a57cf: 84 c0 test %al,%al 0.00 : 7a57d1: 0f 85 79 02 00 00 jne 7a5a50 : if (!TransactionIdIsCurrentTransactionId(xvac)) : { : if (TransactionIdIsInProgress(xvac)) : return false; : if (TransactionIdDidCommit(xvac)) : SetHintBits(tuple, buffer, HEAP_XMIN_COMMITTED, 0.00 : 7a57d7: ba 00 01 00 00 mov $0x100,%edx 0.00 : 7a57dc: 31 c9 xor %ecx,%ecx 0.00 : 7a57de: 44 89 f6 mov %r14d,%esi 0.00 : 7a57e1: 48 89 df mov %rbx,%rdi 0.00 : 7a57e4: e8 b7 f2 ff ff callq 7a4aa0 0.00 : 7a57e9: 0f b7 53 14 movzwl 0x14(%rbx),%edx 0.00 : 7a57ed: 0f 1f 00 nopl (%rax) : : /* : * By here, the inserting transaction has committed - have to check : * when... : */ : if (!HeapTupleHeaderXminFrozen(tuple) /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 1.41 : 7a57f0: 89 d0 mov %edx,%eax 0.00 : 7a57f2: 25 00 03 00 00 and $0x300,%eax 0.00 : 7a57f7: 3d 00 03 00 00 cmp $0x300,%eax 0.00 : 7a57fc: 0f 85 86 00 00 00 jne 7a5888 : return false; /* treat as still in progress */ : : if (tuple->t_infomask & HEAP_XMAX_INVALID) /* xid invalid or aborted */ : return true; : : if (HEAP_XMAX_IS_LOCKED_ONLY(tuple->t_infomask)) /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1035 2.82 : 7a5802: f7 c2 80 08 00 00 test $0x880,%edx 0.00 : 7a5808: 0f 85 a2 00 00 00 jne 7a58b0 0.00 : 7a580e: 89 d0 mov %edx,%eax 0.00 : 7a5810: 25 50 10 00 00 and $0x1050,%eax 0.00 : 7a5815: 83 f8 40 cmp $0x40,%eax 0.00 : 7a5818: 0f 84 92 00 00 00 je 7a58b0 : return true; : : if (tuple->t_infomask & HEAP_XMAX_IS_MULTI) 0.00 : 7a581e: f6 c6 10 test $0x10,%dh 0.00 : 7a5821: 0f 85 b9 01 00 00 jne 7a59e0 : } : /* it must have aborted or crashed */ : return true; : } : : if (!(tuple->t_infomask & HEAP_XMAX_COMMITTED)) 0.00 : 7a5827: 80 e6 04 and $0x4,%dh 0.00 : 7a582a: 75 44 jne 7a5870 : { : if (TransactionIdIsCurrentTransactionId(HeapTupleHeaderGetRawXmax(tuple))) 0.00 : 7a582c: 8b 7b 04 mov 0x4(%rbx),%edi 0.00 : 7a582f: 90 nop 0.00 : 7a5830: e8 6b ec d1 ff callq 4c44a0 0.00 : 7a5835: 84 c0 test %al,%al 0.00 : 7a5837: 0f 85 43 01 00 00 jne 7a5980 : return true; /* deleted after scan started */ : else : return false; /* deleted before scan started */ : } : : if (TransactionIdIsInProgress(HeapTupleHeaderGetRawXmax(tuple))) 0.00 : 7a583d: 8b 7b 04 mov 0x4(%rbx),%edi 0.00 : 7a5840: e8 6b c4 ed ff callq 681cb0 0.00 : 7a5845: 84 c0 test %al,%al 0.00 : 7a5847: 75 67 jne 7a58b0 : return true; : : if (!TransactionIdDidCommit(HeapTupleHeaderGetRawXmax(tuple))) 0.00 : 7a5849: 8b 7b 04 mov 0x4(%rbx),%edi 0.00 : 7a584c: e8 8f aa d1 ff callq 4c02e0 0.00 : 7a5851: 84 c0 test %al,%al 0.00 : 7a5853: 0f 84 20 02 00 00 je 7a5a79 : InvalidTransactionId); : return true; : } : : /* xmax transaction committed */ : SetHintBits(tuple, buffer, HEAP_XMAX_COMMITTED, 0.00 : 7a5859: 8b 4b 04 mov 0x4(%rbx),%ecx 0.00 : 7a585c: ba 00 04 00 00 mov $0x400,%edx 0.00 : 7a5861: 44 89 f6 mov %r14d,%esi 0.00 : 7a5864: 48 89 df mov %rbx,%rdi 0.00 : 7a5867: e8 34 f2 ff ff callq 7a4aa0 0.00 : 7a586c: 0f 1f 40 00 nopl 0x0(%rax) : } : : /* : * OK, the deleting transaction committed too ... but when? : */ : if (XidInMVCCSnapshot(HeapTupleHeaderGetRawXmax(tuple), snapshot)) 0.00 : 7a5870: 8b 7b 04 mov 0x4(%rbx),%edi 0.00 : 7a5873: 4c 89 ee mov %r13,%rsi 0.00 : 7a5876: e8 85 fd ff ff callq 7a5600 0.00 : 7a587b: 84 c0 test %al,%al 0.00 : 7a587d: 0f 95 c0 setne %al 0.00 : 7a5880: eb 16 jmp 7a5898 0.00 : 7a5882: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : : /* : * By here, the inserting transaction has committed - have to check : * when... : */ : if (!HeapTupleHeaderXminFrozen(tuple) /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 1.41 : 7a5888: 8b 3b mov (%rbx),%edi /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 7.04 : 7a588a: 4c 89 ee mov %r13,%rsi 0.00 : 7a588d: e8 6e fd ff ff callq 7a5600 0.00 : 7a5892: 84 c0 test %al,%al 0.00 : 7a5894: 74 6a je 7a5900 : } : : /* : * OK, the deleting transaction committed too ... but when? : */ : if (XidInMVCCSnapshot(HeapTupleHeaderGetRawXmax(tuple), snapshot)) 0.00 : 7a5896: 31 c0 xor %eax,%eax : return true; /* treat as still in progress */ : : return false; : } /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1103 1.41 : 7a5898: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 7a589c: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 7a58a1: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 7a58a6: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 0.00 : 7a58ab: c9 leaveq 0.00 : 7a58ac: c3 retq 0.00 : 7a58ad: 0f 1f 00 nopl (%rax) : } : : /* : * OK, the deleting transaction committed too ... but when? : */ : if (XidInMVCCSnapshot(HeapTupleHeaderGetRawXmax(tuple), snapshot)) /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1099 1.41 : 7a58b0: b8 01 00 00 00 mov $0x1,%eax 0.00 : 7a58b5: eb e1 jmp 7a5898 0.00 : 7a58b7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 7a58be: 00 00 : SetHintBits(tuple, buffer, HEAP_XMIN_COMMITTED, : InvalidTransactionId); : } : } : /* Used by pre-9.0 binary upgrades */ : else if (tuple->t_infomask & HEAP_MOVED_IN) 0.00 : 7a58c0: 66 85 c9 test %cx,%cx 0.00 : 7a58c3: 79 4b jns 7a5910 : { : TransactionId xvac = HeapTupleHeaderGetXvac(tuple); 0.00 : 7a58c5: 45 31 e4 xor %r12d,%r12d 0.00 : 7a58c8: 66 f7 c2 00 c0 test $0xc000,%dx 0.00 : 7a58cd: 0f 1f 00 nopl (%rax) 0.00 : 7a58d0: 0f 85 fa 00 00 00 jne 7a59d0 : : if (!TransactionIdIsCurrentTransactionId(xvac)) 0.00 : 7a58d6: 44 89 e7 mov %r12d,%edi 0.00 : 7a58d9: e8 c2 eb d1 ff callq 4c44a0 0.00 : 7a58de: 84 c0 test %al,%al 0.00 : 7a58e0: 0f 84 4a 01 00 00 je 7a5a30 : return false; /* deleted before scan started */ : } : else if (TransactionIdIsInProgress(HeapTupleHeaderGetRawXmin(tuple))) : return false; : else if (TransactionIdDidCommit(HeapTupleHeaderGetRawXmin(tuple))) : SetHintBits(tuple, buffer, HEAP_XMIN_COMMITTED, 0.00 : 7a58e6: 0f b7 53 14 movzwl 0x14(%rbx),%edx : : /* : * By here, the inserting transaction has committed - have to check : * when... : */ : if (!HeapTupleHeaderXminFrozen(tuple) 0.00 : 7a58ea: 89 d0 mov %edx,%eax 0.00 : 7a58ec: 25 00 03 00 00 and $0x300,%eax 0.00 : 7a58f1: 3d 00 03 00 00 cmp $0x300,%eax 0.00 : 7a58f6: 0f 84 06 ff ff ff je 7a5802 0.00 : 7a58fc: eb 8a jmp 7a5888 0.00 : 7a58fe: 66 90 xchg %ax,%ax /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 2.82 : 7a5900: 0f b7 53 14 movzwl 0x14(%rbx),%edx 0.00 : 7a5904: e9 f9 fe ff ff jmpq 7a5802 0.00 : 7a5909: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : InvalidTransactionId); : return false; : } : } : } : else if (TransactionIdIsCurrentTransactionId(HeapTupleHeaderGetRawXmin(tuple))) 0.00 : 7a5910: 8b 3b mov (%rbx),%edi 0.00 : 7a5912: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 7a5918: e8 83 eb d1 ff callq 4c44a0 0.00 : 7a591d: 84 c0 test %al,%al 0.00 : 7a591f: 90 nop 0.00 : 7a5920: 74 76 je 7a5998 : { : if (HeapTupleHeaderGetCmin(tuple) >= snapshot->curcid) 0.00 : 7a5922: 48 89 df mov %rbx,%rdi 0.00 : 7a5925: e8 96 eb ff ff callq 7a44c0 0.00 : 7a592a: 41 3b 45 2c cmp 0x2c(%r13),%eax 0.00 : 7a592e: 66 90 xchg %ax,%ax 0.00 : 7a5930: 0f 83 60 ff ff ff jae 7a5896 : return false; /* inserted after scan started */ : : if (tuple->t_infomask & HEAP_XMAX_INVALID) /* xid invalid */ 0.00 : 7a5936: 0f b7 53 14 movzwl 0x14(%rbx),%edx : return true; : : if (HEAP_XMAX_IS_LOCKED_ONLY(tuple->t_infomask)) /* not deleter */ 0.00 : 7a593a: f7 c2 80 08 00 00 test $0x880,%edx 0.00 : 7a5940: 0f 85 6a ff ff ff jne 7a58b0 0.00 : 7a5946: 89 d0 mov %edx,%eax 0.00 : 7a5948: 25 50 10 00 00 and $0x1050,%eax 0.00 : 7a594d: 83 f8 40 cmp $0x40,%eax 0.00 : 7a5950: 0f 84 5a ff ff ff je 7a58b0 : return true; : : if (tuple->t_infomask & HEAP_XMAX_IS_MULTI) 0.00 : 7a5956: 80 e6 10 and $0x10,%dh 0.00 : 7a5959: 0f 84 0a 01 00 00 je 7a5a69 : { : TransactionId xmax; : : xmax = HeapTupleGetUpdateXid(tuple); 0.00 : 7a595f: 48 89 df mov %rbx,%rdi 0.00 : 7a5962: e8 b9 17 cf ff callq 497120 0.00 : 7a5967: 89 c7 mov %eax,%edi : : /* not LOCKED_ONLY, so it has to have an xmax */ : Assert(TransactionIdIsValid(xmax)); : : /* updating subtransaction must have aborted */ : if (!TransactionIdIsCurrentTransactionId(xmax)) 0.00 : 7a5969: e8 32 eb d1 ff callq 4c44a0 0.00 : 7a596e: 84 c0 test %al,%al 0.00 : 7a5970: 0f 84 3a ff ff ff je 7a58b0 0.00 : 7a5976: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 7a597d: 00 00 00 : : if (!(tuple->t_infomask & HEAP_XMAX_COMMITTED)) : { : if (TransactionIdIsCurrentTransactionId(HeapTupleHeaderGetRawXmax(tuple))) : { : if (HeapTupleHeaderGetCmax(tuple) >= snapshot->curcid) 0.00 : 7a5980: 48 89 df mov %rbx,%rdi 0.00 : 7a5983: e8 58 eb ff ff callq 7a44e0 0.00 : 7a5988: 41 3b 45 2c cmp 0x2c(%r13),%eax 0.00 : 7a598c: 0f 93 c0 setae %al 0.00 : 7a598f: e9 04 ff ff ff jmpq 7a5898 0.00 : 7a5994: 0f 1f 40 00 nopl 0x0(%rax) : if (HeapTupleHeaderGetCmax(tuple) >= snapshot->curcid) : return true; /* deleted after scan started */ : else : return false; /* deleted before scan started */ : } : else if (TransactionIdIsInProgress(HeapTupleHeaderGetRawXmin(tuple))) 0.00 : 7a5998: 8b 3b mov (%rbx),%edi 0.00 : 7a599a: e8 11 c3 ed ff callq 681cb0 0.00 : 7a599f: 84 c0 test %al,%al 0.00 : 7a59a1: 0f 85 ef fe ff ff jne 7a5896 : return false; : else if (TransactionIdDidCommit(HeapTupleHeaderGetRawXmin(tuple))) 0.00 : 7a59a7: 8b 3b mov (%rbx),%edi 0.00 : 7a59a9: e8 32 a9 d1 ff callq 4c02e0 0.00 : 7a59ae: 84 c0 test %al,%al 0.00 : 7a59b0: 0f 84 9a 00 00 00 je 7a5a50 : SetHintBits(tuple, buffer, HEAP_XMIN_COMMITTED, 0.00 : 7a59b6: 8b 0b mov (%rbx),%ecx 0.00 : 7a59b8: ba 00 01 00 00 mov $0x100,%edx 0.00 : 7a59bd: 44 89 f6 mov %r14d,%esi 0.00 : 7a59c0: 48 89 df mov %rbx,%rdi 0.00 : 7a59c3: e8 d8 f0 ff ff callq 7a4aa0 0.00 : 7a59c8: e9 19 ff ff ff jmpq 7a58e6 0.00 : 7a59cd: 0f 1f 00 nopl (%rax) : } : } : /* Used by pre-9.0 binary upgrades */ : else if (tuple->t_infomask & HEAP_MOVED_IN) : { : TransactionId xvac = HeapTupleHeaderGetXvac(tuple); 0.00 : 7a59d0: 44 8b 63 08 mov 0x8(%rbx),%r12d 0.00 : 7a59d4: e9 fd fe ff ff jmpq 7a58d6 0.00 : 7a59d9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : TransactionId xmax; : : /* already checked above */ : Assert(!HEAP_XMAX_IS_LOCKED_ONLY(tuple->t_infomask)); : : xmax = HeapTupleGetUpdateXid(tuple); 0.00 : 7a59e0: 48 89 df mov %rbx,%rdi 0.00 : 7a59e3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 7a59e8: e8 33 17 cf ff callq 497120 : : /* not LOCKED_ONLY, so it has to have an xmax */ : Assert(TransactionIdIsValid(xmax)); : : if (TransactionIdIsCurrentTransactionId(xmax)) 0.00 : 7a59ed: 89 c7 mov %eax,%edi : TransactionId xmax; : : /* already checked above */ : Assert(!HEAP_XMAX_IS_LOCKED_ONLY(tuple->t_infomask)); : : xmax = HeapTupleGetUpdateXid(tuple); 0.00 : 7a59ef: 41 89 c4 mov %eax,%r12d : : /* not LOCKED_ONLY, so it has to have an xmax */ : Assert(TransactionIdIsValid(xmax)); : : if (TransactionIdIsCurrentTransactionId(xmax)) 0.00 : 7a59f2: e8 a9 ea d1 ff callq 4c44a0 0.00 : 7a59f7: 84 c0 test %al,%al 0.00 : 7a59f9: 75 85 jne 7a5980 : if (HeapTupleHeaderGetCmax(tuple) >= snapshot->curcid) : return true; /* deleted after scan started */ : else : return false; /* deleted before scan started */ : } : if (TransactionIdIsInProgress(xmax)) 0.00 : 7a59fb: 44 89 e7 mov %r12d,%edi 0.00 : 7a59fe: e8 ad c2 ed ff callq 681cb0 0.00 : 7a5a03: 84 c0 test %al,%al 0.00 : 7a5a05: 0f 85 a5 fe ff ff jne 7a58b0 : return true; : if (TransactionIdDidCommit(xmax)) 0.00 : 7a5a0b: 44 89 e7 mov %r12d,%edi 0.00 : 7a5a0e: e8 cd a8 d1 ff callq 4c02e0 0.00 : 7a5a13: 84 c0 test %al,%al 0.00 : 7a5a15: 0f 84 95 fe ff ff je 7a58b0 : { : /* updating transaction committed, but when? */ : if (XidInMVCCSnapshot(xmax, snapshot)) 0.00 : 7a5a1b: 4c 89 ee mov %r13,%rsi 0.00 : 7a5a1e: 44 89 e7 mov %r12d,%edi 0.00 : 7a5a21: e8 da fb ff ff callq 7a5600 0.00 : 7a5a26: 84 c0 test %al,%al 0.00 : 7a5a28: 0f 95 c0 setne %al 0.00 : 7a5a2b: e9 68 fe ff ff jmpq 7a5898 : { : TransactionId xvac = HeapTupleHeaderGetXvac(tuple); : : if (!TransactionIdIsCurrentTransactionId(xvac)) : { : if (TransactionIdIsInProgress(xvac)) 0.00 : 7a5a30: 44 89 e7 mov %r12d,%edi 0.00 : 7a5a33: e8 78 c2 ed ff callq 681cb0 0.00 : 7a5a38: 84 c0 test %al,%al 0.00 : 7a5a3a: 0f 85 56 fe ff ff jne 7a5896 : return false; : if (TransactionIdDidCommit(xvac)) 0.00 : 7a5a40: 44 89 e7 mov %r12d,%edi 0.00 : 7a5a43: e8 98 a8 d1 ff callq 4c02e0 0.00 : 7a5a48: 84 c0 test %al,%al 0.00 : 7a5a4a: 0f 85 87 fd ff ff jne 7a57d7 : SetHintBits(tuple, buffer, HEAP_XMIN_COMMITTED, : HeapTupleHeaderGetRawXmin(tuple)); : else : { : /* it must have aborted or crashed */ : SetHintBits(tuple, buffer, HEAP_XMIN_INVALID, 0.00 : 7a5a50: 31 c9 xor %ecx,%ecx 0.00 : 7a5a52: ba 00 02 00 00 mov $0x200,%edx 0.00 : 7a5a57: 44 89 f6 mov %r14d,%esi 0.00 : 7a5a5a: 48 89 df mov %rbx,%rdi 0.00 : 7a5a5d: e8 3e f0 ff ff callq 7a4aa0 0.00 : 7a5a62: 31 c0 xor %eax,%eax : */ : if (XidInMVCCSnapshot(HeapTupleHeaderGetRawXmax(tuple), snapshot)) : return true; /* treat as still in progress */ : : return false; : } 0.00 : 7a5a64: e9 2f fe ff ff jmpq 7a5898 : return true; /* updated after scan started */ : else : return false; /* updated before scan started */ : } : : if (!TransactionIdIsCurrentTransactionId(HeapTupleHeaderGetRawXmax(tuple))) 0.00 : 7a5a69: 8b 7b 04 mov 0x4(%rbx),%edi 0.00 : 7a5a6c: e8 2f ea d1 ff callq 4c44a0 0.00 : 7a5a71: 84 c0 test %al,%al 0.00 : 7a5a73: 0f 85 07 ff ff ff jne 7a5980 : return true; : : if (!TransactionIdDidCommit(HeapTupleHeaderGetRawXmax(tuple))) : { : /* it must have aborted or crashed */ : SetHintBits(tuple, buffer, HEAP_XMAX_INVALID, 0.00 : 7a5a79: 31 c9 xor %ecx,%ecx 0.00 : 7a5a7b: ba 00 08 00 00 mov $0x800,%edx 0.00 : 7a5a80: 44 89 f6 mov %r14d,%esi 0.00 : 7a5a83: 48 89 df mov %rbx,%rdi 0.00 : 7a5a86: e8 15 f0 ff ff callq 7a4aa0 0.00 : 7a5a8b: b8 01 00 00 00 mov $0x1,%eax : */ : if (XidInMVCCSnapshot(HeapTupleHeaderGetRawXmax(tuple), snapshot)) : return true; /* treat as still in progress */ : : return false; : } 0.00 : 7a5a90: e9 03 fe ff ff jmpq 7a5898 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1140 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1049 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1049 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1052 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1056 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1085 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1097 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1097 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1097 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1139 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1140 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 4.17 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000046ef10 : : * re-computing information about previously extracted attributes. : * slot->tts_nvalid is the number of attributes already extracted. : */ : static void : slot_deform_tuple(TupleTableSlot *slot, int natts) : { 0.00 : 46ef10: 55 push %rbp 0.00 : 46ef11: 48 89 e5 mov %rsp,%rbp 0.00 : 46ef14: 41 57 push %r15 0.00 : 46ef16: 41 89 f7 mov %esi,%r15d /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1049 8.33 : 46ef19: 41 56 push %r14 0.00 : 46ef1b: 49 89 fe mov %rdi,%r14 0.00 : 46ef1e: 41 55 push %r13 0.00 : 46ef20: 41 54 push %r12 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1049 4.17 : 46ef22: 53 push %rbx : /* : * Check whether the first call for this tuple, and initialize or restore : * loop state. : */ : attnum = slot->tts_nvalid; : if (attnum == 0) 0.00 : 46ef23: 31 db xor %ebx,%ebx : * re-computing information about previously extracted attributes. : * slot->tts_nvalid is the number of attributes already extracted. : */ : static void : slot_deform_tuple(TupleTableSlot *slot, int natts) : { 0.00 : 46ef25: 48 83 ec 28 sub $0x28,%rsp : HeapTuple tuple = slot->tts_tuple; : TupleDesc tupleDesc = slot->tts_tupleDescriptor; : Datum *values = slot->tts_values; 0.00 : 46ef29: 48 8b 47 28 mov 0x28(%rdi),%rax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1052 4.17 : 46ef2d: 48 89 45 d0 mov %rax,-0x30(%rbp) : bool *isnull = slot->tts_isnull; : HeapTupleHeader tup = tuple->t_data; 0.00 : 46ef31: 48 8b 47 08 mov 0x8(%rdi),%rax : : /* : * Check whether the first call for this tuple, and initialize or restore : * loop state. : */ : attnum = slot->tts_nvalid; 0.00 : 46ef35: 8b 77 24 mov 0x24(%rdi),%esi : slot_deform_tuple(TupleTableSlot *slot, int natts) : { : HeapTuple tuple = slot->tts_tuple; : TupleDesc tupleDesc = slot->tts_tupleDescriptor; : Datum *values = slot->tts_values; : bool *isnull = slot->tts_isnull; 0.00 : 46ef38: 4c 8b 5f 30 mov 0x30(%rdi),%r11 : HeapTupleHeader tup = tuple->t_data; 0.00 : 46ef3c: 4c 8b 40 10 mov 0x10(%rax),%r8 : bool hasnulls = HeapTupleHasNulls(tuple); 0.00 : 46ef40: 41 0f b7 40 14 movzwl 0x14(%r8),%eax 0.00 : 46ef45: 83 e0 01 and $0x1,%eax 0.00 : 46ef48: 41 89 c2 mov %eax,%r10d : Form_pg_attribute *att = tupleDesc->attrs; 0.00 : 46ef4b: 48 8b 47 10 mov 0x10(%rdi),%rax : /* : * Check whether the first call for this tuple, and initialize or restore : * loop state. : */ : attnum = slot->tts_nvalid; : if (attnum == 0) 0.00 : 46ef4f: 31 ff xor %edi,%edi 0.00 : 46ef51: 85 f6 test %esi,%esi : TupleDesc tupleDesc = slot->tts_tupleDescriptor; : Datum *values = slot->tts_values; : bool *isnull = slot->tts_isnull; : HeapTupleHeader tup = tuple->t_data; : bool hasnulls = HeapTupleHasNulls(tuple); : Form_pg_attribute *att = tupleDesc->attrs; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1056 4.17 : 46ef53: 4c 8b 48 08 mov 0x8(%rax),%r9 : /* : * Check whether the first call for this tuple, and initialize or restore : * loop state. : */ : attnum = slot->tts_nvalid; : if (attnum == 0) 0.00 : 46ef57: 74 09 je 46ef62 : } : else : { : /* Restore state from previous execution */ : off = slot->tts_off; : slow = slot->tts_slow; 0.00 : 46ef59: 41 0f b6 7e 07 movzbl 0x7(%r14),%edi : slow = false; : } : else : { : /* Restore state from previous execution */ : off = slot->tts_off; 0.00 : 46ef5e: 49 8b 5e 58 mov 0x58(%r14),%rbx : slow = slot->tts_slow; : } : : tp = (char *) tup + tup->t_hoff; 0.00 : 46ef62: 41 0f b6 40 16 movzbl 0x16(%r8),%eax : : for (; attnum < natts; attnum++) 0.00 : 46ef67: 44 39 fe cmp %r15d,%esi : /* Restore state from previous execution */ : off = slot->tts_off; : slow = slot->tts_slow; : } : : tp = (char *) tup + tup->t_hoff; 0.00 : 46ef6a: 4d 8d 2c 00 lea (%r8,%rax,1),%r13 : : for (; attnum < natts; attnum++) 0.00 : 46ef6e: 0f 8d c0 00 00 00 jge 46f034 0.00 : 46ef74: 41 89 f4 mov %esi,%r12d 0.00 : 46ef77: eb 40 jmp 46efb9 0.00 : 46ef79: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : { : Form_pg_attribute thisatt = att[attnum]; : : if (hasnulls && att_isnull(attnum, bp)) 0.00 : 46ef80: 44 89 e0 mov %r12d,%eax 0.00 : 46ef83: 44 89 e1 mov %r12d,%ecx 0.00 : 46ef86: c1 f8 03 sar $0x3,%eax 0.00 : 46ef89: 83 e1 07 and $0x7,%ecx 0.00 : 46ef8c: 48 98 cltq 0.00 : 46ef8e: 41 0f b6 44 00 17 movzbl 0x17(%r8,%rax,1),%eax 0.00 : 46ef94: d3 f8 sar %cl,%eax 0.00 : 46ef96: a8 01 test $0x1,%al 0.00 : 46ef98: 75 2b jne 46efc5 : { : values[attnum] = (Datum) 0; 0.00 : 46ef9a: 48 8b 55 d0 mov -0x30(%rbp),%rdx : isnull[attnum] = true; 0.00 : 46ef9e: bf 01 00 00 00 mov $0x1,%edi : { : Form_pg_attribute thisatt = att[attnum]; : : if (hasnulls && att_isnull(attnum, bp)) : { : values[attnum] = (Datum) 0; 0.00 : 46efa3: 48 c7 04 f2 00 00 00 movq $0x0,(%rdx,%rsi,8) 0.00 : 46efaa: 00 : isnull[attnum] = true; 0.00 : 46efab: 41 c6 04 33 01 movb $0x1,(%r11,%rsi,1) : slow = slot->tts_slow; : } : : tp = (char *) tup + tup->t_hoff; : : for (; attnum < natts; attnum++) 0.00 : 46efb0: 41 83 c4 01 add $0x1,%r12d 0.00 : 46efb4: 45 39 e7 cmp %r12d,%r15d 0.00 : 46efb7: 7e 78 jle 46f031 : { : Form_pg_attribute thisatt = att[attnum]; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1085 4.17 : 46efb9: 49 63 f4 movslq %r12d,%rsi : : if (hasnulls && att_isnull(attnum, bp)) 0.00 : 46efbc: 45 84 d2 test %r10b,%r10b : : tp = (char *) tup + tup->t_hoff; : : for (; attnum < natts; attnum++) : { : Form_pg_attribute thisatt = att[attnum]; 0.00 : 46efbf: 49 8b 14 f1 mov (%r9,%rsi,8),%rdx : : if (hasnulls && att_isnull(attnum, bp)) 0.00 : 46efc3: 75 bb jne 46ef80 : continue; : } : : isnull[attnum] = false; : : if (!slow && thisatt->attcacheoff >= 0) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1097 4.17 : 46efc5: 40 84 ff test %dil,%dil : isnull[attnum] = true; : slow = true; /* can't use attcacheoff anymore */ : continue; : } : : isnull[attnum] = false; 0.00 : 46efc8: 41 c6 04 33 00 movb $0x0,(%r11,%rsi,1) : : if (!slow && thisatt->attcacheoff >= 0) 4.17 : 46efcd: 0f 85 7d 00 00 00 jne 46f050 4.17 : 46efd3: 8b 42 54 mov 0x54(%rdx),%eax 0.00 : 46efd6: 85 c0 test %eax,%eax 0.00 : 46efd8: 78 76 js 46f050 : off = thisatt->attcacheoff; 0.00 : 46efda: 48 63 d8 movslq %eax,%rbx : : if (!slow) : thisatt->attcacheoff = off; : } : : values[attnum] = fetchatt(thisatt, tp + off); 0.00 : 46efdd: 80 7a 5c 00 cmpb $0x0,0x5c(%rdx) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 4.17 : 46efe1: 49 8d 44 1d 00 lea 0x0(%r13,%rbx,1),%rax 0.00 : 46efe6: 74 28 je 46f010 0.00 : 46efe8: 0f b7 42 4c movzwl 0x4c(%rdx),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 8.33 : 46efec: 66 83 f8 08 cmp $0x8,%ax 0.00 : 46eff0: 0f 84 3a 01 00 00 je 46f130 0.00 : 46eff6: 66 83 f8 04 cmp $0x4,%ax 0.00 : 46effa: 0f 84 90 01 00 00 je 46f190 0.00 : 46f000: 66 83 f8 02 cmp $0x2,%ax 0.00 : 46f004: 0f 84 a6 01 00 00 je 46f1b0 0.00 : 46f00a: 41 0f b6 44 1d 00 movzbl 0x0(%r13,%rbx,1),%eax 12.50 : 46f010: 48 8b 4d d0 mov -0x30(%rbp),%rcx 0.00 : 46f014: 48 89 04 f1 mov %rax,(%rcx,%rsi,8) : : off = att_addlength_pointer(off, thisatt->attlen, tp + off); 0.00 : 46f018: 0f b7 42 4c movzwl 0x4c(%rdx),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 4.17 : 46f01c: 66 85 c0 test %ax,%ax 0.00 : 46f01f: 7e 6f jle 46f090 0.00 : 46f021: 48 0f bf c0 movswq %ax,%rax : slow = slot->tts_slow; : } : : tp = (char *) tup + tup->t_hoff; : : for (; attnum < natts; attnum++) 0.00 : 46f025: 41 83 c4 01 add $0x1,%r12d : thisatt->attcacheoff = off; : } : : values[attnum] = fetchatt(thisatt, tp + off); : : off = att_addlength_pointer(off, thisatt->attlen, tp + off); 0.00 : 46f029: 48 01 c3 add %rax,%rbx : slow = slot->tts_slow; : } : : tp = (char *) tup + tup->t_hoff; : : for (; attnum < natts; attnum++) 0.00 : 46f02c: 45 39 e7 cmp %r12d,%r15d 0.00 : 46f02f: 7f 88 jg 46efb9 : * re-computing information about previously extracted attributes. : * slot->tts_nvalid is the number of attributes already extracted. : */ : static void : slot_deform_tuple(TupleTableSlot *slot, int natts) : { 0.00 : 46f031: 44 89 fe mov %r15d,%esi : : /* : * Save state for next execution : */ : slot->tts_nvalid = attnum; : slot->tts_off = off; 0.00 : 46f034: 49 89 5e 58 mov %rbx,0x58(%r14) : } : : /* : * Save state for next execution : */ : slot->tts_nvalid = attnum; 0.00 : 46f038: 41 89 76 24 mov %esi,0x24(%r14) : slot->tts_off = off; : slot->tts_slow = slow; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1139 4.17 : 46f03c: 41 88 7e 07 mov %dil,0x7(%r14) : } 0.00 : 46f040: 48 83 c4 28 add $0x28,%rsp 0.00 : 46f044: 5b pop %rbx 0.00 : 46f045: 41 5c pop %r12 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1140 4.17 : 46f047: 41 5d pop %r13 0.00 : 46f049: 41 5e pop %r14 0.00 : 46f04b: 41 5f pop %r15 0.00 : 46f04d: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1140 12.50 : 46f04e: c3 retq 0.00 : 46f04f: 90 nop : : isnull[attnum] = false; : : if (!slow && thisatt->attcacheoff >= 0) : off = thisatt->attcacheoff; : else if (thisatt->attlen == -1) 0.00 : 46f050: 66 83 7a 4c ff cmpw $0xffff,0x4c(%rdx) 0.00 : 46f055: 74 71 je 46f0c8 : } : } : else : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, thisatt->attalign); 0.00 : 46f057: 0f b6 42 5e movzbl 0x5e(%rdx),%eax 0.00 : 46f05b: 3c 69 cmp $0x69,%al 0.00 : 46f05d: 0f 84 1d 01 00 00 je 46f180 0.00 : 46f063: 3c 63 cmp $0x63,%al 0.00 : 46f065: 74 10 je 46f077 0.00 : 46f067: 3c 64 cmp $0x64,%al 0.00 : 46f069: 0f 84 51 01 00 00 je 46f1c0 0.00 : 46f06f: 48 83 c3 01 add $0x1,%rbx 0.00 : 46f073: 48 83 e3 fe and $0xfffffffffffffffe,%rbx : : if (!slow) 0.00 : 46f077: 40 84 ff test %dil,%dil 0.00 : 46f07a: 0f 85 5d ff ff ff jne 46efdd : thisatt->attcacheoff = off; 0.00 : 46f080: 89 5a 54 mov %ebx,0x54(%rdx) 0.00 : 46f083: e9 55 ff ff ff jmpq 46efdd 0.00 : 46f088: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 46f08f: 00 : } : : values[attnum] = fetchatt(thisatt, tp + off); : : off = att_addlength_pointer(off, thisatt->attlen, tp + off); 0.00 : 46f090: 66 83 c0 01 add $0x1,%ax 0.00 : 46f094: 0f 85 a6 00 00 00 jne 46f140 0.00 : 46f09a: 41 0f b6 44 1d 00 movzbl 0x0(%r13,%rbx,1),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 4.17 : 46f0a0: 3c 01 cmp $0x1,%al 0.00 : 46f0a2: 0f 84 50 01 00 00 je 46f1f8 0.00 : 46f0a8: a8 01 test $0x1,%al 0.00 : 46f0aa: 0f 85 20 01 00 00 jne 46f1d0 0.00 : 46f0b0: 41 8b 44 1d 00 mov 0x0(%r13,%rbx,1),%eax 0.00 : 46f0b5: c1 e8 02 shr $0x2,%eax 0.00 : 46f0b8: 89 c0 mov %eax,%eax 0.00 : 46f0ba: 48 8d 1c 18 lea (%rax,%rbx,1),%rbx 0.00 : 46f0be: e9 ad 00 00 00 jmpq 46f170 0.00 : 46f0c3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : * We can only cache the offset for a varlena attribute if the : * offset is already suitably aligned, so that there would be no : * pad bytes in any case: then the offset will be valid for either : * an aligned or unaligned value. : */ : if (!slow && 0.00 : 46f0c8: 40 84 ff test %dil,%dil 0.00 : 46f0cb: 75 26 jne 46f0f3 0.00 : 46f0cd: 0f b6 42 5e movzbl 0x5e(%rdx),%eax 0.00 : 46f0d1: 3c 69 cmp $0x69,%al 0.00 : 46f0d3: 0f 84 4f 01 00 00 je 46f228 0.00 : 46f0d9: 3c 63 cmp $0x63,%al 0.00 : 46f0db: 74 a3 je 46f080 0.00 : 46f0dd: 3c 64 cmp $0x64,%al 0.00 : 46f0df: 90 nop 0.00 : 46f0e0: 0f 84 52 01 00 00 je 46f238 0.00 : 46f0e6: 48 8d 43 01 lea 0x1(%rbx),%rax 0.00 : 46f0ea: 48 83 e0 fe and $0xfffffffffffffffe,%rax 0.00 : 46f0ee: 48 39 d8 cmp %rbx,%rax 0.00 : 46f0f1: 74 8d je 46f080 : off == att_align_nominal(off, thisatt->attalign)) : thisatt->attcacheoff = off; : else : { : off = att_align_pointer(off, thisatt->attalign, -1, 0.00 : 46f0f3: 41 80 7c 1d 00 00 cmpb $0x0,0x0(%r13,%rbx,1) 0.00 : 46f0f9: 0f 85 a1 00 00 00 jne 46f1a0 0.00 : 46f0ff: 0f b6 42 5e movzbl 0x5e(%rdx),%eax 0.00 : 46f103: 3c 69 cmp $0x69,%al 0.00 : 46f105: 0f 84 d5 00 00 00 je 46f1e0 0.00 : 46f10b: 3c 63 cmp $0x63,%al 0.00 : 46f10d: 0f 1f 00 nopl (%rax) 0.00 : 46f110: 0f 84 8a 00 00 00 je 46f1a0 0.00 : 46f116: 3c 64 cmp $0x64,%al 0.00 : 46f118: 0f 84 27 01 00 00 je 46f245 0.00 : 46f11e: 48 83 c3 01 add $0x1,%rbx 0.00 : 46f122: bf 01 00 00 00 mov $0x1,%edi 0.00 : 46f127: 48 83 e3 fe and $0xfffffffffffffffe,%rbx 0.00 : 46f12b: e9 ad fe ff ff jmpq 46efdd : : if (!slow) : thisatt->attcacheoff = off; : } : : values[attnum] = fetchatt(thisatt, tp + off); 0.00 : 46f130: 49 8b 44 1d 00 mov 0x0(%r13,%rbx,1),%rax 0.00 : 46f135: e9 d6 fe ff ff jmpq 46f010 0.00 : 46f13a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : : off = att_addlength_pointer(off, thisatt->attlen, tp + off); 0.00 : 46f140: 49 8d 7c 1d 00 lea 0x0(%r13,%rbx,1),%rdi 0.00 : 46f145: 4c 89 45 c8 mov %r8,-0x38(%rbp) 0.00 : 46f149: 4c 89 4d c0 mov %r9,-0x40(%rbp) 0.00 : 46f14d: 44 88 55 b8 mov %r10b,-0x48(%rbp) 0.00 : 46f151: 4c 89 5d b0 mov %r11,-0x50(%rbp) 0.00 : 46f155: e8 f6 a6 ff ff callq 469850 0.00 : 46f15a: 44 0f b6 55 b8 movzbl -0x48(%rbp),%r10d 0.00 : 46f15f: 4c 8b 45 c8 mov -0x38(%rbp),%r8 0.00 : 46f163: 48 8d 5c 03 01 lea 0x1(%rbx,%rax,1),%rbx 0.00 : 46f168: 4c 8b 4d c0 mov -0x40(%rbp),%r9 0.00 : 46f16c: 4c 8b 5d b0 mov -0x50(%rbp),%r11 : * Save state for next execution : */ : slot->tts_nvalid = attnum; : slot->tts_off = off; : slot->tts_slow = slow; : } 0.00 : 46f170: bf 01 00 00 00 mov $0x1,%edi 0.00 : 46f175: e9 36 fe ff ff jmpq 46efb0 0.00 : 46f17a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : } : } : else : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, thisatt->attalign); 0.00 : 46f180: 48 83 c3 03 add $0x3,%rbx 0.00 : 46f184: 48 83 e3 fc and $0xfffffffffffffffc,%rbx 0.00 : 46f188: e9 ea fe ff ff jmpq 46f077 0.00 : 46f18d: 0f 1f 00 nopl (%rax) : : if (!slow) : thisatt->attcacheoff = off; : } : : values[attnum] = fetchatt(thisatt, tp + off); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 4.17 : 46f190: 41 8b 44 1d 00 mov 0x0(%r13,%rbx,1),%eax 4.17 : 46f195: e9 76 fe ff ff jmpq 46f010 0.00 : 46f19a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, thisatt->attalign); : : if (!slow) : thisatt->attcacheoff = off; 0.00 : 46f1a0: bf 01 00 00 00 mov $0x1,%edi 0.00 : 46f1a5: e9 33 fe ff ff jmpq 46efdd 0.00 : 46f1aa: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : } : : values[attnum] = fetchatt(thisatt, tp + off); 0.00 : 46f1b0: 41 0f b7 44 1d 00 movzwl 0x0(%r13,%rbx,1),%eax 0.00 : 46f1b6: e9 55 fe ff ff jmpq 46f010 0.00 : 46f1bb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : } : } : else : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, thisatt->attalign); 0.00 : 46f1c0: 48 83 c3 07 add $0x7,%rbx 0.00 : 46f1c4: 48 83 e3 f8 and $0xfffffffffffffff8,%rbx 0.00 : 46f1c8: e9 aa fe ff ff jmpq 46f077 0.00 : 46f1cd: 0f 1f 00 nopl (%rax) : thisatt->attcacheoff = off; : } : : values[attnum] = fetchatt(thisatt, tp + off); : : off = att_addlength_pointer(off, thisatt->attlen, tp + off); 0.00 : 46f1d0: d0 e8 shr %al 0.00 : 46f1d2: 0f b6 c0 movzbl %al,%eax 0.00 : 46f1d5: e9 e0 fe ff ff jmpq 46f0ba 0.00 : 46f1da: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : if (!slow && : off == att_align_nominal(off, thisatt->attalign)) : thisatt->attcacheoff = off; : else : { : off = att_align_pointer(off, thisatt->attalign, -1, 0.00 : 46f1e0: 48 83 c3 03 add $0x3,%rbx 0.00 : 46f1e4: bf 01 00 00 00 mov $0x1,%edi 0.00 : 46f1e9: 48 83 e3 fc and $0xfffffffffffffffc,%rbx 0.00 : 46f1ed: e9 eb fd ff ff jmpq 46efdd 0.00 : 46f1f2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : thisatt->attcacheoff = off; : } : : values[attnum] = fetchatt(thisatt, tp + off); : : off = att_addlength_pointer(off, thisatt->attlen, tp + off); 0.00 : 46f1f8: 41 0f b6 54 1d 01 movzbl 0x1(%r13,%rbx,1),%edx 0.00 : 46f1fe: b8 0a 00 00 00 mov $0xa,%eax 0.00 : 46f203: 80 fa 01 cmp $0x1,%dl 0.00 : 46f206: 0f 84 ae fe ff ff je 46f0ba 0.00 : 46f20c: 80 fa 12 cmp $0x12,%dl 0.00 : 46f20f: b8 03 00 00 00 mov $0x3,%eax 0.00 : 46f214: ba 12 00 00 00 mov $0x12,%edx 0.00 : 46f219: 48 0f 44 c2 cmove %rdx,%rax 0.00 : 46f21d: e9 98 fe ff ff jmpq 46f0ba 0.00 : 46f222: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * We can only cache the offset for a varlena attribute if the : * offset is already suitably aligned, so that there would be no : * pad bytes in any case: then the offset will be valid for either : * an aligned or unaligned value. : */ : if (!slow && 0.00 : 46f228: 48 8d 43 03 lea 0x3(%rbx),%rax 0.00 : 46f22c: 48 83 e0 fc and $0xfffffffffffffffc,%rax 0.00 : 46f230: e9 b9 fe ff ff jmpq 46f0ee 0.00 : 46f235: 0f 1f 00 nopl (%rax) 0.00 : 46f238: 48 8d 43 07 lea 0x7(%rbx),%rax 0.00 : 46f23c: 48 83 e0 f8 and $0xfffffffffffffff8,%rax 0.00 : 46f240: e9 a9 fe ff ff jmpq 46f0ee : off == att_align_nominal(off, thisatt->attalign)) : thisatt->attcacheoff = off; : else : { : off = att_align_pointer(off, thisatt->attalign, -1, 0.00 : 46f245: 48 83 c3 07 add $0x7,%rbx 0.00 : 46f249: bf 01 00 00 00 mov $0x1,%edi 0.00 : 46f24e: 48 83 e3 f8 and $0xfffffffffffffff8,%rbx 0.00 : 46f252: e9 86 fd ff ff jmpq 46efdd Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:995 9.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 9.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 9.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 9.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:943 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/nodes/pg_list.h:87 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:955 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:955 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:970 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:984 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:985 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bbe90 : : ExprContext *econtext, : List *hashkeys, : bool outer_tuple, : bool keep_nulls, : uint32 *hashvalue) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 4.76 : 5bbe90: 55 push %rbp 0.00 : 5bbe91: 48 89 e5 mov %rsp,%rbp 4.76 : 5bbe94: 41 57 push %r15 0.00 : 5bbe96: 49 89 ff mov %rdi,%r15 0.00 : 5bbe99: 41 56 push %r14 0.00 : 5bbe9b: 49 89 f6 mov %rsi,%r14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 9.52 : 5bbe9e: 41 55 push %r13 0.00 : 5bbea0: 41 54 push %r12 0.00 : 5bbea2: 49 89 d4 mov %rdx,%r12 0.00 : 5bbea5: 53 push %rbx 9.52 : 5bbea6: 89 cb mov %ecx,%ebx 0.00 : 5bbea8: 48 83 ec 38 sub $0x38,%rsp 0.00 : 5bbeac: 4c 89 4d a8 mov %r9,-0x58(%rbp) 0.00 : 5bbeb0: 44 88 45 b7 mov %r8b,-0x49(%rbp) : : /* : * We reset the eval context each time to reclaim any memory leaked in the : * hashkey expressions. : */ : ResetExprContext(econtext); 0.00 : 5bbeb4: 48 8b 7e 28 mov 0x28(%rsi),%rdi 0.00 : 5bbeb8: e8 f3 ca 1d 00 callq 7989b0 : #endif /* !PG_USE_INLINE */ : #if defined(PG_USE_INLINE) || defined(MCXT_INCLUDE_DEFINITIONS) : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; 0.00 : 5bbebd: 48 8b 05 9c e9 5f 00 mov 0x5fe99c(%rip),%rax # bba860 : : oldContext = MemoryContextSwitchTo(econtext->ecxt_per_tuple_memory); : : if (outer_tuple) 0.00 : 5bbec4: 84 db test %bl,%bl 0.00 : 5bbec6: 48 89 45 c0 mov %rax,-0x40(%rbp) : : CurrentMemoryContext = context; /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 9.52 : 5bbeca: 49 8b 46 28 mov 0x28(%r14),%rax 0.00 : 5bbece: 48 89 05 8b e9 5f 00 mov %rax,0x5fe98b(%rip) # bba860 0.00 : 5bbed5: 0f 84 d5 00 00 00 je 5bbfb0 : hashfunctions = hashtable->outer_hashfunctions; 0.00 : 5bbedb: 49 8b 47 78 mov 0x78(%r15),%rax 0.00 : 5bbedf: 48 89 45 b8 mov %rax,-0x48(%rbp) : #endif /* PG_USE_INLINE */ : #if defined(PG_USE_INLINE) || defined(PG_LIST_INCLUDE_DEFINITIONS) : STATIC_IF_INLINE ListCell * : list_head(const List *l) : { : return l ? l->head : NULL; /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/nodes/pg_list.h:87 4.76 : 5bbee3: 4d 85 e4 test %r12,%r12 0.00 : 5bbee6: 0f 84 94 00 00 00 je 5bbf80 0.00 : 5bbeec: 49 8b 5c 24 08 mov 0x8(%r12),%rbx : else : hashfunctions = hashtable->inner_hashfunctions; : : foreach(hk, hashkeys) 0.00 : 5bbef1: 48 85 db test %rbx,%rbx 0.00 : 5bbef4: 0f 84 86 00 00 00 je 5bbf80 0.00 : 5bbefa: 45 31 ed xor %r13d,%r13d /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:943 9.52 : 5bbefd: 45 31 e4 xor %r12d,%r12d : { : ExprState *keyexpr = (ExprState *) lfirst(hk); 0.00 : 5bbf00: 48 8b 03 mov (%rbx),%rax : hashkey = (hashkey << 1) | ((hashkey & 0x80000000) ? 1 : 0); : : /* : * Get the join attribute value of the tuple : */ : keyval = ExecEvalExpr(keyexpr, econtext, &isNull, NULL); 0.00 : 5bbf03: 31 c9 xor %ecx,%ecx : ExprState *keyexpr = (ExprState *) lfirst(hk); : Datum keyval; : bool isNull; : : /* rotate hashkey left 1 bit at each step */ : hashkey = (hashkey << 1) | ((hashkey & 0x80000000) ? 1 : 0); 0.00 : 5bbf05: 41 d1 c5 rol %r13d : : /* : * Get the join attribute value of the tuple : */ : keyval = ExecEvalExpr(keyexpr, econtext, &isNull, NULL); 0.00 : 5bbf08: 48 8d 55 d7 lea -0x29(%rbp),%rdx 0.00 : 5bbf0c: 4c 89 f6 mov %r14,%rsi /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:955 4.76 : 5bbf0f: 48 89 c7 mov %rax,%rdi 4.76 : 5bbf12: ff 50 10 callq *0x10(%rax) : * : * Note: currently, all hashjoinable operators must be strict since : * the hash index AM assumes that. However, it takes so little extra : * code here to allow non-strict that we may as well do it. : */ : if (isNull) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:970 4.76 : 5bbf15: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) 0.00 : 5bbf19: 74 35 je 5bbf50 : { : if (hashtable->hashStrict[i] && !keep_nulls) 0.00 : 5bbf1b: 49 8b 87 88 00 00 00 mov 0x88(%r15),%rax 0.00 : 5bbf22: 49 63 d4 movslq %r12d,%rdx 0.00 : 5bbf25: 80 3c 10 00 cmpb $0x0,(%rax,%rdx,1) 0.00 : 5bbf29: 74 41 je 5bbf6c 0.00 : 5bbf2b: 80 7d b7 00 cmpb $0x0,-0x49(%rbp) 0.00 : 5bbf2f: 75 3b jne 5bbf6c 0.00 : 5bbf31: 48 8b 45 c0 mov -0x40(%rbp),%rax 0.00 : 5bbf35: 48 89 05 24 e9 5f 00 mov %rax,0x5fe924(%rip) # bba860 : : MemoryContextSwitchTo(oldContext); : : *hashvalue = hashkey; : return true; : } 0.00 : 5bbf3c: 48 83 c4 38 add $0x38,%rsp 0.00 : 5bbf40: 31 c0 xor %eax,%eax 0.00 : 5bbf42: 5b pop %rbx 0.00 : 5bbf43: 41 5c pop %r12 0.00 : 5bbf45: 41 5d pop %r13 0.00 : 5bbf47: 41 5e pop %r14 0.00 : 5bbf49: 41 5f pop %r15 0.00 : 5bbf4b: c9 leaveq 0.00 : 5bbf4c: c3 retq 0.00 : 5bbf4d: 0f 1f 00 nopl (%rax) : else : { : /* Compute the hash function */ : uint32 hkey; : : hkey = DatumGetUInt32(FunctionCall1(&hashfunctions[i], keyval)); /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:984 4.76 : 5bbf50: 49 63 fc movslq %r12d,%rdi 0.00 : 5bbf53: 48 89 c2 mov %rax,%rdx 0.00 : 5bbf56: 31 f6 xor %esi,%esi 0.00 : 5bbf58: 48 8d 3c 7f lea (%rdi,%rdi,2),%rdi 0.00 : 5bbf5c: 48 c1 e7 04 shl $0x4,%rdi 0.00 : 5bbf60: 48 03 7d b8 add -0x48(%rbp),%rdi 0.00 : 5bbf64: e8 67 21 1c 00 callq 77e0d0 : hashkey ^= hkey; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:985 4.76 : 5bbf69: 41 31 c5 xor %eax,%r13d : if (outer_tuple) : hashfunctions = hashtable->outer_hashfunctions; : else : hashfunctions = hashtable->inner_hashfunctions; : : foreach(hk, hashkeys) 0.00 : 5bbf6c: 48 8b 5b 08 mov 0x8(%rbx),%rbx 0.00 : 5bbf70: 48 85 db test %rbx,%rbx 0.00 : 5bbf73: 74 13 je 5bbf88 : : hkey = DatumGetUInt32(FunctionCall1(&hashfunctions[i], keyval)); : hashkey ^= hkey; : } : : i++; 0.00 : 5bbf75: 41 83 c4 01 add $0x1,%r12d 0.00 : 5bbf79: eb 85 jmp 5bbf00 0.00 : 5bbf7b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5bbf80: 45 31 ed xor %r13d,%r13d 0.00 : 5bbf83: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 4.76 : 5bbf88: 48 8b 45 c0 mov -0x40(%rbp),%rax 4.76 : 5bbf8c: 48 89 05 cd e8 5f 00 mov %rax,0x5fe8cd(%rip) # bba860 : } : : MemoryContextSwitchTo(oldContext); : : *hashvalue = hashkey; 0.00 : 5bbf93: 48 8b 45 a8 mov -0x58(%rbp),%rax 0.00 : 5bbf97: 44 89 28 mov %r13d,(%rax) : return true; : } /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:995 14.29 : 5bbf9a: 48 83 c4 38 add $0x38,%rsp : i++; : } : : MemoryContextSwitchTo(oldContext); : : *hashvalue = hashkey; 0.00 : 5bbf9e: b8 01 00 00 00 mov $0x1,%eax : return true; : } 0.00 : 5bbfa3: 5b pop %rbx 0.00 : 5bbfa4: 41 5c pop %r12 0.00 : 5bbfa6: 41 5d pop %r13 0.00 : 5bbfa8: 41 5e pop %r14 0.00 : 5bbfaa: 41 5f pop %r15 0.00 : 5bbfac: c9 leaveq 0.00 : 5bbfad: c3 retq 0.00 : 5bbfae: 66 90 xchg %ax,%ax : oldContext = MemoryContextSwitchTo(econtext->ecxt_per_tuple_memory); : : if (outer_tuple) : hashfunctions = hashtable->outer_hashfunctions; : else : hashfunctions = hashtable->inner_hashfunctions; 0.00 : 5bbfb0: 49 8b 87 80 00 00 00 mov 0x80(%r15),%rax 0.00 : 5bbfb7: 48 89 45 b8 mov %rax,-0x48(%rbp) 0.00 : 5bbfbb: e9 23 ff ff ff jmpq 5bbee3 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 15.79 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1454 10.53 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1466 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1407 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1407 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1407 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1427 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1425 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1445 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1449 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1461 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1463 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1466 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1466 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1466 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1475 5.26 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1475 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000004704e0 : : */ : MinimalTuple : heap_form_minimal_tuple(TupleDesc tupleDescriptor, : Datum *values, : bool *isnull) : { 0.00 : 4704e0: 55 push %rbp 0.00 : 4704e1: 48 89 e5 mov %rsp,%rbp 0.00 : 4704e4: 41 57 push %r15 0.00 : 4704e6: 49 89 d7 mov %rdx,%r15 0.00 : 4704e9: 41 56 push %r14 0.00 : 4704eb: 49 89 fe mov %rdi,%r14 0.00 : 4704ee: 41 55 push %r13 5.26 : 4704f0: 41 54 push %r12 5.26 : 4704f2: 53 push %rbx 5.26 : 4704f3: 48 83 ec 28 sub $0x28,%rsp 0.00 : 4704f7: 48 89 75 c0 mov %rsi,-0x40(%rbp) : MinimalTuple tuple; /* return tuple */ : Size len, : data_len; : int hoff; : bool hasnull = false; : int numberOfAttributes = tupleDescriptor->natts; 0.00 : 4704fb: 44 8b 2f mov (%rdi),%r13d : int i; : : if (numberOfAttributes > MaxTupleAttributeNumber) 0.00 : 4704fe: 41 81 fd 80 06 00 00 cmp $0x680,%r13d 0.00 : 470505: 0f 8f fb 00 00 00 jg 470606 : numberOfAttributes, MaxTupleAttributeNumber))); : : /* : * Check for nulls : */ : for (i = 0; i < numberOfAttributes; i++) 0.00 : 47050b: 45 85 ed test %r13d,%r13d 0.00 : 47050e: 7e 28 jle 470538 : { : if (isnull[i]) 0.00 : 470510: 48 89 d1 mov %rdx,%rcx 0.00 : 470513: 31 d2 xor %edx,%edx /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1427 5.26 : 470515: 41 80 3f 00 cmpb $0x0,(%r15) 0.00 : 470519: 74 15 je 470530 0.00 : 47051b: e9 d0 00 00 00 jmpq 4705f0 0.00 : 470520: 0f b6 41 01 movzbl 0x1(%rcx),%eax 0.00 : 470524: 48 83 c1 01 add $0x1,%rcx 0.00 : 470528: 84 c0 test %al,%al 0.00 : 47052a: 0f 85 c0 00 00 00 jne 4705f0 : numberOfAttributes, MaxTupleAttributeNumber))); : : /* : * Check for nulls : */ : for (i = 0; i < numberOfAttributes; i++) 0.00 : 470530: 83 c2 01 add $0x1,%edx /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1425 5.26 : 470533: 41 39 d5 cmp %edx,%r13d 0.00 : 470536: 7f e8 jg 470520 : * Determine total space needed : */ : len = offsetof(MinimalTupleData, t_bits); : : if (hasnull) : len += BITMAPLEN(numberOfAttributes); 0.00 : 470538: ba 0f 00 00 00 mov $0xf,%edx 0.00 : 47053d: c6 45 d7 00 movb $0x0,-0x29(%rbp) : : if (tupleDescriptor->tdhasoid) : len += sizeof(Oid); 0.00 : 470541: 41 80 7e 20 00 cmpb $0x0,0x20(%r14) 0.00 : 470546: 48 8d 42 04 lea 0x4(%rdx),%rax : : hoff = len = MAXALIGN(len); /* align user data safely */ : : data_len = heap_compute_data_size(tupleDescriptor, values, isnull); 0.00 : 47054a: 48 8b 75 c0 mov -0x40(%rbp),%rsi 0.00 : 47054e: 4c 89 f7 mov %r14,%rdi : : if (hasnull) : len += BITMAPLEN(numberOfAttributes); : : if (tupleDescriptor->tdhasoid) : len += sizeof(Oid); 0.00 : 470551: 48 0f 45 d0 cmovne %rax,%rdx : : hoff = len = MAXALIGN(len); /* align user data safely */ 0.00 : 470555: 48 8d 5a 07 lea 0x7(%rdx),%rbx : : data_len = heap_compute_data_size(tupleDescriptor, values, isnull); 0.00 : 470559: 4c 89 fa mov %r15,%rdx : len += BITMAPLEN(numberOfAttributes); : : if (tupleDescriptor->tdhasoid) : len += sizeof(Oid); : : hoff = len = MAXALIGN(len); /* align user data safely */ 0.00 : 47055c: 48 83 e3 f8 and $0xfffffffffffffff8,%rbx /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1445 5.26 : 470560: 89 5d d0 mov %ebx,-0x30(%rbp) : : data_len = heap_compute_data_size(tupleDescriptor, values, isnull); 0.00 : 470563: e8 08 fe ff ff callq 470370 : : len += data_len; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1449 5.26 : 470568: 48 01 c3 add %rax,%rbx : if (tupleDescriptor->tdhasoid) : len += sizeof(Oid); : : hoff = len = MAXALIGN(len); /* align user data safely */ : : data_len = heap_compute_data_size(tupleDescriptor, values, isnull); 0.00 : 47056b: 48 89 45 c8 mov %rax,-0x38(%rbp) : len += data_len; : : /* : * Allocate and zero the space needed. : */ : tuple = (MinimalTuple) palloc0(len); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1454 15.79 : 47056f: 48 89 df mov %rbx,%rdi 0.00 : 470572: e8 f9 89 32 00 callq 798f70 : : /* : * And fill in the information. : */ : tuple->t_len = len; 0.00 : 470577: 89 18 mov %ebx,(%rax) : len += data_len; : : /* : * Allocate and zero the space needed. : */ : tuple = (MinimalTuple) palloc0(len); 0.00 : 470579: 49 89 c4 mov %rax,%r12 : : /* : * And fill in the information. : */ : tuple->t_len = len; : HeapTupleHeaderSetNatts(tuple, numberOfAttributes); 0.00 : 47057c: 0f b7 40 0a movzwl 0xa(%rax),%eax 0.00 : 470580: 66 25 00 f8 and $0xf800,%ax 0.00 : 470584: 44 09 e8 or %r13d,%eax 0.00 : 470587: 66 41 89 44 24 0a mov %ax,0xa(%r12) : tuple->t_hoff = hoff + MINIMAL_TUPLE_OFFSET; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1461 5.26 : 47058d: 0f b6 45 d0 movzbl -0x30(%rbp),%eax 0.00 : 470591: 83 c0 08 add $0x8,%eax 0.00 : 470594: 41 88 44 24 0e mov %al,0xe(%r12) : : if (tupleDescriptor->tdhasoid) /* else leave infomask = 0 */ /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1463 5.26 : 470599: 41 80 7e 20 00 cmpb $0x0,0x20(%r14) 0.00 : 47059e: 74 08 je 4705a8 : tuple->t_infomask = HEAP_HASOID; 0.00 : 4705a0: 66 41 c7 44 24 0c 08 movw $0x8,0xc(%r12) 0.00 : 4705a7: 00 : : heap_fill_tuple(tupleDescriptor, 0.00 : 4705a8: 48 63 4d d0 movslq -0x30(%rbp),%rcx 0.00 : 4705ac: 31 d2 xor %edx,%edx 0.00 : 4705ae: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) 0.00 : 4705b2: 49 8d 44 24 0f lea 0xf(%r12),%rax 0.00 : 4705b7: 4c 8b 45 c8 mov -0x38(%rbp),%r8 0.00 : 4705bb: 48 8b 75 c0 mov -0x40(%rbp),%rsi 0.00 : 4705bf: 4d 8d 4c 24 0c lea 0xc(%r12),%r9 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1466 5.26 : 4705c4: 4c 89 f7 mov %r14,%rdi 0.00 : 4705c7: 48 0f 45 d0 cmovne %rax,%rdx 0.00 : 4705cb: 49 8d 0c 0c lea (%r12,%rcx,1),%rcx 5.26 : 4705cf: 48 89 14 24 mov %rdx,(%rsp) 10.53 : 4705d3: 4c 89 fa mov %r15,%rdx 5.26 : 4705d6: e8 85 f9 ff ff callq 46ff60 : data_len, : &tuple->t_infomask, : (hasnull ? tuple->t_bits : NULL)); : : return tuple; : } 0.00 : 4705db: 48 83 c4 28 add $0x28,%rsp 0.00 : 4705df: 4c 89 e0 mov %r12,%rax 0.00 : 4705e2: 5b pop %rbx /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1475 5.26 : 4705e3: 41 5c pop %r12 0.00 : 4705e5: 41 5d pop %r13 0.00 : 4705e7: 41 5e pop %r14 0.00 : 4705e9: 41 5f pop %r15 5.26 : 4705eb: c9 leaveq 0.00 : 4705ec: c3 retq 0.00 : 4705ed: 0f 1f 00 nopl (%rax) : * Determine total space needed : */ : len = offsetof(MinimalTupleData, t_bits); : : if (hasnull) : len += BITMAPLEN(numberOfAttributes); 0.00 : 4705f0: 41 8d 45 07 lea 0x7(%r13),%eax 0.00 : 4705f4: c6 45 d7 01 movb $0x1,-0x29(%rbp) 0.00 : 4705f8: c1 f8 03 sar $0x3,%eax 0.00 : 4705fb: 48 98 cltq 0.00 : 4705fd: 48 8d 50 0f lea 0xf(%rax),%rdx 0.00 : 470601: e9 3b ff ff ff jmpq 470541 : bool hasnull = false; : int numberOfAttributes = tupleDescriptor->natts; : int i; : : if (numberOfAttributes > MaxTupleAttributeNumber) : ereport(ERROR, 0.00 : 470606: 45 31 c0 xor %r8d,%r8d 0.00 : 470609: b9 90 f6 7a 00 mov $0x7af690,%ecx 0.00 : 47060e: ba 8c 05 00 00 mov $0x58c,%edx 0.00 : 470613: be f4 f5 7a 00 mov $0x7af5f4,%esi 0.00 : 470618: bf 14 00 00 00 mov $0x14,%edi 0.00 : 47061d: e8 9e a4 30 00 callq 77aac0 0.00 : 470622: 84 c0 test %al,%al 0.00 : 470624: 74 2b je 470651 0.00 : 470626: 44 89 ee mov %r13d,%esi 0.00 : 470629: ba 80 06 00 00 mov $0x680,%edx 0.00 : 47062e: bf e0 f7 7a 00 mov $0x7af7e0,%edi 0.00 : 470633: 31 c0 xor %eax,%eax 0.00 : 470635: e8 66 c2 30 00 callq 77c8a0 0.00 : 47063a: bf 05 01 04 01 mov $0x1040105,%edi 0.00 : 47063f: 89 c3 mov %eax,%ebx 0.00 : 470641: e8 0a c7 30 00 callq 77cd50 0.00 : 470646: 89 de mov %ebx,%esi 0.00 : 470648: 89 c7 mov %eax,%edi 0.00 : 47064a: 31 c0 xor %eax,%eax 0.00 : 47064c: e8 8f 9f 30 00 callq 77a5e0 0.00 : 470651: e8 7a 8e ff ff callq 4694d0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 26.32 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5450 10.53 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5436 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5386 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5386 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5386 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5386 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5411 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5421 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5441 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5450 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5450 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5451 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5451 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5494 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005ad000 : : * data will be valid, he must call ExecMaterializeSlot on the : * result slot. : */ : TupleTableSlot * : ExecProject(ProjectionInfo *projInfo, ExprDoneCond *isDone) : { 0.00 : 5ad000: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5386 5.26 : 5ad001: 48 89 e5 mov %rsp,%rbp 0.00 : 5ad004: 41 57 push %r15 0.00 : 5ad006: 41 56 push %r14 5.26 : 5ad008: 41 55 push %r13 5.26 : 5ad00a: 41 54 push %r12 0.00 : 5ad00c: 53 push %rbx 0.00 : 5ad00d: 48 89 fb mov %rdi,%rbx 5.26 : 5ad010: 48 83 ec 48 sub $0x48,%rsp 0.00 : 5ad014: 48 89 75 90 mov %rsi,-0x70(%rbp) : Assert(projInfo != NULL); : : /* : * get the projection info we want : */ : slot = projInfo->pi_slot; 0.00 : 5ad018: 48 8b 47 18 mov 0x18(%rdi),%rax : econtext = projInfo->pi_exprContext; : : /* Assume single result row until proven otherwise */ : if (isDone) 0.00 : 5ad01c: 48 85 f6 test %rsi,%rsi : Assert(projInfo != NULL); : : /* : * get the projection info we want : */ : slot = projInfo->pi_slot; 0.00 : 5ad01f: 48 89 45 b0 mov %rax,-0x50(%rbp) : econtext = projInfo->pi_exprContext; 0.00 : 5ad023: 4c 8b 77 10 mov 0x10(%rdi),%r14 : : /* Assume single result row until proven otherwise */ : if (isDone) 0.00 : 5ad027: 74 06 je 5ad02f : *isDone = ExprSingleResult; 0.00 : 5ad029: c7 06 00 00 00 00 movl $0x0,(%rsi) : /* : * Clear any former contents of the result slot. This makes it safe for : * us to use the slot's Datum/isnull arrays as workspace. (Also, we can : * return the slot as-is if we decide no rows can be projected.) : */ : ExecClearTuple(slot); /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5411 5.26 : 5ad02f: 48 8b 7d b0 mov -0x50(%rbp),%rdi 0.00 : 5ad033: e8 d8 70 00 00 callq 5b4110 : /* : * Force extraction of all input values that we'll need. The : * Var-extraction loops below depend on this, and we are also prefetching : * all attributes that will be referenced in the generic expressions. : */ : if (projInfo->pi_lastInnerVar > 0) 0.00 : 5ad038: 8b 73 48 mov 0x48(%rbx),%esi 0.00 : 5ad03b: 85 f6 test %esi,%esi 0.00 : 5ad03d: 7e 09 jle 5ad048 : slot_getsomeattrs(econtext->ecxt_innertuple, 0.00 : 5ad03f: 49 8b 7e 10 mov 0x10(%r14),%rdi 0.00 : 5ad043: e8 18 22 ec ff callq 46f260 : projInfo->pi_lastInnerVar); : if (projInfo->pi_lastOuterVar > 0) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5421 5.26 : 5ad048: 8b 73 4c mov 0x4c(%rbx),%esi 0.00 : 5ad04b: 85 f6 test %esi,%esi 0.00 : 5ad04d: 7e 09 jle 5ad058 : slot_getsomeattrs(econtext->ecxt_outertuple, 0.00 : 5ad04f: 49 8b 7e 18 mov 0x18(%r14),%rdi 0.00 : 5ad053: e8 08 22 ec ff callq 46f260 : projInfo->pi_lastOuterVar); : if (projInfo->pi_lastScanVar > 0) 0.00 : 5ad058: 8b 73 50 mov 0x50(%rbx),%esi 0.00 : 5ad05b: 85 f6 test %esi,%esi 0.00 : 5ad05d: 7e 09 jle 5ad068 : slot_getsomeattrs(econtext->ecxt_scantuple, 0.00 : 5ad05f: 49 8b 7e 08 mov 0x8(%r14),%rdi 0.00 : 5ad063: e8 f8 21 ec ff callq 46f260 : : /* : * Assign simple Vars to result by direct extraction of fields from source : * slots ... a mite ugly, but fast ... : */ : numSimpleVars = projInfo->pi_numSimpleVars; 0.00 : 5ad068: 44 8b 43 2c mov 0x2c(%rbx),%r8d : if (numSimpleVars > 0) 0.00 : 5ad06c: 45 85 c0 test %r8d,%r8d 0.00 : 5ad06f: 7e 5d jle 5ad0ce : bool *isnull = slot->tts_isnull; : int *varSlotOffsets = projInfo->pi_varSlotOffsets; : int *varNumbers = projInfo->pi_varNumbers; : int i; : : if (projInfo->pi_directMap) 0.00 : 5ad071: 80 7b 28 00 cmpb $0x0,0x28(%rbx) : * slots ... a mite ugly, but fast ... : */ : numSimpleVars = projInfo->pi_numSimpleVars; : if (numSimpleVars > 0) : { : Datum *values = slot->tts_values; 0.00 : 5ad075: 48 8b 55 b0 mov -0x50(%rbp),%rdx : bool *isnull = slot->tts_isnull; : int *varSlotOffsets = projInfo->pi_varSlotOffsets; 0.00 : 5ad079: 4c 8b 5b 30 mov 0x30(%rbx),%r11 : int *varNumbers = projInfo->pi_varNumbers; 0.00 : 5ad07d: 4c 8b 53 38 mov 0x38(%rbx),%r10 : * slots ... a mite ugly, but fast ... : */ : numSimpleVars = projInfo->pi_numSimpleVars; : if (numSimpleVars > 0) : { : Datum *values = slot->tts_values; 0.00 : 5ad081: 4c 8b 6a 28 mov 0x28(%rdx),%r13 : bool *isnull = slot->tts_isnull; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5436 10.53 : 5ad085: 4c 8b 62 30 mov 0x30(%rdx),%r12 : int *varSlotOffsets = projInfo->pi_varSlotOffsets; : int *varNumbers = projInfo->pi_varNumbers; : int i; : : if (projInfo->pi_directMap) 0.00 : 5ad089: 0f 84 e1 01 00 00 je 5ad270 0.00 : 5ad08f: 4c 89 df mov %r11,%rdi 0.00 : 5ad092: 31 f6 xor %esi,%esi /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5441 5.26 : 5ad094: 0f 1f 40 00 nopl 0x0(%rax) : { : /* especially simple case where vars go to output in order */ : for (i = 0; i < numSimpleVars; i++) : { : char *slotptr = ((char *) econtext) + varSlotOffsets[i]; : TupleTableSlot *varSlot = *((TupleTableSlot **) slotptr); 0.00 : 5ad098: 48 63 07 movslq (%rdi),%rax : int varNumber = varNumbers[i] - 1; : : values[i] = varSlot->tts_values[varNumber]; : isnull[i] = varSlot->tts_isnull[varNumber]; 0.00 : 5ad09b: 48 83 c7 04 add $0x4,%rdi : { : /* especially simple case where vars go to output in order */ : for (i = 0; i < numSimpleVars; i++) : { : char *slotptr = ((char *) econtext) + varSlotOffsets[i]; : TupleTableSlot *varSlot = *((TupleTableSlot **) slotptr); 0.00 : 5ad09f: 49 8b 0c 06 mov (%r14,%rax,1),%rcx : int varNumber = varNumbers[i] - 1; : : values[i] = varSlot->tts_values[varNumber]; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5450 26.32 : 5ad0a3: 41 8b 04 b2 mov (%r10,%rsi,4),%eax 0.00 : 5ad0a7: 48 8b 51 28 mov 0x28(%rcx),%rdx 5.26 : 5ad0ab: 83 e8 01 sub $0x1,%eax 0.00 : 5ad0ae: 48 98 cltq 0.00 : 5ad0b0: 48 8b 14 c2 mov (%rdx,%rax,8),%rdx 5.26 : 5ad0b4: 49 89 54 f5 00 mov %rdx,0x0(%r13,%rsi,8) : isnull[i] = varSlot->tts_isnull[varNumber]; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5451 5.26 : 5ad0b9: 48 8b 51 30 mov 0x30(%rcx),%rdx 0.00 : 5ad0bd: 0f b6 04 02 movzbl (%rdx,%rax,1),%eax 5.26 : 5ad0c1: 41 88 04 34 mov %al,(%r12,%rsi,1) 0.00 : 5ad0c5: 48 83 c6 01 add $0x1,%rsi : int i; : : if (projInfo->pi_directMap) : { : /* especially simple case where vars go to output in order */ : for (i = 0; i < numSimpleVars; i++) 0.00 : 5ad0c9: 41 39 f0 cmp %esi,%r8d 0.00 : 5ad0cc: 7f ca jg 5ad098 : * If there are any generic expressions, evaluate them. It's possible : * that there are set-returning functions in such expressions; if so and : * we have reached the end of the set, we return the result slot, which we : * already marked empty. : */ : if (projInfo->pi_targetlist) 0.00 : 5ad0ce: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 5ad0d2: 48 85 c0 test %rax,%rax 0.00 : 5ad0d5: 48 89 45 98 mov %rax,-0x68(%rbp) 0.00 : 5ad0d9: 0f 84 fc 00 00 00 je 5ad1db : { : if (!ExecTargetList(projInfo->pi_targetlist, 0.00 : 5ad0df: 48 8b 55 b0 mov -0x50(%rbp),%rdx 0.00 : 5ad0e3: 48 8b 45 b0 mov -0x50(%rbp),%rax 0.00 : 5ad0e7: 4c 8b 7b 20 mov 0x20(%rbx),%r15 0.00 : 5ad0eb: 48 8b 52 30 mov 0x30(%rdx),%rdx 0.00 : 5ad0ef: 48 89 55 a0 mov %rdx,-0x60(%rbp) : #endif /* !PG_USE_INLINE */ : #if defined(PG_USE_INLINE) || defined(MCXT_INCLUDE_DEFINITIONS) : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; 0.00 : 5ad0f3: 48 8b 15 66 d7 60 00 mov 0x60d766(%rip),%rdx # bba860 0.00 : 5ad0fa: 48 8b 40 28 mov 0x28(%rax),%rax 0.00 : 5ad0fe: 48 89 55 c8 mov %rdx,-0x38(%rbp) 0.00 : 5ad102: 48 89 45 a8 mov %rax,-0x58(%rbp) : : CurrentMemoryContext = context; 0.00 : 5ad106: 49 8b 46 28 mov 0x28(%r14),%rax 0.00 : 5ad10a: 48 89 05 4f d7 60 00 mov %rax,0x60d74f(%rip) # bba860 : #endif /* PG_USE_INLINE */ : #if defined(PG_USE_INLINE) || defined(PG_LIST_INCLUDE_DEFINITIONS) : STATIC_IF_INLINE ListCell * : list_head(const List *l) : { : return l ? l->head : NULL; 0.00 : 5ad111: 48 8b 45 98 mov -0x68(%rbp),%rax 0.00 : 5ad115: 4c 8b 68 08 mov 0x8(%rax),%r13 : /* : * evaluate all the expressions in the target list : */ : haveDoneSets = false; /* any exhausted set exprs in tlist? */ : : foreach(tl, targetlist) 0.00 : 5ad119: 4d 85 ed test %r13,%r13 0.00 : 5ad11c: 0f 84 ae 00 00 00 je 5ad1d0 0.00 : 5ad122: c6 45 c7 00 movb $0x0,-0x39(%rbp) 0.00 : 5ad126: eb 15 jmp 5ad13d 0.00 : 5ad128: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5ad12f: 00 : /* We have a set-valued expression in the tlist */ : if (isDone == NULL) : ereport(ERROR, : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED), : errmsg("set-valued function called in context that cannot accept a set"))); : if (itemIsDone[resind] == ExprMultipleResult) 0.00 : 5ad130: c6 45 c7 01 movb $0x1,-0x39(%rbp) : /* : * evaluate all the expressions in the target list : */ : haveDoneSets = false; /* any exhausted set exprs in tlist? */ : : foreach(tl, targetlist) 0.00 : 5ad134: 4d 8b 6d 08 mov 0x8(%r13),%r13 0.00 : 5ad138: 4d 85 ed test %r13,%r13 0.00 : 5ad13b: 74 63 je 5ad1a0 : { : GenericExprState *gstate = (GenericExprState *) lfirst(tl); 0.00 : 5ad13d: 49 8b 55 00 mov 0x0(%r13),%rdx : TargetEntry *tle = (TargetEntry *) gstate->xprstate.expr; : AttrNumber resind = tle->resno - 1; : : values[resind] = ExecEvalExpr(gstate->arg, 0.00 : 5ad141: 4c 89 f6 mov %r14,%rsi 0.00 : 5ad144: 48 8b 42 08 mov 0x8(%rdx),%rax 0.00 : 5ad148: 0f b7 58 10 movzwl 0x10(%rax),%ebx 0.00 : 5ad14c: 48 8b 42 18 mov 0x18(%rdx),%rax 0.00 : 5ad150: 48 8b 55 a0 mov -0x60(%rbp),%rdx 0.00 : 5ad154: 48 89 c7 mov %rax,%rdi 0.00 : 5ad157: 83 eb 01 sub $0x1,%ebx 0.00 : 5ad15a: 48 0f bf db movswq %bx,%rbx 0.00 : 5ad15e: 4d 8d 24 9f lea (%r15,%rbx,4),%r12 0.00 : 5ad162: 48 01 da add %rbx,%rdx 0.00 : 5ad165: 4c 89 e1 mov %r12,%rcx 0.00 : 5ad168: ff 50 10 callq *0x10(%rax) 0.00 : 5ad16b: 48 8b 55 a8 mov -0x58(%rbp),%rdx 0.00 : 5ad16f: 48 89 04 da mov %rax,(%rdx,%rbx,8) : econtext, : &isnull[resind], : &itemIsDone[resind]); : : if (itemIsDone[resind] != ExprSingleResult) 0.00 : 5ad173: 41 8b 04 24 mov (%r12),%eax 0.00 : 5ad177: 85 c0 test %eax,%eax 0.00 : 5ad179: 74 b9 je 5ad134 : { : /* We have a set-valued expression in the tlist */ : if (isDone == NULL) 0.00 : 5ad17b: 48 83 7d 90 00 cmpq $0x0,-0x70(%rbp) 0.00 : 5ad180: 0f 84 fd 01 00 00 je 5ad383 : ereport(ERROR, : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED), : errmsg("set-valued function called in context that cannot accept a set"))); : if (itemIsDone[resind] == ExprMultipleResult) 0.00 : 5ad186: 83 e8 01 sub $0x1,%eax 0.00 : 5ad189: 75 a5 jne 5ad130 : { : /* we have undone sets in the tlist, set flag */ : *isDone = ExprMultipleResult; 0.00 : 5ad18b: 48 8b 45 90 mov -0x70(%rbp),%rax 0.00 : 5ad18f: c7 00 01 00 00 00 movl $0x1,(%rax) : /* : * evaluate all the expressions in the target list : */ : haveDoneSets = false; /* any exhausted set exprs in tlist? */ : : foreach(tl, targetlist) 0.00 : 5ad195: 4d 8b 6d 08 mov 0x8(%r13),%r13 0.00 : 5ad199: 4d 85 ed test %r13,%r13 0.00 : 5ad19c: 75 9f jne 5ad13d 0.00 : 5ad19e: 66 90 xchg %ax,%ax : haveDoneSets = true; : } : } : } : : if (haveDoneSets) 0.00 : 5ad1a0: 80 7d c7 00 cmpb $0x0,-0x39(%rbp) 0.00 : 5ad1a4: 74 2a je 5ad1d0 : { : /* : * note: can't get here unless we verified isDone != NULL : */ : if (*isDone == ExprSingleResult) 0.00 : 5ad1a6: 48 8b 55 90 mov -0x70(%rbp),%rdx 0.00 : 5ad1aa: 8b 02 mov (%rdx),%eax 0.00 : 5ad1ac: 85 c0 test %eax,%eax 0.00 : 5ad1ae: 0f 84 bc 01 00 00 je 5ad370 0.00 : 5ad1b4: 48 8b 55 98 mov -0x68(%rbp),%rdx 0.00 : 5ad1b8: 4c 8b 6a 08 mov 0x8(%rdx),%r13 : { : /* : * We have some done and some undone sets. Restart the done ones : * so that we can deliver a tuple (if possible). : */ : foreach(tl, targetlist) 0.00 : 5ad1bc: 4d 85 ed test %r13,%r13 0.00 : 5ad1bf: 75 6f jne 5ad230 : * have to cycle the nonempty sets to completion, else resources : * will not be released from subplans etc. : * : * XXX is that still necessary? : */ : if (*isDone == ExprEndResult) 0.00 : 5ad1c1: 83 f8 02 cmp $0x2,%eax 0.00 : 5ad1c4: 0f 84 02 01 00 00 je 5ad2cc 0.00 : 5ad1ca: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5ad1d0: 48 8b 45 c8 mov -0x38(%rbp),%rax 0.00 : 5ad1d4: 48 89 05 85 d6 60 00 mov %rax,0x60d685(%rip) # bba860 : : /* : * Successfully formed a result row. Mark the result slot as containing a : * valid virtual tuple. : */ : return ExecStoreVirtualTuple(slot); 0.00 : 5ad1db: 48 8b 7d b0 mov -0x50(%rbp),%rdi : } 0.00 : 5ad1df: 48 83 c4 48 add $0x48,%rsp 0.00 : 5ad1e3: 5b pop %rbx 0.00 : 5ad1e4: 41 5c pop %r12 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5494 5.26 : 5ad1e6: 41 5d pop %r13 0.00 : 5ad1e8: 41 5e pop %r14 0.00 : 5ad1ea: 41 5f pop %r15 0.00 : 5ad1ec: c9 leaveq : : /* : * Successfully formed a result row. Mark the result slot as containing a : * valid virtual tuple. : */ : return ExecStoreVirtualTuple(slot); 0.00 : 5ad1ed: e9 2e 68 00 00 jmpq 5b3a20 0.00 : 5ad1f2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : TargetEntry *tle = (TargetEntry *) gstate->xprstate.expr; : AttrNumber resind = tle->resno - 1; : : if (itemIsDone[resind] == ExprEndResult) : { : values[resind] = ExecEvalExpr(gstate->arg, 0.00 : 5ad1f8: 48 8b 42 18 mov 0x18(%rdx),%rax 0.00 : 5ad1fc: 48 8b 55 a0 mov -0x60(%rbp),%rdx 0.00 : 5ad200: 4c 89 e1 mov %r12,%rcx 0.00 : 5ad203: 4c 89 f6 mov %r14,%rsi 0.00 : 5ad206: 48 01 da add %rbx,%rdx 0.00 : 5ad209: 48 89 c7 mov %rax,%rdi 0.00 : 5ad20c: ff 50 10 callq *0x10(%rax) 0.00 : 5ad20f: 48 8b 55 a8 mov -0x58(%rbp),%rdx 0.00 : 5ad213: 48 89 04 da mov %rax,(%rdx,%rbx,8) : econtext, : &isnull[resind], : &itemIsDone[resind]); : : if (itemIsDone[resind] == ExprEndResult) 0.00 : 5ad217: 41 83 3c 24 02 cmpl $0x2,(%r12) 0.00 : 5ad21c: 0f 84 a0 00 00 00 je 5ad2c2 : { : /* : * We have some done and some undone sets. Restart the done ones : * so that we can deliver a tuple (if possible). : */ : foreach(tl, targetlist) 0.00 : 5ad222: 4d 8b 6d 08 mov 0x8(%r13),%r13 0.00 : 5ad226: 4d 85 ed test %r13,%r13 0.00 : 5ad229: 74 2c je 5ad257 0.00 : 5ad22b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : { : GenericExprState *gstate = (GenericExprState *) lfirst(tl); 0.00 : 5ad230: 49 8b 55 00 mov 0x0(%r13),%rdx : TargetEntry *tle = (TargetEntry *) gstate->xprstate.expr; : AttrNumber resind = tle->resno - 1; : : if (itemIsDone[resind] == ExprEndResult) 0.00 : 5ad234: 48 8b 42 08 mov 0x8(%rdx),%rax 0.00 : 5ad238: 0f b7 40 10 movzwl 0x10(%rax),%eax 0.00 : 5ad23c: 83 e8 01 sub $0x1,%eax 0.00 : 5ad23f: 48 0f bf d8 movswq %ax,%rbx 0.00 : 5ad243: 4d 8d 24 9f lea (%r15,%rbx,4),%r12 0.00 : 5ad247: 41 83 3c 24 02 cmpl $0x2,(%r12) 0.00 : 5ad24c: 74 aa je 5ad1f8 : { : /* : * We have some done and some undone sets. Restart the done ones : * so that we can deliver a tuple (if possible). : */ : foreach(tl, targetlist) 0.00 : 5ad24e: 4d 8b 6d 08 mov 0x8(%r13),%r13 0.00 : 5ad252: 4d 85 ed test %r13,%r13 0.00 : 5ad255: 75 d9 jne 5ad230 0.00 : 5ad257: 48 8b 55 90 mov -0x70(%rbp),%rdx 0.00 : 5ad25b: 8b 02 mov (%rdx),%eax : * have to cycle the nonempty sets to completion, else resources : * will not be released from subplans etc. : * : * XXX is that still necessary? : */ : if (*isDone == ExprEndResult) 0.00 : 5ad25d: 83 f8 02 cmp $0x2,%eax 0.00 : 5ad260: 0f 85 6a ff ff ff jne 5ad1d0 0.00 : 5ad266: eb 64 jmp 5ad2cc 0.00 : 5ad268: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5ad26f: 00 : } : } : else : { : /* we have to pay attention to varOutputCols[] */ : int *varOutputCols = projInfo->pi_varOutputCols; 0.00 : 5ad270: 4c 8b 4b 40 mov 0x40(%rbx),%r9 0.00 : 5ad274: 31 ff xor %edi,%edi 0.00 : 5ad276: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 5ad27d: 00 00 00 : : for (i = 0; i < numSimpleVars; i++) : { : char *slotptr = ((char *) econtext) + varSlotOffsets[i]; : TupleTableSlot *varSlot = *((TupleTableSlot **) slotptr); 0.00 : 5ad280: 49 63 04 bb movslq (%r11,%rdi,4),%rax : int varNumber = varNumbers[i] - 1; : int varOutputCol = varOutputCols[i] - 1; : : values[varOutputCol] = varSlot->tts_values[varNumber]; 0.00 : 5ad284: 41 8b 0c b9 mov (%r9,%rdi,4),%ecx 0.00 : 5ad288: 83 e9 01 sub $0x1,%ecx : int *varOutputCols = projInfo->pi_varOutputCols; : : for (i = 0; i < numSimpleVars; i++) : { : char *slotptr = ((char *) econtext) + varSlotOffsets[i]; : TupleTableSlot *varSlot = *((TupleTableSlot **) slotptr); 0.00 : 5ad28b: 49 8b 34 06 mov (%r14,%rax,1),%rsi : int varNumber = varNumbers[i] - 1; : int varOutputCol = varOutputCols[i] - 1; : : values[varOutputCol] = varSlot->tts_values[varNumber]; 0.00 : 5ad28f: 41 8b 04 ba mov (%r10,%rdi,4),%eax 0.00 : 5ad293: 48 63 c9 movslq %ecx,%rcx : isnull[varOutputCol] = varSlot->tts_isnull[varNumber]; 0.00 : 5ad296: 48 83 c7 01 add $0x1,%rdi : char *slotptr = ((char *) econtext) + varSlotOffsets[i]; : TupleTableSlot *varSlot = *((TupleTableSlot **) slotptr); : int varNumber = varNumbers[i] - 1; : int varOutputCol = varOutputCols[i] - 1; : : values[varOutputCol] = varSlot->tts_values[varNumber]; 0.00 : 5ad29a: 48 8b 56 28 mov 0x28(%rsi),%rdx 0.00 : 5ad29e: 83 e8 01 sub $0x1,%eax : else : { : /* we have to pay attention to varOutputCols[] */ : int *varOutputCols = projInfo->pi_varOutputCols; : : for (i = 0; i < numSimpleVars; i++) 0.00 : 5ad2a1: 41 39 f8 cmp %edi,%r8d : char *slotptr = ((char *) econtext) + varSlotOffsets[i]; : TupleTableSlot *varSlot = *((TupleTableSlot **) slotptr); : int varNumber = varNumbers[i] - 1; : int varOutputCol = varOutputCols[i] - 1; : : values[varOutputCol] = varSlot->tts_values[varNumber]; 0.00 : 5ad2a4: 48 98 cltq 0.00 : 5ad2a6: 48 8b 14 c2 mov (%rdx,%rax,8),%rdx 0.00 : 5ad2aa: 49 89 54 cd 00 mov %rdx,0x0(%r13,%rcx,8) : isnull[varOutputCol] = varSlot->tts_isnull[varNumber]; 0.00 : 5ad2af: 48 8b 56 30 mov 0x30(%rsi),%rdx 0.00 : 5ad2b3: 0f b6 04 02 movzbl (%rdx,%rax,1),%eax 0.00 : 5ad2b7: 41 88 04 0c mov %al,(%r12,%rcx,1) : else : { : /* we have to pay attention to varOutputCols[] */ : int *varOutputCols = projInfo->pi_varOutputCols; : : for (i = 0; i < numSimpleVars; i++) 0.00 : 5ad2bb: 7f c3 jg 5ad280 0.00 : 5ad2bd: e9 0c fe ff ff jmpq 5ad0ce : { : /* : * Oh dear, this item is returning an empty set. Guess : * we can't make a tuple after all. : */ : *isDone = ExprEndResult; 0.00 : 5ad2c2: 48 8b 45 90 mov -0x70(%rbp),%rax 0.00 : 5ad2c6: c7 00 02 00 00 00 movl $0x2,(%rax) 0.00 : 5ad2cc: 48 8b 45 98 mov -0x68(%rbp),%rax 0.00 : 5ad2d0: 48 8b 40 08 mov 0x8(%rax),%rax : * : * XXX is that still necessary? : */ : if (*isDone == ExprEndResult) : { : foreach(tl, targetlist) 0.00 : 5ad2d4: 48 85 c0 test %rax,%rax 0.00 : 5ad2d7: 48 89 45 d0 mov %rax,-0x30(%rbp) 0.00 : 5ad2db: 74 6c je 5ad349 0.00 : 5ad2dd: 0f 1f 00 nopl (%rax) : { : GenericExprState *gstate = (GenericExprState *) lfirst(tl); 0.00 : 5ad2e0: 48 8b 55 d0 mov -0x30(%rbp),%rdx 0.00 : 5ad2e4: 48 8b 12 mov (%rdx),%rdx 0.00 : 5ad2e7: 48 89 55 b8 mov %rdx,-0x48(%rbp) : TargetEntry *tle = (TargetEntry *) gstate->xprstate.expr; : AttrNumber resind = tle->resno - 1; : : while (itemIsDone[resind] == ExprMultipleResult) 0.00 : 5ad2eb: 48 8b 42 08 mov 0x8(%rdx),%rax 0.00 : 5ad2ef: 0f b7 40 10 movzwl 0x10(%rax),%eax 0.00 : 5ad2f3: 83 e8 01 sub $0x1,%eax 0.00 : 5ad2f6: 48 0f bf c0 movswq %ax,%rax 0.00 : 5ad2fa: 49 8d 1c 87 lea (%r15,%rax,4),%rbx 0.00 : 5ad2fe: 83 3b 01 cmpl $0x1,(%rbx) 0.00 : 5ad301: 75 35 jne 5ad338 0.00 : 5ad303: 48 8b 55 a8 mov -0x58(%rbp),%rdx 0.00 : 5ad307: 4c 8b 65 a0 mov -0x60(%rbp),%r12 0.00 : 5ad30b: 4c 8d 2c c2 lea (%rdx,%rax,8),%r13 0.00 : 5ad30f: 49 01 c4 add %rax,%r12 0.00 : 5ad312: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : { : values[resind] = ExecEvalExpr(gstate->arg, 0.00 : 5ad318: 48 8b 55 b8 mov -0x48(%rbp),%rdx 0.00 : 5ad31c: 48 89 d9 mov %rbx,%rcx 0.00 : 5ad31f: 4c 89 f6 mov %r14,%rsi 0.00 : 5ad322: 48 8b 42 18 mov 0x18(%rdx),%rax 0.00 : 5ad326: 4c 89 e2 mov %r12,%rdx 0.00 : 5ad329: 48 89 c7 mov %rax,%rdi 0.00 : 5ad32c: ff 50 10 callq *0x10(%rax) 0.00 : 5ad32f: 49 89 45 00 mov %rax,0x0(%r13) : { : GenericExprState *gstate = (GenericExprState *) lfirst(tl); : TargetEntry *tle = (TargetEntry *) gstate->xprstate.expr; : AttrNumber resind = tle->resno - 1; : : while (itemIsDone[resind] == ExprMultipleResult) 0.00 : 5ad333: 83 3b 01 cmpl $0x1,(%rbx) 0.00 : 5ad336: 74 e0 je 5ad318 : * : * XXX is that still necessary? : */ : if (*isDone == ExprEndResult) : { : foreach(tl, targetlist) 0.00 : 5ad338: 48 8b 45 d0 mov -0x30(%rbp),%rax 0.00 : 5ad33c: 48 8b 40 08 mov 0x8(%rax),%rax 0.00 : 5ad340: 48 85 c0 test %rax,%rax 0.00 : 5ad343: 48 89 45 d0 mov %rax,-0x30(%rbp) 0.00 : 5ad347: 75 97 jne 5ad2e0 0.00 : 5ad349: 48 8b 55 c8 mov -0x38(%rbp),%rdx 0.00 : 5ad34d: 48 89 15 0c d5 60 00 mov %rdx,0x60d50c(%rip) # bba860 : /* : * Successfully formed a result row. Mark the result slot as containing a : * valid virtual tuple. : */ : return ExecStoreVirtualTuple(slot); : } 0.00 : 5ad354: 48 8b 45 b0 mov -0x50(%rbp),%rax 0.00 : 5ad358: 48 83 c4 48 add $0x48,%rsp 0.00 : 5ad35c: 5b pop %rbx 0.00 : 5ad35d: 41 5c pop %r12 0.00 : 5ad35f: 41 5d pop %r13 0.00 : 5ad361: 41 5e pop %r14 0.00 : 5ad363: 41 5f pop %r15 0.00 : 5ad365: c9 leaveq 0.00 : 5ad366: c3 retq 0.00 : 5ad367: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5ad36e: 00 00 : if (*isDone == ExprSingleResult) : { : /* : * all sets are done, so report that tlist expansion is complete. : */ : *isDone = ExprEndResult; 0.00 : 5ad370: c7 02 02 00 00 00 movl $0x2,(%rdx) 0.00 : 5ad376: 48 8b 45 c8 mov -0x38(%rbp),%rax 0.00 : 5ad37a: 48 89 05 df d4 60 00 mov %rax,0x60d4df(%rip) # bba860 0.00 : 5ad381: eb d1 jmp 5ad354 : : if (itemIsDone[resind] != ExprSingleResult) : { : /* We have a set-valued expression in the tlist */ : if (isDone == NULL) : ereport(ERROR, 0.00 : 5ad383: 45 31 c0 xor %r8d,%r8d 0.00 : 5ad386: b9 f0 ad 88 00 mov $0x88adf0,%ecx 0.00 : 5ad38b: ba 9c 14 00 00 mov $0x149c,%edx 0.00 : 5ad390: be fc a3 88 00 mov $0x88a3fc,%esi 0.00 : 5ad395: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5ad39a: e8 21 d7 1c 00 callq 77aac0 0.00 : 5ad39f: 84 c0 test %al,%al 0.00 : 5ad3a1: 75 05 jne 5ad3a8 0.00 : 5ad3a3: e8 28 c1 eb ff callq 4694d0 0.00 : 5ad3a8: bf 30 b3 87 00 mov $0x87b330,%edi 0.00 : 5ad3ad: 31 c0 xor %eax,%eax 0.00 : 5ad3af: e8 ec f4 1c 00 callq 77c8a0 0.00 : 5ad3b4: bf 40 04 00 00 mov $0x440,%edi 0.00 : 5ad3b9: 89 c3 mov %eax,%ebx 0.00 : 5ad3bb: e8 90 f9 1c 00 callq 77cd50 0.00 : 5ad3c0: 89 de mov %ebx,%esi 0.00 : 5ad3c2: 89 c7 mov %eax,%edi 0.00 : 5ad3c4: 31 c0 xor %eax,%eax 0.00 : 5ad3c6: e8 15 d2 1c 00 callq 77a5e0 0.00 : 5ad3cb: eb d6 jmp 5ad3a3 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 10.53 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 10.53 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:89 10.53 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:146 10.53 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:79 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:99 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:136 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:139 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:142 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:146 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:146 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:146 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b7bd0 : : } : : /* Exit from a plan node */ : void : InstrStopNode(Instrumentation *instr, double nTuples) : { 0.00 : 5b7bd0: 55 push %rbp 0.00 : 5b7bd1: 48 89 e5 mov %rsp,%rbp 0.00 : 5b7bd4: 53 push %rbx 0.00 : 5b7bd5: 48 89 fb mov %rdi,%rbx 0.00 : 5b7bd8: 48 83 ec 18 sub $0x18,%rsp : : /* count the returned tuples */ : instr->tuplecount += nTuples; : : /* let's update the time only if the timer was requested */ : if (instr->need_timer) 0.00 : 5b7bdc: 80 3f 00 cmpb $0x0,(%rdi) : InstrStopNode(Instrumentation *instr, double nTuples) : { : instr_time endtime; : : /* count the returned tuples */ : instr->tuplecount += nTuples; 0.00 : 5b7bdf: f2 0f 58 47 30 addsd 0x30(%rdi),%xmm0 0.00 : 5b7be4: f2 0f 11 47 30 movsd %xmm0,0x30(%rdi) : : /* let's update the time only if the timer was requested */ : if (instr->need_timer) 0.00 : 5b7be9: 0f 84 90 00 00 00 je 5b7c7f : { : if (INSTR_TIME_IS_ZERO(instr->starttime)) 0.00 : 5b7bef: 48 83 7f 10 00 cmpq $0x0,0x10(%rdi) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:79 5.26 : 5b7bf4: 75 0b jne 5b7c01 0.00 : 5b7bf6: 48 83 7f 08 00 cmpq $0x0,0x8(%rdi) 0.00 : 5b7bfb: 0f 84 d1 02 00 00 je 5b7ed2 : elog(ERROR, "InstrStopNode called without start"); : : INSTR_TIME_SET_CURRENT(endtime); 0.00 : 5b7c01: 48 8d 7d e0 lea -0x20(%rbp),%rdi 0.00 : 5b7c05: 31 f6 xor %esi,%esi 0.00 : 5b7c07: e8 b4 19 eb ff callq 4695c0 : INSTR_TIME_ACCUM_DIFF(instr->counter, endtime, instr->starttime); 0.00 : 5b7c0c: 48 8b 45 e0 mov -0x20(%rbp),%rax 0.00 : 5b7c10: 48 03 43 18 add 0x18(%rbx),%rax 0.00 : 5b7c14: 48 2b 43 08 sub 0x8(%rbx),%rax 0.00 : 5b7c18: 48 89 43 18 mov %rax,0x18(%rbx) 0.00 : 5b7c1c: 48 8b 45 e8 mov -0x18(%rbp),%rax 0.00 : 5b7c20: 48 03 43 20 add 0x20(%rbx),%rax 0.00 : 5b7c24: 48 2b 43 10 sub 0x10(%rbx),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 10.53 : 5b7c28: 48 85 c0 test %rax,%rax 0.00 : 5b7c2b: 48 89 43 20 mov %rax,0x20(%rbx) 0.00 : 5b7c2f: 79 36 jns 5b7c67 0.00 : 5b7c31: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 5b7c38: 48 05 40 42 0f 00 add $0xf4240,%rax 0.00 : 5b7c3e: 48 83 6b 18 01 subq $0x1,0x18(%rbx) 0.00 : 5b7c43: 48 85 c0 test %rax,%rax 0.00 : 5b7c46: 48 89 43 20 mov %rax,0x20(%rbx) 0.00 : 5b7c4a: 78 ec js 5b7c38 0.00 : 5b7c4c: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 5b7c52: 7e 1b jle 5b7c6f 0.00 : 5b7c54: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 5b7c58: 48 83 43 18 01 addq $0x1,0x18(%rbx) 0.00 : 5b7c5d: 48 2d 40 42 0f 00 sub $0xf4240,%rax 0.00 : 5b7c63: 48 89 43 20 mov %rax,0x20(%rbx) 5.26 : 5b7c67: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 5b7c6d: 7f e9 jg 5b7c58 : : INSTR_TIME_SET_ZERO(instr->starttime); 0.00 : 5b7c6f: 48 c7 43 08 00 00 00 movq $0x0,0x8(%rbx) 0.00 : 5b7c76: 00 0.00 : 5b7c77: 48 c7 43 10 00 00 00 movq $0x0,0x10(%rbx) 0.00 : 5b7c7e: 00 : } : : /* Add delta of buffer usage since entry to node's totals */ : if (instr->need_bufusage) 0.00 : 5b7c7f: 80 7b 01 00 cmpb $0x0,0x1(%rbx) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:89 10.53 : 5b7c83: 75 33 jne 5b7cb8 : BufferUsageAccumDiff(&instr->bufusage, : &pgBufferUsage, &instr->bufusage_start); : : /* Is this the first tuple of this cycle? */ : if (!instr->running) 0.00 : 5b7c85: 80 7b 02 00 cmpb $0x0,0x2(%rbx) 0.00 : 5b7c89: 75 21 jne 5b7cac : { : instr->running = true; : instr->firsttuple = INSTR_TIME_GET_DOUBLE(instr->counter); 0.00 : 5b7c8b: f2 48 0f 2a 43 20 cvtsi2sdq 0x20(%rbx),%xmm0 0.00 : 5b7c91: f2 0f 5e 05 47 49 2c divsd 0x2c4947(%rip),%xmm0 # 87c5e0 <__func__.18742+0x1b> 0.00 : 5b7c98: 00 0.00 : 5b7c99: f2 48 0f 2a 4b 18 cvtsi2sdq 0x18(%rbx),%xmm1 : &pgBufferUsage, &instr->bufusage_start); : : /* Is this the first tuple of this cycle? */ : if (!instr->running) : { : instr->running = true; 0.00 : 5b7c9f: c6 43 02 01 movb $0x1,0x2(%rbx) : instr->firsttuple = INSTR_TIME_GET_DOUBLE(instr->counter); 0.00 : 5b7ca3: f2 0f 58 c8 addsd %xmm0,%xmm1 0.00 : 5b7ca7: f2 0f 11 4b 28 movsd %xmm1,0x28(%rbx) : } : } /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:99 5.26 : 5b7cac: 48 83 c4 18 add $0x18,%rsp 0.00 : 5b7cb0: 5b pop %rbx 0.00 : 5b7cb1: c9 leaveq 0.00 : 5b7cb2: c3 retq 0.00 : 5b7cb3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : static void : BufferUsageAccumDiff(BufferUsage *dst, : const BufferUsage *add, : const BufferUsage *sub) : { : dst->shared_blks_hit += add->shared_blks_hit - sub->shared_blks_hit; 0.00 : 5b7cb8: 48 8b 05 a1 7a 60 00 mov 0x607aa1(%rip),%rax # bbf760 0.00 : 5b7cbf: 48 03 83 d8 00 00 00 add 0xd8(%rbx),%rax 0.00 : 5b7cc6: 48 2b 43 38 sub 0x38(%rbx),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:136 5.26 : 5b7cca: 48 89 83 d8 00 00 00 mov %rax,0xd8(%rbx) : dst->shared_blks_read += add->shared_blks_read - sub->shared_blks_read; 0.00 : 5b7cd1: 48 8b 05 90 7a 60 00 mov 0x607a90(%rip),%rax # bbf768 0.00 : 5b7cd8: 48 03 83 e0 00 00 00 add 0xe0(%rbx),%rax 0.00 : 5b7cdf: 48 2b 43 40 sub 0x40(%rbx),%rax 0.00 : 5b7ce3: 48 89 83 e0 00 00 00 mov %rax,0xe0(%rbx) : dst->shared_blks_dirtied += add->shared_blks_dirtied - sub->shared_blks_dirtied; 0.00 : 5b7cea: 48 8b 05 7f 7a 60 00 mov 0x607a7f(%rip),%rax # bbf770 0.00 : 5b7cf1: 48 03 83 e8 00 00 00 add 0xe8(%rbx),%rax 0.00 : 5b7cf8: 48 2b 43 48 sub 0x48(%rbx),%rax 0.00 : 5b7cfc: 48 89 83 e8 00 00 00 mov %rax,0xe8(%rbx) : dst->shared_blks_written += add->shared_blks_written - sub->shared_blks_written; /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:139 5.26 : 5b7d03: 48 8b 05 6e 7a 60 00 mov 0x607a6e(%rip),%rax # bbf778 0.00 : 5b7d0a: 48 03 83 f0 00 00 00 add 0xf0(%rbx),%rax 0.00 : 5b7d11: 48 2b 43 50 sub 0x50(%rbx),%rax 0.00 : 5b7d15: 48 89 83 f0 00 00 00 mov %rax,0xf0(%rbx) : dst->local_blks_hit += add->local_blks_hit - sub->local_blks_hit; 0.00 : 5b7d1c: 48 8b 05 5d 7a 60 00 mov 0x607a5d(%rip),%rax # bbf780 0.00 : 5b7d23: 48 03 83 f8 00 00 00 add 0xf8(%rbx),%rax 0.00 : 5b7d2a: 48 2b 43 58 sub 0x58(%rbx),%rax 0.00 : 5b7d2e: 48 89 83 f8 00 00 00 mov %rax,0xf8(%rbx) : dst->local_blks_read += add->local_blks_read - sub->local_blks_read; 0.00 : 5b7d35: 48 8b 05 4c 7a 60 00 mov 0x607a4c(%rip),%rax # bbf788 0.00 : 5b7d3c: 48 03 83 00 01 00 00 add 0x100(%rbx),%rax 0.00 : 5b7d43: 48 2b 43 60 sub 0x60(%rbx),%rax 0.00 : 5b7d47: 48 89 83 00 01 00 00 mov %rax,0x100(%rbx) : dst->local_blks_dirtied += add->local_blks_dirtied - sub->local_blks_dirtied; /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:142 5.26 : 5b7d4e: 48 8b 05 3b 7a 60 00 mov 0x607a3b(%rip),%rax # bbf790 0.00 : 5b7d55: 48 03 83 08 01 00 00 add 0x108(%rbx),%rax 0.00 : 5b7d5c: 48 2b 43 68 sub 0x68(%rbx),%rax 0.00 : 5b7d60: 48 89 83 08 01 00 00 mov %rax,0x108(%rbx) : dst->local_blks_written += add->local_blks_written - sub->local_blks_written; 0.00 : 5b7d67: 48 8b 05 2a 7a 60 00 mov 0x607a2a(%rip),%rax # bbf798 0.00 : 5b7d6e: 48 03 83 10 01 00 00 add 0x110(%rbx),%rax 0.00 : 5b7d75: 48 2b 43 70 sub 0x70(%rbx),%rax 0.00 : 5b7d79: 48 89 83 10 01 00 00 mov %rax,0x110(%rbx) : dst->temp_blks_read += add->temp_blks_read - sub->temp_blks_read; 0.00 : 5b7d80: 48 8b 05 19 7a 60 00 mov 0x607a19(%rip),%rax # bbf7a0 0.00 : 5b7d87: 48 03 83 18 01 00 00 add 0x118(%rbx),%rax 0.00 : 5b7d8e: 48 2b 43 78 sub 0x78(%rbx),%rax 0.00 : 5b7d92: 48 89 83 18 01 00 00 mov %rax,0x118(%rbx) : dst->temp_blks_written += add->temp_blks_written - sub->temp_blks_written; 0.00 : 5b7d99: 48 8b 05 08 7a 60 00 mov 0x607a08(%rip),%rax # bbf7a8 0.00 : 5b7da0: 48 03 83 20 01 00 00 add 0x120(%rbx),%rax 0.00 : 5b7da7: 48 2b 83 80 00 00 00 sub 0x80(%rbx),%rax 0.00 : 5b7dae: 48 89 83 20 01 00 00 mov %rax,0x120(%rbx) : INSTR_TIME_ACCUM_DIFF(dst->blk_read_time, /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:146 10.53 : 5b7db5: 48 8b 05 f4 79 60 00 mov 0x6079f4(%rip),%rax # bbf7b0 0.00 : 5b7dbc: 48 03 83 28 01 00 00 add 0x128(%rbx),%rax 5.26 : 5b7dc3: 48 2b 83 88 00 00 00 sub 0x88(%rbx),%rax 5.26 : 5b7dca: 48 89 83 28 01 00 00 mov %rax,0x128(%rbx) 0.00 : 5b7dd1: 48 8b 05 e0 79 60 00 mov 0x6079e0(%rip),%rax # bbf7b8 0.00 : 5b7dd8: 48 03 83 30 01 00 00 add 0x130(%rbx),%rax 0.00 : 5b7ddf: 48 2b 83 90 00 00 00 sub 0x90(%rbx),%rax 0.00 : 5b7de6: 48 85 c0 test %rax,%rax 5.26 : 5b7de9: 48 89 83 30 01 00 00 mov %rax,0x130(%rbx) 0.00 : 5b7df0: 79 43 jns 5b7e35 0.00 : 5b7df2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5b7df8: 48 05 40 42 0f 00 add $0xf4240,%rax 0.00 : 5b7dfe: 48 83 ab 28 01 00 00 subq $0x1,0x128(%rbx) 0.00 : 5b7e05: 01 0.00 : 5b7e06: 48 85 c0 test %rax,%rax 0.00 : 5b7e09: 48 89 83 30 01 00 00 mov %rax,0x130(%rbx) 0.00 : 5b7e10: 78 e6 js 5b7df8 0.00 : 5b7e12: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 5b7e18: 7e 23 jle 5b7e3d 0.00 : 5b7e1a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5b7e20: 48 83 83 28 01 00 00 addq $0x1,0x128(%rbx) 0.00 : 5b7e27: 01 0.00 : 5b7e28: 48 2d 40 42 0f 00 sub $0xf4240,%rax 0.00 : 5b7e2e: 48 89 83 30 01 00 00 mov %rax,0x130(%rbx) 0.00 : 5b7e35: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 5b7e3b: 7f e3 jg 5b7e20 : add->blk_read_time, sub->blk_read_time); : INSTR_TIME_ACCUM_DIFF(dst->blk_write_time, 0.00 : 5b7e3d: 48 8b 05 7c 79 60 00 mov 0x60797c(%rip),%rax # bbf7c0 0.00 : 5b7e44: 48 03 83 38 01 00 00 add 0x138(%rbx),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 5.26 : 5b7e4b: 48 2b 83 98 00 00 00 sub 0x98(%rbx),%rax 0.00 : 5b7e52: 48 89 83 38 01 00 00 mov %rax,0x138(%rbx) 0.00 : 5b7e59: 48 8b 05 68 79 60 00 mov 0x607968(%rip),%rax # bbf7c8 0.00 : 5b7e60: 48 03 83 40 01 00 00 add 0x140(%rbx),%rax 0.00 : 5b7e67: 48 2b 83 a0 00 00 00 sub 0xa0(%rbx),%rax 0.00 : 5b7e6e: 48 85 c0 test %rax,%rax 5.26 : 5b7e71: 48 89 83 40 01 00 00 mov %rax,0x140(%rbx) 0.00 : 5b7e78: 79 4b jns 5b7ec5 0.00 : 5b7e7a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5b7e80: 48 05 40 42 0f 00 add $0xf4240,%rax 0.00 : 5b7e86: 48 83 ab 38 01 00 00 subq $0x1,0x138(%rbx) 0.00 : 5b7e8d: 01 0.00 : 5b7e8e: 48 85 c0 test %rax,%rax 0.00 : 5b7e91: 48 89 83 40 01 00 00 mov %rax,0x140(%rbx) 0.00 : 5b7e98: 78 e6 js 5b7e80 0.00 : 5b7e9a: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 5b7ea0: 0f 8e df fd ff ff jle 5b7c85 0.00 : 5b7ea6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 5b7ead: 00 00 00 0.00 : 5b7eb0: 48 83 83 38 01 00 00 addq $0x1,0x138(%rbx) 0.00 : 5b7eb7: 01 0.00 : 5b7eb8: 48 2d 40 42 0f 00 sub $0xf4240,%rax 0.00 : 5b7ebe: 48 89 83 40 01 00 00 mov %rax,0x140(%rbx) 0.00 : 5b7ec5: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 5b7ecb: 7f e3 jg 5b7eb0 10.53 : 5b7ecd: e9 b3 fd ff ff jmpq 5b7c85 : : /* let's update the time only if the timer was requested */ : if (instr->need_timer) : { : if (INSTR_TIME_IS_ZERO(instr->starttime)) : elog(ERROR, "InstrStopNode called without start"); 0.00 : 5b7ed2: ba 8a b6 88 00 mov $0x88b68a,%edx 0.00 : 5b7ed7: be 50 00 00 00 mov $0x50,%esi 0.00 : 5b7edc: bf fa b5 88 00 mov $0x88b5fa,%edi 0.00 : 5b7ee1: e8 3a 35 1c 00 callq 77b420 0.00 : 5b7ee6: be 30 b6 88 00 mov $0x88b630,%esi 0.00 : 5b7eeb: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5b7ef0: 31 c0 xor %eax,%eax 0.00 : 5b7ef2: e8 39 33 1c 00 callq 77b230 0.00 : 5b7ef7: e8 d4 15 eb ff callq 4694d0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 11.76 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:870 11.76 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:770 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:731 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:730 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:730 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:730 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:730 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:730 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:730 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:732 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:745 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:864 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:872 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:774 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:965 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000004960f0 : : static void : heapgettup_pagemode(HeapScanDesc scan, : ScanDirection dir, : int nkeys, : ScanKey key) : { 0.00 : 4960f0: 55 push %rbp : HeapTuple tuple = &(scan->rs_ctup); /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:731 5.88 : 4960f1: 48 8d 47 48 lea 0x48(%rdi),%rax : static void : heapgettup_pagemode(HeapScanDesc scan, : ScanDirection dir, : int nkeys, : ScanKey key) : { /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:730 5.88 : 4960f5: 48 89 e5 mov %rsp,%rbp 5.88 : 4960f8: 41 57 push %r15 0.00 : 4960fa: 41 56 push %r14 5.88 : 4960fc: 41 55 push %r13 0.00 : 4960fe: 49 89 fd mov %rdi,%r13 0.00 : 496101: 41 54 push %r12 5.88 : 496103: 53 push %rbx 5.88 : 496104: 48 83 ec 48 sub $0x48,%rsp : HeapTuple tuple = &(scan->rs_ctup); : bool backward = ScanDirectionIsBackward(dir); 0.00 : 496108: 83 fe ff cmp $0xffffffff,%esi : static void : heapgettup_pagemode(HeapScanDesc scan, : ScanDirection dir, : int nkeys, : ScanKey key) : { 5.88 : 49610b: 89 55 ac mov %edx,-0x54(%rbp) : HeapTuple tuple = &(scan->rs_ctup); : bool backward = ScanDirectionIsBackward(dir); /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:732 5.88 : 49610e: 0f 94 45 bf sete -0x41(%rbp) : ItemId lpp; : : /* : * calculate next starting lineindex, given scan direction : */ : if (ScanDirectionIsForward(dir)) 0.00 : 496112: 83 ee 01 sub $0x1,%esi : static void : heapgettup_pagemode(HeapScanDesc scan, : ScanDirection dir, : int nkeys, : ScanKey key) : { 0.00 : 496115: 48 89 4d a0 mov %rcx,-0x60(%rbp) : HeapTuple tuple = &(scan->rs_ctup); 0.00 : 496119: 48 89 45 b0 mov %rax,-0x50(%rbp) : ItemId lpp; : : /* : * calculate next starting lineindex, given scan direction : */ : if (ScanDirectionIsForward(dir)) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:745 5.88 : 49611d: 0f 84 fd 02 00 00 je 496420 : lines = scan->rs_ntuples; : /* page and lineindex now reference the next visible tid */ : : linesleft = lines - lineindex; : } : else if (backward) 0.00 : 496123: 80 7d bf 00 cmpb $0x0,-0x41(%rbp) 0.00 : 496127: 0f 84 67 02 00 00 je 496394 : { : if (!scan->rs_inited) 0.00 : 49612d: 80 7f 41 00 cmpb $0x0,0x41(%rdi) 0.00 : 496131: 0f 84 2a 03 00 00 je 496461 : heapgetpage(scan, page); : } : else : { : /* continue from previously returned page/tuple */ : page = scan->rs_cblock; /* current page */ 0.00 : 496137: 44 8b 7f 60 mov 0x60(%rdi),%r15d : } : : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 49613b: 41 8b 45 64 mov 0x64(%r13),%eax 0.00 : 49613f: 85 c0 test %eax,%eax 0.00 : 496141: 0f 88 24 05 00 00 js 49666b 0.00 : 496147: 83 e8 01 sub $0x1,%eax 0.00 : 49614a: 4c 63 f0 movslq %eax,%r14 0.00 : 49614d: 49 c1 e6 0d shl $0xd,%r14 0.00 : 496151: 4c 03 35 a0 99 72 00 add 0x7299a0(%rip),%r14 # bbfaf8 : lines = scan->rs_ntuples; : : if (!scan->rs_inited) 0.00 : 496158: 41 80 7d 41 00 cmpb $0x0,0x41(%r13) : /* continue from previously returned page/tuple */ : page = scan->rs_cblock; /* current page */ : } : : dp = (Page) BufferGetPage(scan->rs_cbuf); : lines = scan->rs_ntuples; 0.00 : 49615d: 41 8b 45 78 mov 0x78(%r13),%eax : : if (!scan->rs_inited) 0.00 : 496161: 0f 85 c6 04 00 00 jne 49662d : { : lineindex = lines - 1; 0.00 : 496167: 83 e8 01 sub $0x1,%eax 0.00 : 49616a: 89 45 c0 mov %eax,-0x40(%rbp) : scan->rs_inited = true; 0.00 : 49616d: 41 c6 45 41 01 movb $0x1,0x41(%r13) : { : lineindex = scan->rs_cindex - 1; : } : /* page and lineindex now reference the previous visible tid */ : : linesleft = lineindex + 1; 0.00 : 496172: 8b 55 c0 mov -0x40(%rbp),%edx 0.00 : 496175: 83 c2 01 add $0x1,%edx 0.00 : 496178: 89 55 c4 mov %edx,-0x3c(%rbp) : */ : if (key != NULL) : { : bool valid; : : HeapKeyTest(tuple, RelationGetDescr(scan->rs_rd), 0.00 : 49617b: 8b 55 ac mov -0x54(%rbp),%edx 0.00 : 49617e: 83 ea 01 sub $0x1,%edx 0.00 : 496181: 89 55 9c mov %edx,-0x64(%rbp) 0.00 : 496184: 0f 1f 40 00 nopl 0x0(%rax) : * advance the scan until we find a qualifying tuple or run out of stuff : * to scan : */ : for (;;) : { : while (linesleft > 0) 0.00 : 496188: 44 8b 45 c4 mov -0x3c(%rbp),%r8d /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:864 5.88 : 49618c: 45 85 c0 test %r8d,%r8d 0.00 : 49618f: 0f 8e 6b 01 00 00 jle 496300 : { : lineoff = scan->rs_vistuples[lineindex]; 0.00 : 496195: 48 63 45 c0 movslq -0x40(%rbp),%rax 0.00 : 496199: 41 0f b7 4c 45 7c movzwl 0x7c(%r13,%rax,2),%ecx : lpp = PageGetItemId(dp, lineoff); 0.00 : 49619f: 0f b7 d1 movzwl %cx,%edx : Assert(ItemIdIsNormal(lpp)); : : tuple->t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); 0.00 : 4961a2: 48 83 c2 03 add $0x3,%rdx 0.00 : 4961a6: 41 0f b7 44 96 08 movzwl 0x8(%r14,%rdx,4),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:870 11.76 : 4961ac: 25 ff 7f 00 00 and $0x7fff,%eax 0.00 : 4961b1: 49 8d 04 06 lea (%r14,%rax,1),%rax 0.00 : 4961b5: 49 89 45 58 mov %rax,0x58(%r13) : tuple->t_len = ItemIdGetLength(lpp); 0.00 : 4961b9: 41 0f b7 44 96 0a movzwl 0xa(%r14,%rdx,4),%eax : ItemPointerSet(&(tuple->t_self), page, lineoff); 0.00 : 4961bf: 66 45 89 7d 4e mov %r15w,0x4e(%r13) 0.00 : 4961c4: 66 41 89 4d 50 mov %cx,0x50(%r13) : lineoff = scan->rs_vistuples[lineindex]; : lpp = PageGetItemId(dp, lineoff); : Assert(ItemIdIsNormal(lpp)); : : tuple->t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); : tuple->t_len = ItemIdGetLength(lpp); 0.00 : 4961c9: 66 d1 e8 shr %ax 0.00 : 4961cc: 0f b7 c0 movzwl %ax,%eax 0.00 : 4961cf: 41 89 45 48 mov %eax,0x48(%r13) : ItemPointerSet(&(tuple->t_self), page, lineoff); 0.00 : 4961d3: 44 89 f8 mov %r15d,%eax 0.00 : 4961d6: c1 e8 10 shr $0x10,%eax /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:872 5.88 : 4961d9: 66 41 89 45 4c mov %ax,0x4c(%r13) : : /* : * if current tuple qualifies, return it. : */ : if (key != NULL) 0.00 : 4961de: 48 83 7d a0 00 cmpq $0x0,-0x60(%rbp) 0.00 : 4961e3: 0f 84 87 03 00 00 je 496570 : { : bool valid; : : HeapKeyTest(tuple, RelationGetDescr(scan->rs_rd), 0.00 : 4961e9: 44 8b 4d ac mov -0x54(%rbp),%r9d 0.00 : 4961ed: 45 85 c9 test %r9d,%r9d 0.00 : 4961f0: 0f 84 7a 03 00 00 je 496570 0.00 : 4961f6: 48 8b 5d a0 mov -0x60(%rbp),%rbx 0.00 : 4961fa: 44 8b 65 9c mov -0x64(%rbp),%r12d 0.00 : 4961fe: f6 03 01 testb $0x1,(%rbx) 0.00 : 496201: 0f 84 a3 00 00 00 je 4962aa 0.00 : 496207: e9 c7 00 00 00 jmpq 4962d3 0.00 : 49620c: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 496210: c6 45 d7 00 movb $0x0,-0x29(%rbp) 0.00 : 496214: f6 47 14 01 testb $0x1,0x14(%rdi) 0.00 : 496218: 0f 85 9a 02 00 00 jne 4964b8 0.00 : 49621e: 49 8b 45 00 mov 0x0(%r13),%rax 0.00 : 496222: 48 0f bf d1 movswq %cx,%rdx 0.00 : 496226: 4c 8b 40 38 mov 0x38(%rax),%r8 0.00 : 49622a: 49 8b 40 08 mov 0x8(%r8),%rax 0.00 : 49622e: 48 8b 54 d0 f8 mov -0x8(%rax,%rdx,8),%rdx 0.00 : 496233: 8b 42 54 mov 0x54(%rdx),%eax 0.00 : 496236: 85 c0 test %eax,%eax 0.00 : 496238: 0f 88 02 03 00 00 js 496540 0.00 : 49623e: 80 7a 5c 00 cmpb $0x0,0x5c(%rdx) 0.00 : 496242: 0f 84 d8 02 00 00 je 496520 0.00 : 496248: 0f b7 52 4c movzwl 0x4c(%rdx),%edx 0.00 : 49624c: 66 83 fa 08 cmp $0x8,%dx 0.00 : 496250: 0f 84 02 03 00 00 je 496558 0.00 : 496256: 66 83 fa 04 cmp $0x4,%dx 0.00 : 49625a: 0f 84 88 03 00 00 je 4965e8 0.00 : 496260: 66 83 fa 02 cmp $0x2,%dx 0.00 : 496264: 0f 84 96 03 00 00 je 496600 0.00 : 49626a: 0f b6 57 16 movzbl 0x16(%rdi),%edx 0.00 : 49626e: 48 98 cltq 0.00 : 496270: 48 8d 04 07 lea (%rdi,%rax,1),%rax 0.00 : 496274: 0f b6 14 10 movzbl (%rax,%rdx,1),%edx 0.00 : 496278: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 49627f: 00 0.00 : 496280: 48 8b 4b 40 mov 0x40(%rbx),%rcx 0.00 : 496284: 8b 73 0c mov 0xc(%rbx),%esi 0.00 : 496287: 48 8d 7b 10 lea 0x10(%rbx),%rdi 0.00 : 49628b: e8 a0 7d 2e 00 callq 77e030 0.00 : 496290: 84 c0 test %al,%al 0.00 : 496292: 74 3f je 4962d3 0.00 : 496294: 45 85 e4 test %r12d,%r12d 0.00 : 496297: 0f 84 d3 02 00 00 je 496570 0.00 : 49629d: 48 83 c3 48 add $0x48,%rbx 0.00 : 4962a1: f6 03 01 testb $0x1,(%rbx) 0.00 : 4962a4: 75 2d jne 4962d3 0.00 : 4962a6: 41 83 ec 01 sub $0x1,%r12d 0.00 : 4962aa: 0f b7 4b 04 movzwl 0x4(%rbx),%ecx 0.00 : 4962ae: 66 85 c9 test %cx,%cx 0.00 : 4962b1: 0f 8e 49 02 00 00 jle 496500 0.00 : 4962b7: 49 8b 7d 58 mov 0x58(%r13),%rdi 0.00 : 4962bb: 0f bf f1 movswl %cx,%esi 0.00 : 4962be: 0f b7 47 12 movzwl 0x12(%rdi),%eax 0.00 : 4962c2: 25 ff 07 00 00 and $0x7ff,%eax 0.00 : 4962c7: 39 c6 cmp %eax,%esi 0.00 : 4962c9: 0f 8e 41 ff ff ff jle 496210 0.00 : 4962cf: c6 45 d7 01 movb $0x1,-0x29(%rbp) : */ : --linesleft; : if (backward) : --lineindex; : else : ++lineindex; 0.00 : 4962d3: 8b 55 c0 mov -0x40(%rbp),%edx 0.00 : 4962d6: 8b 45 c0 mov -0x40(%rbp),%eax : } : : /* : * otherwise move to the next item on the page : */ : --linesleft; 0.00 : 4962d9: 83 6d c4 01 subl $0x1,-0x3c(%rbp) : * advance the scan until we find a qualifying tuple or run out of stuff : * to scan : */ : for (;;) : { : while (linesleft > 0) 0.00 : 4962dd: 44 8b 45 c4 mov -0x3c(%rbp),%r8d : */ : --linesleft; : if (backward) : --lineindex; : else : ++lineindex; 0.00 : 4962e1: 83 c2 01 add $0x1,%edx 0.00 : 4962e4: 83 e8 01 sub $0x1,%eax 0.00 : 4962e7: 80 7d bf 00 cmpb $0x0,-0x41(%rbp) 0.00 : 4962eb: 0f 45 d0 cmovne %eax,%edx : * advance the scan until we find a qualifying tuple or run out of stuff : * to scan : */ : for (;;) : { : while (linesleft > 0) 0.00 : 4962ee: 45 85 c0 test %r8d,%r8d : */ : --linesleft; : if (backward) : --lineindex; : else : ++lineindex; 0.00 : 4962f1: 89 55 c0 mov %edx,-0x40(%rbp) : * advance the scan until we find a qualifying tuple or run out of stuff : * to scan : */ : for (;;) : { : while (linesleft > 0) 0.00 : 4962f4: 0f 8f 9b fe ff ff jg 496195 0.00 : 4962fa: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : : /* : * if we get here, it means we've exhausted the items on this page and : * it's time to move to the next. : */ : if (backward) 0.00 : 496300: 80 7d bf 00 cmpb $0x0,-0x41(%rbp) 0.00 : 496304: 0f 84 86 02 00 00 je 496590 : { : finished = (page == scan->rs_startblock) || 0.00 : 49630a: 45 39 7d 2c cmp %r15d,0x2c(%r13) 0.00 : 49630e: 74 1c je 49632c 0.00 : 496310: 41 8b 45 34 mov 0x34(%r13),%eax 0.00 : 496314: 83 f8 ff cmp $0xffffffff,%eax 0.00 : 496317: 0f 84 15 02 00 00 je 496532 0.00 : 49631d: 83 e8 01 sub $0x1,%eax 0.00 : 496320: 85 c0 test %eax,%eax 0.00 : 496322: 41 89 45 34 mov %eax,0x34(%r13) 0.00 : 496326: 0f 85 06 02 00 00 jne 496532 0.00 : 49632c: bb 01 00 00 00 mov $0x1,%ebx : (scan->rs_numblocks != InvalidBlockNumber ? --scan->rs_numblocks <= 0 : false); : if (page == 0) 0.00 : 496331: 45 85 ff test %r15d,%r15d 0.00 : 496334: 75 04 jne 49633a : page = scan->rs_nblocks; 0.00 : 496336: 45 8b 7d 28 mov 0x28(%r13),%r15d : page--; 0.00 : 49633a: 41 83 ef 01 sub $0x1,%r15d : } : : /* : * return NULL if we've exhausted all the pages : */ : if (finished) 0.00 : 49633e: 84 db test %bl,%bl 0.00 : 496340: 0f 85 f6 02 00 00 jne 49663c : tuple->t_data = NULL; : scan->rs_inited = false; : return; : } : : heapgetpage(scan, page); 0.00 : 496346: 44 89 fe mov %r15d,%esi 0.00 : 496349: 4c 89 ef mov %r13,%rdi 0.00 : 49634c: e8 0f fb ff ff callq 495e60 : : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 496351: 41 8b 45 64 mov 0x64(%r13),%eax 0.00 : 496355: 85 c0 test %eax,%eax 0.00 : 496357: 0f 88 bb 02 00 00 js 496618 0.00 : 49635d: 83 e8 01 sub $0x1,%eax 0.00 : 496360: 4c 63 f0 movslq %eax,%r14 0.00 : 496363: 49 c1 e6 0d shl $0xd,%r14 0.00 : 496367: 4c 03 35 8a 97 72 00 add 0x72978a(%rip),%r14 # bbfaf8 : lines = scan->rs_ntuples; : linesleft = lines; : if (backward) 0.00 : 49636e: 80 7d bf 00 cmpb $0x0,-0x41(%rbp) : } : : heapgetpage(scan, page); : : dp = (Page) BufferGetPage(scan->rs_cbuf); : lines = scan->rs_ntuples; 0.00 : 496372: 41 8b 45 78 mov 0x78(%r13),%eax : linesleft = lines; : if (backward) 0.00 : 496376: c7 45 c0 00 00 00 00 movl $0x0,-0x40(%rbp) 0.00 : 49637d: 89 45 c4 mov %eax,-0x3c(%rbp) 0.00 : 496380: 0f 84 02 fe ff ff je 496188 : lineindex = lines - 1; 0.00 : 496386: 8d 50 ff lea -0x1(%rax),%edx 0.00 : 496389: 89 45 c4 mov %eax,-0x3c(%rbp) 0.00 : 49638c: 89 55 c0 mov %edx,-0x40(%rbp) 0.00 : 49638f: e9 f4 fd ff ff jmpq 496188 : else : { : /* : * ``no movement'' scan direction: refetch prior tuple : */ : if (!scan->rs_inited) 0.00 : 496394: 80 7f 41 00 cmpb $0x0,0x41(%rdi) 0.00 : 496398: 74 6e je 496408 : Assert(!BufferIsValid(scan->rs_cbuf)); : tuple->t_data = NULL; : return; : } : : page = ItemPointerGetBlockNumber(&(tuple->t_self)); 0.00 : 49639a: 0f b7 77 4c movzwl 0x4c(%rdi),%esi 0.00 : 49639e: 0f b7 47 4e movzwl 0x4e(%rdi),%eax 0.00 : 4963a2: c1 e6 10 shl $0x10,%esi 0.00 : 4963a5: 09 c6 or %eax,%esi : if (page != scan->rs_cblock) 0.00 : 4963a7: 39 77 60 cmp %esi,0x60(%rdi) 0.00 : 4963aa: 74 05 je 4963b1 : heapgetpage(scan, page); 0.00 : 4963ac: e8 af fa ff ff callq 495e60 : : /* Since the tuple was previously fetched, needn't lock page here */ : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 4963b1: 41 8b 45 64 mov 0x64(%r13),%eax 0.00 : 4963b5: 85 c0 test %eax,%eax 0.00 : 4963b7: 0f 88 d8 02 00 00 js 496695 0.00 : 4963bd: 83 e8 01 sub $0x1,%eax 0.00 : 4963c0: 48 63 c8 movslq %eax,%rcx 0.00 : 4963c3: 48 c1 e1 0d shl $0xd,%rcx 0.00 : 4963c7: 48 03 0d 2a 97 72 00 add 0x72972a(%rip),%rcx # bbfaf8 : lineoff = ItemPointerGetOffsetNumber(&(tuple->t_self)); : lpp = PageGetItemId(dp, lineoff); 0.00 : 4963ce: 41 0f b7 45 50 movzwl 0x50(%r13),%eax : Assert(ItemIdIsNormal(lpp)); : : tuple->t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); 0.00 : 4963d3: 48 83 c0 03 add $0x3,%rax 0.00 : 4963d7: 0f b7 54 81 08 movzwl 0x8(%rcx,%rax,4),%edx 0.00 : 4963dc: 81 e2 ff 7f 00 00 and $0x7fff,%edx 0.00 : 4963e2: 48 8d 14 11 lea (%rcx,%rdx,1),%rdx 0.00 : 4963e6: 49 89 55 58 mov %rdx,0x58(%r13) : tuple->t_len = ItemIdGetLength(lpp); 0.00 : 4963ea: 0f b7 44 81 0a movzwl 0xa(%rcx,%rax,4),%eax 0.00 : 4963ef: 66 d1 e8 shr %ax 0.00 : 4963f2: 0f b7 c0 movzwl %ax,%eax 0.00 : 4963f5: 41 89 45 48 mov %eax,0x48(%r13) : if (backward) : lineindex = lines - 1; : else : lineindex = 0; : } : } 0.00 : 4963f9: 48 83 c4 48 add $0x48,%rsp 0.00 : 4963fd: 5b pop %rbx 0.00 : 4963fe: 41 5c pop %r12 0.00 : 496400: 41 5d pop %r13 0.00 : 496402: 41 5e pop %r14 0.00 : 496404: 41 5f pop %r15 0.00 : 496406: c9 leaveq 0.00 : 496407: c3 retq : * ``no movement'' scan direction: refetch prior tuple : */ : if (!scan->rs_inited) : { : Assert(!BufferIsValid(scan->rs_cbuf)); : tuple->t_data = NULL; 0.00 : 496408: 49 c7 45 58 00 00 00 movq $0x0,0x58(%r13) 0.00 : 49640f: 00 : if (backward) : lineindex = lines - 1; : else : lineindex = 0; : } : } 0.00 : 496410: 48 83 c4 48 add $0x48,%rsp 0.00 : 496414: 5b pop %rbx 0.00 : 496415: 41 5c pop %r12 0.00 : 496417: 41 5d pop %r13 0.00 : 496419: 41 5e pop %r14 0.00 : 49641b: 41 5f pop %r15 0.00 : 49641d: c9 leaveq 0.00 : 49641e: c3 retq 0.00 : 49641f: 90 nop : /* : * calculate next starting lineindex, given scan direction : */ : if (ScanDirectionIsForward(dir)) : { : if (!scan->rs_inited) 0.00 : 496420: 80 7f 41 00 cmpb $0x0,0x41(%rdi) 0.00 : 496424: 74 66 je 49648c : } : else : { : /* continue from previously returned page/tuple */ : page = scan->rs_cblock; /* current page */ : lineindex = scan->rs_cindex + 1; 0.00 : 496426: 8b 47 70 mov 0x70(%rdi),%eax : scan->rs_inited = true; : } : else : { : /* continue from previously returned page/tuple */ : page = scan->rs_cblock; /* current page */ 0.00 : 496429: 44 8b 7f 60 mov 0x60(%rdi),%r15d : lineindex = scan->rs_cindex + 1; 0.00 : 49642d: 83 c0 01 add $0x1,%eax 0.00 : 496430: 89 45 c0 mov %eax,-0x40(%rbp) : } : : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 496433: 41 8b 45 64 mov 0x64(%r13),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:770 11.76 : 496437: 85 c0 test %eax,%eax 0.00 : 496439: 0f 88 41 02 00 00 js 496680 0.00 : 49643f: 83 e8 01 sub $0x1,%eax 0.00 : 496442: 4c 63 f0 movslq %eax,%r14 0.00 : 496445: 49 c1 e6 0d shl $0xd,%r14 0.00 : 496449: 4c 03 35 a8 96 72 00 add 0x7296a8(%rip),%r14 # bbfaf8 : lines = scan->rs_ntuples; : /* page and lineindex now reference the next visible tid */ : : linesleft = lines - lineindex; 0.00 : 496450: 41 8b 55 78 mov 0x78(%r13),%edx 0.00 : 496454: 8b 45 c0 mov -0x40(%rbp),%eax 0.00 : 496457: 29 c2 sub %eax,%edx /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:774 5.88 : 496459: 89 55 c4 mov %edx,-0x3c(%rbp) 0.00 : 49645c: e9 1a fd ff ff jmpq 49617b : if (!scan->rs_inited) : { : /* : * return null immediately if relation is empty : */ : if (scan->rs_nblocks == 0) 0.00 : 496461: 44 8b 57 28 mov 0x28(%rdi),%r10d 0.00 : 496465: 45 85 d2 test %r10d,%r10d 0.00 : 496468: 74 9e je 496408 : * time, and much more likely that we'll just bollix things for : * forward scanners. : */ : scan->rs_syncscan = false; : /* start from last page of the scan */ : if (scan->rs_startblock > 0) 0.00 : 49646a: 8b 47 2c mov 0x2c(%rdi),%eax : * Disable reporting to syncscan logic in a backwards scan; it's : * not very likely anyone else is doing the same thing at the same : * time, and much more likely that we'll just bollix things for : * forward scanners. : */ : scan->rs_syncscan = false; 0.00 : 49646d: c6 47 40 00 movb $0x0,0x40(%rdi) : /* start from last page of the scan */ : if (scan->rs_startblock > 0) 0.00 : 496471: 85 c0 test %eax,%eax 0.00 : 496473: 75 03 jne 496478 : page = scan->rs_startblock - 1; : else : page = scan->rs_nblocks - 1; 0.00 : 496475: 8b 47 28 mov 0x28(%rdi),%eax 0.00 : 496478: 44 8d 78 ff lea -0x1(%rax),%r15d : heapgetpage(scan, page); 0.00 : 49647c: 4c 89 ef mov %r13,%rdi 0.00 : 49647f: 44 89 fe mov %r15d,%esi 0.00 : 496482: e8 d9 f9 ff ff callq 495e60 0.00 : 496487: e9 af fc ff ff jmpq 49613b : if (!scan->rs_inited) : { : /* : * return null immediately if relation is empty : */ : if (scan->rs_nblocks == 0) 0.00 : 49648c: 44 8b 5f 28 mov 0x28(%rdi),%r11d 0.00 : 496490: 45 85 db test %r11d,%r11d 0.00 : 496493: 0f 84 6f ff ff ff je 496408 : { : Assert(!BufferIsValid(scan->rs_cbuf)); : tuple->t_data = NULL; : return; : } : page = scan->rs_startblock; /* first page */ 0.00 : 496499: 44 8b 7f 2c mov 0x2c(%rdi),%r15d : heapgetpage(scan, page); 0.00 : 49649d: 44 89 fe mov %r15d,%esi 0.00 : 4964a0: e8 bb f9 ff ff callq 495e60 : lineindex = 0; : scan->rs_inited = true; 0.00 : 4964a5: 41 c6 45 41 01 movb $0x1,0x41(%r13) 0.00 : 4964aa: c7 45 c0 00 00 00 00 movl $0x0,-0x40(%rbp) 0.00 : 4964b1: eb 80 jmp 496433 0.00 : 4964b3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : */ : if (key != NULL) : { : bool valid; : : HeapKeyTest(tuple, RelationGetDescr(scan->rs_rd), 0.00 : 4964b8: 0f bf 73 04 movswl 0x4(%rbx),%esi 0.00 : 4964bc: 8d 4e ff lea -0x1(%rsi),%ecx 0.00 : 4964bf: 89 c8 mov %ecx,%eax 0.00 : 4964c1: 83 e1 07 and $0x7,%ecx 0.00 : 4964c4: c1 f8 03 sar $0x3,%eax 0.00 : 4964c7: 48 98 cltq 0.00 : 4964c9: 0f b6 44 07 17 movzbl 0x17(%rdi,%rax,1),%eax 0.00 : 4964ce: d3 f8 sar %cl,%eax 0.00 : 4964d0: a8 01 test $0x1,%al 0.00 : 4964d2: 0f 84 f7 fd ff ff je 4962cf 0.00 : 4964d8: 49 8b 45 00 mov 0x0(%r13),%rax 0.00 : 4964dc: 48 8b 7d b0 mov -0x50(%rbp),%rdi 0.00 : 4964e0: 48 8b 50 38 mov 0x38(%rax),%rdx 0.00 : 4964e4: e8 a7 94 fd ff callq 46f990 0.00 : 4964e9: 48 89 c2 mov %rax,%rdx 0.00 : 4964ec: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) 0.00 : 4964f0: 0f 84 8a fd ff ff je 496280 0.00 : 4964f6: e9 d8 fd ff ff jmpq 4962d3 0.00 : 4964fb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 496500: 49 8b 45 00 mov 0x0(%r13),%rax 0.00 : 496504: 48 8b 7d b0 mov -0x50(%rbp),%rdi 0.00 : 496508: 0f bf f1 movswl %cx,%esi 0.00 : 49650b: 48 8d 4d d7 lea -0x29(%rbp),%rcx 0.00 : 49650f: 48 8b 50 38 mov 0x38(%rax),%rdx 0.00 : 496513: e8 b8 87 fd ff callq 46ecd0 0.00 : 496518: 48 89 c2 mov %rax,%rdx 0.00 : 49651b: eb cf jmp 4964ec 0.00 : 49651d: 0f 1f 00 nopl (%rax) 0.00 : 496520: 0f b6 57 16 movzbl 0x16(%rdi),%edx 0.00 : 496524: 48 98 cltq 0.00 : 496526: 48 01 d0 add %rdx,%rax 0.00 : 496529: 48 8d 14 07 lea (%rdi,%rax,1),%rdx 0.00 : 49652d: e9 4e fd ff ff jmpq 496280 : * if we get here, it means we've exhausted the items on this page and : * it's time to move to the next. : */ : if (backward) : { : finished = (page == scan->rs_startblock) || 0.00 : 496532: 31 db xor %ebx,%ebx 0.00 : 496534: e9 f8 fd ff ff jmpq 496331 0.00 : 496539: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : */ : if (key != NULL) : { : bool valid; : : HeapKeyTest(tuple, RelationGetDescr(scan->rs_rd), 0.00 : 496540: 48 8b 7d b0 mov -0x50(%rbp),%rdi 0.00 : 496544: 4c 89 c2 mov %r8,%rdx 0.00 : 496547: e8 44 94 fd ff callq 46f990 0.00 : 49654c: 48 89 c2 mov %rax,%rdx 0.00 : 49654f: eb 9b jmp 4964ec 0.00 : 496551: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 496558: 0f b6 57 16 movzbl 0x16(%rdi),%edx 0.00 : 49655c: 48 98 cltq 0.00 : 49655e: 48 8d 04 07 lea (%rdi,%rax,1),%rax 0.00 : 496562: 48 8b 14 10 mov (%rax,%rdx,1),%rdx 0.00 : 496566: e9 15 fd ff ff jmpq 496280 0.00 : 49656b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : nkeys, key, valid); : if (valid) : { : scan->rs_cindex = lineindex; 0.00 : 496570: 8b 45 c0 mov -0x40(%rbp),%eax 0.00 : 496573: 41 89 45 70 mov %eax,0x70(%r13) : if (backward) : lineindex = lines - 1; : else : lineindex = 0; : } : } 0.00 : 496577: 48 83 c4 48 add $0x48,%rsp 0.00 : 49657b: 5b pop %rbx 0.00 : 49657c: 41 5c pop %r12 0.00 : 49657e: 41 5d pop %r13 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:965 5.88 : 496580: 41 5e pop %r14 0.00 : 496582: 41 5f pop %r15 0.00 : 496584: c9 leaveq 0.00 : 496585: c3 retq 0.00 : 496586: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 49658d: 00 00 00 : page = scan->rs_nblocks; : page--; : } : else : { : page++; 0.00 : 496590: 41 83 c7 01 add $0x1,%r15d : if (page >= scan->rs_nblocks) 0.00 : 496594: 45 3b 7d 28 cmp 0x28(%r13),%r15d 0.00 : 496598: b8 00 00 00 00 mov $0x0,%eax 0.00 : 49659d: 44 0f 43 f8 cmovae %eax,%r15d : page = 0; : finished = (page == scan->rs_startblock) || 0.00 : 4965a1: 45 39 7d 2c cmp %r15d,0x2c(%r13) 0.00 : 4965a5: 74 14 je 4965bb 0.00 : 4965a7: 41 8b 45 34 mov 0x34(%r13),%eax 0.00 : 4965ab: 83 f8 ff cmp $0xffffffff,%eax 0.00 : 4965ae: 74 2c je 4965dc 0.00 : 4965b0: 83 e8 01 sub $0x1,%eax 0.00 : 4965b3: 85 c0 test %eax,%eax 0.00 : 4965b5: 41 89 45 34 mov %eax,0x34(%r13) 0.00 : 4965b9: 75 21 jne 4965dc 0.00 : 4965bb: bb 01 00 00 00 mov $0x1,%ebx : * rel. That's not strictly necessary, but otherwise when you run : * the same query multiple times the starting position would shift : * a little bit backwards on every invocation, which is confusing. : * We don't guarantee any specific ordering in general, though. : */ : if (scan->rs_syncscan) 0.00 : 4965c0: 41 80 7d 40 00 cmpb $0x0,0x40(%r13) 0.00 : 4965c5: 0f 84 73 fd ff ff je 49633e : ss_report_location(scan->rs_rd, page); 0.00 : 4965cb: 49 8b 7d 00 mov 0x0(%r13),%rdi 0.00 : 4965cf: 44 89 fe mov %r15d,%esi 0.00 : 4965d2: e8 49 a8 00 00 callq 4a0e20 0.00 : 4965d7: e9 62 fd ff ff jmpq 49633e : else : { : page++; : if (page >= scan->rs_nblocks) : page = 0; : finished = (page == scan->rs_startblock) || 0.00 : 4965dc: 31 db xor %ebx,%ebx 0.00 : 4965de: 66 90 xchg %ax,%ax 0.00 : 4965e0: eb de jmp 4965c0 0.00 : 4965e2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : */ : if (key != NULL) : { : bool valid; : : HeapKeyTest(tuple, RelationGetDescr(scan->rs_rd), 0.00 : 4965e8: 0f b6 57 16 movzbl 0x16(%rdi),%edx 0.00 : 4965ec: 48 98 cltq 0.00 : 4965ee: 48 8d 04 07 lea (%rdi,%rax,1),%rax 0.00 : 4965f2: 8b 14 10 mov (%rax,%rdx,1),%edx 0.00 : 4965f5: e9 86 fc ff ff jmpq 496280 0.00 : 4965fa: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 496600: 0f b6 57 16 movzbl 0x16(%rdi),%edx 0.00 : 496604: 48 98 cltq 0.00 : 496606: 48 8d 04 07 lea (%rdi,%rax,1),%rax 0.00 : 49660a: 0f b7 14 10 movzwl (%rax,%rdx,1),%edx 0.00 : 49660e: e9 6d fc ff ff jmpq 496280 0.00 : 496613: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : return; : } : : heapgetpage(scan, page); : : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 496618: f7 d0 not %eax 0.00 : 49661a: 48 63 d0 movslq %eax,%rdx 0.00 : 49661d: 48 8b 05 f4 6a 6e 00 mov 0x6e6af4(%rip),%rax # b7d118 0.00 : 496624: 4c 8b 34 d0 mov (%rax,%rdx,8),%r14 0.00 : 496628: e9 41 fd ff ff jmpq 49636e : lineindex = lines - 1; : scan->rs_inited = true; : } : else : { : lineindex = scan->rs_cindex - 1; 0.00 : 49662d: 41 8b 45 70 mov 0x70(%r13),%eax 0.00 : 496631: 83 e8 01 sub $0x1,%eax 0.00 : 496634: 89 45 c0 mov %eax,-0x40(%rbp) 0.00 : 496637: e9 36 fb ff ff jmpq 496172 : /* : * return NULL if we've exhausted all the pages : */ : if (finished) : { : if (BufferIsValid(scan->rs_cbuf)) 0.00 : 49663c: 41 8b 7d 64 mov 0x64(%r13),%edi 0.00 : 496640: 85 ff test %edi,%edi 0.00 : 496642: 74 05 je 496649 : ReleaseBuffer(scan->rs_cbuf); 0.00 : 496644: e8 17 e8 1d 00 callq 674e60 : scan->rs_cbuf = InvalidBuffer; 0.00 : 496649: 41 c7 45 64 00 00 00 movl $0x0,0x64(%r13) 0.00 : 496650: 00 : scan->rs_cblock = InvalidBlockNumber; 0.00 : 496651: 41 c7 45 60 ff ff ff movl $0xffffffff,0x60(%r13) 0.00 : 496658: ff : tuple->t_data = NULL; 0.00 : 496659: 49 c7 45 58 00 00 00 movq $0x0,0x58(%r13) 0.00 : 496660: 00 : scan->rs_inited = false; 0.00 : 496661: 41 c6 45 41 00 movb $0x0,0x41(%r13) : if (backward) : lineindex = lines - 1; : else : lineindex = 0; : } : } 0.00 : 496666: e9 a5 fd ff ff jmpq 496410 : { : /* continue from previously returned page/tuple */ : page = scan->rs_cblock; /* current page */ : } : : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 49666b: f7 d0 not %eax 0.00 : 49666d: 48 63 d0 movslq %eax,%rdx 0.00 : 496670: 48 8b 05 a1 6a 6e 00 mov 0x6e6aa1(%rip),%rax # b7d118 0.00 : 496677: 4c 8b 34 d0 mov (%rax,%rdx,8),%r14 0.00 : 49667b: e9 d8 fa ff ff jmpq 496158 : /* continue from previously returned page/tuple */ : page = scan->rs_cblock; /* current page */ : lineindex = scan->rs_cindex + 1; : } : : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 496680: f7 d0 not %eax 0.00 : 496682: 48 63 d0 movslq %eax,%rdx 0.00 : 496685: 48 8b 05 8c 6a 6e 00 mov 0x6e6a8c(%rip),%rax # b7d118 0.00 : 49668c: 4c 8b 34 d0 mov (%rax,%rdx,8),%r14 0.00 : 496690: e9 bb fd ff ff jmpq 496450 : page = ItemPointerGetBlockNumber(&(tuple->t_self)); : if (page != scan->rs_cblock) : heapgetpage(scan, page); : : /* Since the tuple was previously fetched, needn't lock page here */ : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 496695: f7 d0 not %eax 0.00 : 496697: 48 63 d0 movslq %eax,%rdx 0.00 : 49669a: 48 8b 05 77 6a 6e 00 mov 0x6e6a77(%rip),%rax # b7d118 0.00 : 4966a1: 48 8b 0c d0 mov (%rax,%rdx,8),%rcx 0.00 : 4966a5: e9 24 fd ff ff jmpq 4963ce Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 18.75 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:148 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:137 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:142 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:162 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:137 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:191 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:194 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:255 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:195 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:196 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:195 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000046ff60 : : void : heap_fill_tuple(TupleDesc tupleDesc, : Datum *values, bool *isnull, : char *data, Size data_size, : uint16 *infomask, bits8 *bit) : { 0.00 : 46ff60: 55 push %rbp : : #ifdef USE_ASSERT_CHECKING : char *start = data; : #endif : : if (bit != NULL) 0.00 : 46ff61: 45 31 d2 xor %r10d,%r10d : void : heap_fill_tuple(TupleDesc tupleDesc, : Datum *values, bool *isnull, : char *data, Size data_size, : uint16 *infomask, bits8 *bit) : { 0.00 : 46ff64: 48 89 e5 mov %rsp,%rbp 0.00 : 46ff67: 41 57 push %r15 : : #ifdef USE_ASSERT_CHECKING : char *start = data; : #endif : : if (bit != NULL) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:148 18.75 : 46ff69: 45 31 ff xor %r15d,%r15d : void : heap_fill_tuple(TupleDesc tupleDesc, : Datum *values, bool *isnull, : char *data, Size data_size, : uint16 *infomask, bits8 *bit) : { 0.00 : 46ff6c: 41 56 push %r14 0.00 : 46ff6e: 41 55 push %r13 0.00 : 46ff70: 49 89 cd mov %rcx,%r13 0.00 : 46ff73: 41 54 push %r12 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:137 6.25 : 46ff75: 53 push %rbx 0.00 : 46ff76: 48 83 ec 38 sub $0x38,%rsp 0.00 : 46ff7a: 4c 8b 5d 10 mov 0x10(%rbp),%r11 12.50 : 46ff7e: 48 89 75 c8 mov %rsi,-0x38(%rbp) 0.00 : 46ff82: 48 89 55 c0 mov %rdx,-0x40(%rbp) : bits8 *bitP; : int bitmask; : int i; : int numberOfAttributes = tupleDesc->natts; 0.00 : 46ff86: 8b 07 mov (%rdi),%eax : : #ifdef USE_ASSERT_CHECKING : char *start = data; : #endif : : if (bit != NULL) 0.00 : 46ff88: 4d 85 db test %r11,%r11 : uint16 *infomask, bits8 *bit) : { : bits8 *bitP; : int bitmask; : int i; : int numberOfAttributes = tupleDesc->natts; 0.00 : 46ff8b: 89 45 d4 mov %eax,-0x2c(%rbp) : Form_pg_attribute *att = tupleDesc->attrs; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:142 12.50 : 46ff8e: 48 8b 47 08 mov 0x8(%rdi),%rax : : #ifdef USE_ASSERT_CHECKING : char *start = data; : #endif : : if (bit != NULL) 0.00 : 46ff92: 74 0a je 46ff9e : { : bitP = &bit[-1]; 0.00 : 46ff94: 4d 8d 53 ff lea -0x1(%r11),%r10 0.00 : 46ff98: 41 bf 80 00 00 00 mov $0x80,%r15d : /* just to keep compiler quiet */ : bitP = NULL; : bitmask = 0; : } : : *infomask &= ~(HEAP_HASNULL | HEAP_HASVARWIDTH | HEAP_HASEXTERNAL); 0.00 : 46ff9e: 66 41 83 21 f8 andw $0xfff8,(%r9) : : for (i = 0; i < numberOfAttributes; i++) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:162 12.50 : 46ffa3: 8b 4d d4 mov -0x2c(%rbp),%ecx 0.00 : 46ffa6: 85 c9 test %ecx,%ecx 0.00 : 46ffa8: 0f 8e 5c 01 00 00 jle 47010a 0.00 : 46ffae: 49 89 c0 mov %rax,%r8 0.00 : 46ffb1: 45 31 f6 xor %r14d,%r14d 0.00 : 46ffb4: eb 21 jmp 46ffd7 0.00 : 46ffb6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 46ffbd: 00 00 00 : bitmask = 1; : } : : if (isnull[i]) : { : *infomask |= HEAP_HASNULL; 0.00 : 46ffc0: 66 41 83 09 01 orw $0x1,(%r9) : Assert(att[i]->attlen > 0); : data_length = att[i]->attlen; : memcpy(data, DatumGetPointer(values[i]), data_length); : } : : data += data_length; 0.00 : 46ffc5: 49 83 c6 01 add $0x1,%r14 0.00 : 46ffc9: 49 83 c0 08 add $0x8,%r8 : bitmask = 0; : } : : *infomask &= ~(HEAP_HASNULL | HEAP_HASVARWIDTH | HEAP_HASEXTERNAL); : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 46ffcd: 44 39 75 d4 cmp %r14d,-0x2c(%rbp) 0.00 : 46ffd1: 0f 8e 33 01 00 00 jle 47010a : { : Size data_length; : : if (bit != NULL) 0.00 : 46ffd7: 4d 85 db test %r11,%r11 0.00 : 46ffda: 74 1e je 46fffa : { : if (bitmask != HIGHBIT) 0.00 : 46ffdc: 41 81 ff 80 00 00 00 cmp $0x80,%r15d 0.00 : 46ffe3: 0f 84 37 01 00 00 je 470120 : bitmask <<= 1; 0.00 : 46ffe9: 45 01 ff add %r15d,%r15d : bitP += 1; : *bitP = 0x0; : bitmask = 1; : } : : if (isnull[i]) 0.00 : 46ffec: 48 8b 55 c0 mov -0x40(%rbp),%rdx 0.00 : 46fff0: 42 80 3c 32 00 cmpb $0x0,(%rdx,%r14,1) 0.00 : 46fff5: 75 c9 jne 46ffc0 : { : *infomask |= HEAP_HASNULL; : continue; : } : : *bitP |= bitmask; 0.00 : 46fff7: 45 08 3a or %r15b,(%r10) : /* : * XXX we use the att_align macros on the pointer value itself, not on : * an offset. This is a bit of a hack. : */ : : if (att[i]->attbyval) 0.00 : 46fffa: 49 8b 08 mov (%r8),%rcx 0.00 : 46fffd: 80 79 5c 00 cmpb $0x0,0x5c(%rcx) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:191 6.25 : 470001: 74 7d je 470080 : { : /* pass-by-value */ : data = (char *) att_align_nominal(data, att[i]->attalign); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:194 6.25 : 470003: 0f b6 41 5e movzbl 0x5e(%rcx),%eax 0.00 : 470007: 3c 69 cmp $0x69,%al 0.00 : 470009: 0f 84 f1 01 00 00 je 470200 0.00 : 47000f: 3c 63 cmp $0x63,%al 0.00 : 470011: 74 10 je 470023 0.00 : 470013: 3c 64 cmp $0x64,%al 0.00 : 470015: 0f 84 55 02 00 00 je 470270 0.00 : 47001b: 49 83 c5 01 add $0x1,%r13 0.00 : 47001f: 49 83 e5 fe and $0xfffffffffffffffe,%r13 : store_att_byval(data, values[i], att[i]->attlen); 0.00 : 470023: 0f b7 41 4c movzwl 0x4c(%rcx),%eax 0.00 : 470027: 66 83 f8 02 cmp $0x2,%ax 0.00 : 47002b: 0f 84 e5 01 00 00 je 470216 0.00 : 470031: 0f 8f 01 01 00 00 jg 470138 0.00 : 470037: 66 83 e8 01 sub $0x1,%ax 0.00 : 47003b: 0f 84 07 02 00 00 je 470248 0.00 : 470041: ba 30 f7 7a 00 mov $0x7af730,%edx 0.00 : 470046: be c3 00 00 00 mov $0xc3,%esi 0.00 : 47004b: bf f4 f5 7a 00 mov $0x7af5f4,%edi 0.00 : 470050: 4c 89 45 b8 mov %r8,-0x48(%rbp) 0.00 : 470054: e8 c7 b3 30 00 callq 77b420 0.00 : 470059: 4c 8b 45 b8 mov -0x48(%rbp),%r8 0.00 : 47005d: be 2f f6 7a 00 mov $0x7af62f,%esi 0.00 : 470062: bf 14 00 00 00 mov $0x14,%edi 0.00 : 470067: 49 8b 00 mov (%r8),%rax 0.00 : 47006a: 0f bf 50 4c movswl 0x4c(%rax),%edx 0.00 : 47006e: 31 c0 xor %eax,%eax 0.00 : 470070: e8 bb b1 30 00 callq 77b230 0.00 : 470075: e8 56 94 ff ff callq 4694d0 0.00 : 47007a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : data_length = att[i]->attlen; : } : else if (att[i]->attlen == -1) 0.00 : 470080: 0f b7 41 4c movzwl 0x4c(%rcx),%eax 0.00 : 470084: 66 83 f8 ff cmp $0xffff,%ax 0.00 : 470088: 0f 84 da 00 00 00 je 470168 : att[i]->attalign); : data_length = VARSIZE(val); : memcpy(data, val, data_length); : } : } : else if (att[i]->attlen == -2) 0.00 : 47008e: 66 83 f8 fe cmp $0xfffe,%ax 0.00 : 470092: 0f 84 e8 01 00 00 je 470280 : memcpy(data, DatumGetPointer(values[i]), data_length); : } : else : { : /* fixed-length pass-by-reference */ : data = (char *) att_align_nominal(data, att[i]->attalign); 0.00 : 470098: 0f b6 49 5e movzbl 0x5e(%rcx),%ecx 0.00 : 47009c: 80 f9 69 cmp $0x69,%cl 0.00 : 47009f: 0f 84 bb 01 00 00 je 470260 0.00 : 4700a5: 80 f9 63 cmp $0x63,%cl 0.00 : 4700a8: 74 14 je 4700be 0.00 : 4700aa: 80 f9 64 cmp $0x64,%cl 0.00 : 4700ad: 0f 1f 00 nopl (%rax) 0.00 : 4700b0: 0f 84 3a 02 00 00 je 4702f0 0.00 : 4700b6: 49 83 c5 01 add $0x1,%r13 0.00 : 4700ba: 49 83 e5 fe and $0xfffffffffffffffe,%r13 : Assert(att[i]->attlen > 0); : data_length = att[i]->attlen; : memcpy(data, DatumGetPointer(values[i]), data_length); 0.00 : 4700be: 48 8b 55 c8 mov -0x38(%rbp),%rdx : else : { : /* fixed-length pass-by-reference */ : data = (char *) att_align_nominal(data, att[i]->attalign); : Assert(att[i]->attlen > 0); : data_length = att[i]->attlen; 0.00 : 4700c2: 4c 0f bf e0 movswq %ax,%r12 : memcpy(data, DatumGetPointer(values[i]), data_length); 0.00 : 4700c6: 4c 89 ef mov %r13,%rdi 0.00 : 4700c9: 4a 8b 34 f2 mov (%rdx,%r14,8),%rsi 0.00 : 4700cd: 4c 89 e2 mov %r12,%rdx 0.00 : 4700d0: 4c 89 45 b8 mov %r8,-0x48(%rbp) 0.00 : 4700d4: 4c 89 4d b0 mov %r9,-0x50(%rbp) 0.00 : 4700d8: 4c 89 55 a8 mov %r10,-0x58(%rbp) 0.00 : 4700dc: 4c 89 5d a0 mov %r11,-0x60(%rbp) 0.00 : 4700e0: e8 0b 9b ff ff callq 469bf0 0.00 : 4700e5: 4c 8b 5d a0 mov -0x60(%rbp),%r11 0.00 : 4700e9: 4c 8b 55 a8 mov -0x58(%rbp),%r10 0.00 : 4700ed: 4c 8b 4d b0 mov -0x50(%rbp),%r9 0.00 : 4700f1: 4c 8b 45 b8 mov -0x48(%rbp),%r8 : } : : data += data_length; 0.00 : 4700f5: 4d 01 e5 add %r12,%r13 0.00 : 4700f8: 49 83 c6 01 add $0x1,%r14 0.00 : 4700fc: 49 83 c0 08 add $0x8,%r8 : bitmask = 0; : } : : *infomask &= ~(HEAP_HASNULL | HEAP_HASVARWIDTH | HEAP_HASEXTERNAL); : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 470100: 44 39 75 d4 cmp %r14d,-0x2c(%rbp) 0.00 : 470104: 0f 8f cd fe ff ff jg 46ffd7 : : data += data_length; : } : : Assert((data - start) == data_size); : } 0.00 : 47010a: 48 83 c4 38 add $0x38,%rsp 0.00 : 47010e: 5b pop %rbx 0.00 : 47010f: 41 5c pop %r12 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:255 6.25 : 470111: 41 5d pop %r13 0.00 : 470113: 41 5e pop %r14 0.00 : 470115: 41 5f pop %r15 0.00 : 470117: c9 leaveq 0.00 : 470118: c3 retq 0.00 : 470119: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : { : if (bitmask != HIGHBIT) : bitmask <<= 1; : else : { : bitP += 1; 0.00 : 470120: 49 83 c2 01 add $0x1,%r10 : *bitP = 0x0; 0.00 : 470124: 41 bf 01 00 00 00 mov $0x1,%r15d 0.00 : 47012a: 41 c6 02 00 movb $0x0,(%r10) 0.00 : 47012e: e9 b9 fe ff ff jmpq 46ffec 0.00 : 470133: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : : if (att[i]->attbyval) : { : /* pass-by-value */ : data = (char *) att_align_nominal(data, att[i]->attalign); : store_att_byval(data, values[i], att[i]->attlen); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:195 6.25 : 470138: 66 83 f8 04 cmp $0x4,%ax 0.00 : 47013c: 0f 84 ee 00 00 00 je 470230 0.00 : 470142: 66 83 f8 08 cmp $0x8,%ax 0.00 : 470146: 0f 85 f5 fe ff ff jne 470041 0.00 : 47014c: 48 8b 55 c8 mov -0x38(%rbp),%rdx 0.00 : 470150: 4a 8b 04 f2 mov (%rdx,%r14,8),%rax 0.00 : 470154: 49 89 45 00 mov %rax,0x0(%r13) : data_length = att[i]->attlen; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:196 6.25 : 470158: 49 8b 00 mov (%r8),%rax 0.00 : 47015b: 4c 0f bf 60 4c movswq 0x4c(%rax),%r12 0.00 : 470160: eb 93 jmp 4700f5 0.00 : 470162: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : } : else if (att[i]->attlen == -1) : { : /* varlena */ : Pointer val = DatumGetPointer(values[i]); 0.00 : 470168: 48 8b 45 c8 mov -0x38(%rbp),%rax : : *infomask |= HEAP_HASVARWIDTH; 0.00 : 47016c: 41 0f b7 11 movzwl (%r9),%edx : data_length = att[i]->attlen; : } : else if (att[i]->attlen == -1) : { : /* varlena */ : Pointer val = DatumGetPointer(values[i]); 0.00 : 470170: 4a 8b 34 f0 mov (%rax,%r14,8),%rsi : : *infomask |= HEAP_HASVARWIDTH; 0.00 : 470174: 89 d0 mov %edx,%eax 0.00 : 470176: 83 c8 02 or $0x2,%eax 0.00 : 470179: 66 41 89 01 mov %ax,(%r9) : if (VARATT_IS_EXTERNAL(val)) 0.00 : 47017d: 0f b6 06 movzbl (%rsi),%eax 0.00 : 470180: 3c 01 cmp $0x1,%al 0.00 : 470182: 0f 84 38 01 00 00 je 4702c0 : *infomask |= HEAP_HASEXTERNAL; : /* no alignment, since it's short by definition */ : data_length = VARSIZE_EXTERNAL(val); : memcpy(data, val, data_length); : } : else if (VARATT_IS_SHORT(val)) 0.00 : 470188: 0f b6 d0 movzbl %al,%edx 0.00 : 47018b: f6 c2 01 test $0x1,%dl 0.00 : 47018e: 0f 85 6c 01 00 00 jne 470300 : { : /* no alignment for short varlenas */ : data_length = VARSIZE_SHORT(val); : memcpy(data, val, data_length); : } : else if (VARLENA_ATT_IS_PACKABLE(att[i]) && 0.00 : 470194: 49 8b 00 mov (%r8),%rax 0.00 : 470197: 80 78 5d 70 cmpb $0x70,0x5d(%rax) 0.00 : 47019b: 74 09 je 4701a6 0.00 : 47019d: 83 e2 03 and $0x3,%edx 0.00 : 4701a0: 0f 84 6a 01 00 00 je 470310 0.00 : 4701a6: 8b 0e mov (%rsi),%ecx 0.00 : 4701a8: c1 e9 02 shr $0x2,%ecx : memcpy(data + 1, VARDATA(val), data_length - 1); : } : else : { : /* full 4-byte header varlena */ : data = (char *) att_align_nominal(data, 0.00 : 4701ab: 0f b6 40 5e movzbl 0x5e(%rax),%eax 0.00 : 4701af: 3c 69 cmp $0x69,%al 0.00 : 4701b1: 0f 84 99 01 00 00 je 470350 0.00 : 4701b7: 3c 63 cmp $0x63,%al 0.00 : 4701b9: 74 10 je 4701cb 0.00 : 4701bb: 3c 64 cmp $0x64,%al 0.00 : 4701bd: 0f 84 9a 01 00 00 je 47035d 0.00 : 4701c3: 49 83 c5 01 add $0x1,%r13 0.00 : 4701c7: 49 83 e5 fe and $0xfffffffffffffffe,%r13 : att[i]->attalign); : data_length = VARSIZE(val); 0.00 : 4701cb: 41 89 cc mov %ecx,%r12d : memcpy(data, val, data_length); 0.00 : 4701ce: 4c 89 e2 mov %r12,%rdx 0.00 : 4701d1: 4c 89 ef mov %r13,%rdi 0.00 : 4701d4: 4c 89 45 b8 mov %r8,-0x48(%rbp) 0.00 : 4701d8: 4c 89 4d b0 mov %r9,-0x50(%rbp) 0.00 : 4701dc: 4c 89 55 a8 mov %r10,-0x58(%rbp) 0.00 : 4701e0: 4c 89 5d a0 mov %r11,-0x60(%rbp) 0.00 : 4701e4: e8 07 9a ff ff callq 469bf0 0.00 : 4701e9: 4c 8b 45 b8 mov -0x48(%rbp),%r8 0.00 : 4701ed: 4c 8b 4d b0 mov -0x50(%rbp),%r9 0.00 : 4701f1: 4c 8b 55 a8 mov -0x58(%rbp),%r10 0.00 : 4701f5: 4c 8b 5d a0 mov -0x60(%rbp),%r11 0.00 : 4701f9: e9 f7 fe ff ff jmpq 4700f5 0.00 : 4701fe: 66 90 xchg %ax,%ax : : if (att[i]->attbyval) : { : /* pass-by-value */ : data = (char *) att_align_nominal(data, att[i]->attalign); : store_att_byval(data, values[i], att[i]->attlen); 0.00 : 470200: 0f b7 41 4c movzwl 0x4c(%rcx),%eax : */ : : if (att[i]->attbyval) : { : /* pass-by-value */ : data = (char *) att_align_nominal(data, att[i]->attalign); 0.00 : 470204: 49 83 c5 03 add $0x3,%r13 0.00 : 470208: 49 83 e5 fc and $0xfffffffffffffffc,%r13 : store_att_byval(data, values[i], att[i]->attlen); 0.00 : 47020c: 66 83 f8 02 cmp $0x2,%ax 0.00 : 470210: 0f 85 1b fe ff ff jne 470031 0.00 : 470216: 48 8b 55 c8 mov -0x38(%rbp),%rdx 0.00 : 47021a: 4a 8b 04 f2 mov (%rdx,%r14,8),%rax 0.00 : 47021e: 66 41 89 45 00 mov %ax,0x0(%r13) 0.00 : 470223: e9 30 ff ff ff jmpq 470158 0.00 : 470228: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 47022f: 00 0.00 : 470230: 48 8b 55 c8 mov -0x38(%rbp),%rdx 0.00 : 470234: 4a 8b 04 f2 mov (%rdx,%r14,8),%rax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:195 6.25 : 470238: 41 89 45 00 mov %eax,0x0(%r13) 0.00 : 47023c: e9 17 ff ff ff jmpq 470158 0.00 : 470241: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 470248: 48 8b 55 c8 mov -0x38(%rbp),%rdx 0.00 : 47024c: 4a 8b 04 f2 mov (%rdx,%r14,8),%rax 0.00 : 470250: 41 88 45 00 mov %al,0x0(%r13) 0.00 : 470254: e9 ff fe ff ff jmpq 470158 0.00 : 470259: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : memcpy(data, DatumGetPointer(values[i]), data_length); : } : else : { : /* fixed-length pass-by-reference */ : data = (char *) att_align_nominal(data, att[i]->attalign); 0.00 : 470260: 49 83 c5 03 add $0x3,%r13 0.00 : 470264: 49 83 e5 fc and $0xfffffffffffffffc,%r13 0.00 : 470268: e9 51 fe ff ff jmpq 4700be 0.00 : 47026d: 0f 1f 00 nopl (%rax) : */ : : if (att[i]->attbyval) : { : /* pass-by-value */ : data = (char *) att_align_nominal(data, att[i]->attalign); 0.00 : 470270: 49 83 c5 07 add $0x7,%r13 0.00 : 470274: 49 83 e5 f8 and $0xfffffffffffffff8,%r13 0.00 : 470278: e9 a6 fd ff ff jmpq 470023 0.00 : 47027d: 0f 1f 00 nopl (%rax) : } : } : else if (att[i]->attlen == -2) : { : /* cstring ... never needs alignment */ : *infomask |= HEAP_HASVARWIDTH; 0.00 : 470280: 66 41 83 09 02 orw $0x2,(%r9) : Assert(att[i]->attalign == 'c'); : data_length = strlen(DatumGetCString(values[i])) + 1; 0.00 : 470285: 48 8b 45 c8 mov -0x38(%rbp),%rax 0.00 : 470289: 4a 8b 1c f0 mov (%rax,%r14,8),%rbx 0.00 : 47028d: 4c 89 45 b8 mov %r8,-0x48(%rbp) 0.00 : 470291: 4c 89 4d b0 mov %r9,-0x50(%rbp) 0.00 : 470295: 4c 89 55 a8 mov %r10,-0x58(%rbp) 0.00 : 470299: 4c 89 5d a0 mov %r11,-0x60(%rbp) 0.00 : 47029d: 48 89 df mov %rbx,%rdi 0.00 : 4702a0: e8 ab 95 ff ff callq 469850 0.00 : 4702a5: 4c 8d 60 01 lea 0x1(%rax),%r12 : memcpy(data, DatumGetPointer(values[i]), data_length); 0.00 : 4702a9: 48 89 de mov %rbx,%rsi 0.00 : 4702ac: 4c 89 ef mov %r13,%rdi 0.00 : 4702af: 4c 89 e2 mov %r12,%rdx 0.00 : 4702b2: e9 2d ff ff ff jmpq 4701e4 0.00 : 4702b7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 4702be: 00 00 : Pointer val = DatumGetPointer(values[i]); : : *infomask |= HEAP_HASVARWIDTH; : if (VARATT_IS_EXTERNAL(val)) : { : *infomask |= HEAP_HASEXTERNAL; 0.00 : 4702c0: 83 ca 06 or $0x6,%edx : /* no alignment, since it's short by definition */ : data_length = VARSIZE_EXTERNAL(val); 0.00 : 4702c3: 41 bc 0a 00 00 00 mov $0xa,%r12d : Pointer val = DatumGetPointer(values[i]); : : *infomask |= HEAP_HASVARWIDTH; : if (VARATT_IS_EXTERNAL(val)) : { : *infomask |= HEAP_HASEXTERNAL; 0.00 : 4702c9: 66 41 89 11 mov %dx,(%r9) : /* no alignment, since it's short by definition */ : data_length = VARSIZE_EXTERNAL(val); 0.00 : 4702cd: 0f b6 46 01 movzbl 0x1(%rsi),%eax 0.00 : 4702d1: 3c 01 cmp $0x1,%al 0.00 : 4702d3: 0f 84 f5 fe ff ff je 4701ce 0.00 : 4702d9: 3c 12 cmp $0x12,%al 0.00 : 4702db: 41 bc 03 00 00 00 mov $0x3,%r12d 0.00 : 4702e1: ba 12 00 00 00 mov $0x12,%edx 0.00 : 4702e6: 4c 0f 44 e2 cmove %rdx,%r12 0.00 : 4702ea: e9 df fe ff ff jmpq 4701ce 0.00 : 4702ef: 90 nop : memcpy(data, DatumGetPointer(values[i]), data_length); : } : else : { : /* fixed-length pass-by-reference */ : data = (char *) att_align_nominal(data, att[i]->attalign); 0.00 : 4702f0: 49 83 c5 07 add $0x7,%r13 0.00 : 4702f4: 49 83 e5 f8 and $0xfffffffffffffff8,%r13 0.00 : 4702f8: e9 c1 fd ff ff jmpq 4700be 0.00 : 4702fd: 0f 1f 00 nopl (%rax) : memcpy(data, val, data_length); : } : else if (VARATT_IS_SHORT(val)) : { : /* no alignment for short varlenas */ : data_length = VARSIZE_SHORT(val); 0.00 : 470300: d0 e8 shr %al 0.00 : 470302: 44 0f b6 e0 movzbl %al,%r12d 0.00 : 470306: e9 c3 fe ff ff jmpq 4701ce 0.00 : 47030b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : memcpy(data, val, data_length); : } : else if (VARLENA_ATT_IS_PACKABLE(att[i]) && 0.00 : 470310: 8b 0e mov (%rsi),%ecx 0.00 : 470312: c1 e9 02 shr $0x2,%ecx 0.00 : 470315: 8d 51 fc lea -0x4(%rcx),%edx 0.00 : 470318: 4c 8d 62 01 lea 0x1(%rdx),%r12 0.00 : 47031c: 49 83 fc 7f cmp $0x7f,%r12 0.00 : 470320: 0f 87 85 fe ff ff ja 4701ab : VARATT_CAN_MAKE_SHORT(val)) : { : /* convert to short varlena -- no alignment */ : data_length = VARATT_CONVERTED_SHORT_SIZE(val); : SET_VARSIZE_SHORT(data, data_length); 0.00 : 470326: 43 8d 04 24 lea (%r12,%r12,1),%eax : memcpy(data + 1, VARDATA(val), data_length - 1); 0.00 : 47032a: 49 8d 7d 01 lea 0x1(%r13),%rdi 0.00 : 47032e: 48 83 c6 04 add $0x4,%rsi 0.00 : 470332: 4c 89 45 b8 mov %r8,-0x48(%rbp) 0.00 : 470336: 4c 89 4d b0 mov %r9,-0x50(%rbp) : else if (VARLENA_ATT_IS_PACKABLE(att[i]) && : VARATT_CAN_MAKE_SHORT(val)) : { : /* convert to short varlena -- no alignment */ : data_length = VARATT_CONVERTED_SHORT_SIZE(val); : SET_VARSIZE_SHORT(data, data_length); 0.00 : 47033a: 83 c8 01 or $0x1,%eax : memcpy(data + 1, VARDATA(val), data_length - 1); 0.00 : 47033d: 4c 89 55 a8 mov %r10,-0x58(%rbp) 0.00 : 470341: 4c 89 5d a0 mov %r11,-0x60(%rbp) : else if (VARLENA_ATT_IS_PACKABLE(att[i]) && : VARATT_CAN_MAKE_SHORT(val)) : { : /* convert to short varlena -- no alignment */ : data_length = VARATT_CONVERTED_SHORT_SIZE(val); : SET_VARSIZE_SHORT(data, data_length); 0.00 : 470345: 41 88 45 00 mov %al,0x0(%r13) 0.00 : 470349: e9 96 fe ff ff jmpq 4701e4 0.00 : 47034e: 66 90 xchg %ax,%ax : memcpy(data + 1, VARDATA(val), data_length - 1); : } : else : { : /* full 4-byte header varlena */ : data = (char *) att_align_nominal(data, 0.00 : 470350: 49 83 c5 03 add $0x3,%r13 0.00 : 470354: 49 83 e5 fc and $0xfffffffffffffffc,%r13 0.00 : 470358: e9 6e fe ff ff jmpq 4701cb 0.00 : 47035d: 49 83 c5 07 add $0x7,%r13 0.00 : 470361: 49 83 e5 f8 and $0xfffffffffffffff8,%r13 0.00 : 470365: e9 61 fe ff ff jmpq 4701cb Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:43 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:175 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:82 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:82 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:111 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:122 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:195 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:208 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:230 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:230 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b3750 : : */ : TupleTableSlot * : ExecScan(ScanState *node, : ExecScanAccessMtd accessMtd, /* function returning a tuple */ : ExecScanRecheckMtd recheckMtd) : { 0.00 : 5b3750: 55 push %rbp 0.00 : 5b3751: 48 89 e5 mov %rsp,%rbp 0.00 : 5b3754: 41 57 push %r15 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:111 7.14 : 5b3756: 41 56 push %r14 0.00 : 5b3758: 41 55 push %r13 0.00 : 5b375a: 41 54 push %r12 0.00 : 5b375c: 49 89 fc mov %rdi,%r12 0.00 : 5b375f: 53 push %rbx 0.00 : 5b3760: 48 83 ec 28 sub $0x28,%rsp 0.00 : 5b3764: 48 89 75 b8 mov %rsi,-0x48(%rbp) 0.00 : 5b3768: 48 89 55 b0 mov %rdx,-0x50(%rbp) : TupleTableSlot *resultSlot; : : /* : * Fetch data from node : */ : qual = node->ps.qual; 0.00 : 5b376c: 48 8b 47 28 mov 0x28(%rdi),%rax : : /* : * If we have neither a qual to check nor a projection to do, just skip : * all the overhead and return the raw scan tuple. : */ : if (!qual && !projInfo) 0.00 : 5b3770: 48 85 c0 test %rax,%rax : TupleTableSlot *resultSlot; : : /* : * Fetch data from node : */ : qual = node->ps.qual; 0.00 : 5b3773: 48 89 45 c0 mov %rax,-0x40(%rbp) : projInfo = node->ps.ps_ProjInfo; /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:122 7.14 : 5b3777: 4c 8b 77 68 mov 0x68(%rdi),%r14 : econtext = node->ps.ps_ExprContext; 0.00 : 5b377b: 4c 8b 6f 60 mov 0x60(%rdi),%r13 : : /* : * If we have neither a qual to check nor a projection to do, just skip : * all the overhead and return the raw scan tuple. : */ : if (!qual && !projInfo) 0.00 : 5b377f: 41 0f 94 c7 sete %r15b 0.00 : 5b3783: 75 09 jne 5b378e 0.00 : 5b3785: 4d 85 f6 test %r14,%r14 0.00 : 5b3788: 0f 84 d6 01 00 00 je 5b3964 : /* : * Check to see if we're still projecting out tuples from a previous scan : * tuple (because there is a function-returning-set in the projection : * expressions). If so, try to project another one. : */ : if (node->ps.ps_TupFromTlist) 0.00 : 5b378e: 41 80 7c 24 70 00 cmpb $0x0,0x70(%r12) 0.00 : 5b3794: 0f 85 a6 01 00 00 jne 5b3940 0.00 : 5b379a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : /* : * Reset per-tuple memory context to free any expression evaluation : * storage allocated in the previous tuple cycle. Note this can't happen : * until we're done projecting out tuples from a scan tuple. : */ : ResetExprContext(econtext); 0.00 : 5b37a0: 49 8b 7d 28 mov 0x28(%r13),%rdi 0.00 : 5b37a4: e8 07 52 1e 00 callq 7989b0 : */ : for (;;) : { : TupleTableSlot *slot; : : CHECK_FOR_INTERRUPTS(); 0.00 : 5b37a9: 0f b6 05 e0 68 60 00 movzbl 0x6068e0(%rip),%eax # bba090 0.00 : 5b37b0: 84 c0 test %al,%al 0.00 : 5b37b2: 0f 85 50 01 00 00 jne 5b3908 : static inline TupleTableSlot * : ExecScanFetch(ScanState *node, : ExecScanAccessMtd accessMtd, : ExecScanRecheckMtd recheckMtd) : { : EState *estate = node->ps.state; 0.00 : 5b37b8: 49 8b 54 24 10 mov 0x10(%r12),%rdx : : if (estate->es_epqTuple != NULL) 0.00 : 5b37bd: 48 83 ba d0 00 00 00 cmpq $0x0,0xd0(%rdx) 0.00 : 5b37c4: 00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:43 14.29 : 5b37c5: 0f 84 0d 01 00 00 je 5b38d8 : * conditions. : */ : Index scanrelid = ((Scan *) node->ps.plan)->scanrelid; : : Assert(scanrelid > 0); : if (estate->es_epqTupleSet[scanrelid - 1]) 0.00 : 5b37cb: 49 8b 44 24 08 mov 0x8(%r12),%rax 0.00 : 5b37d0: 8b 40 60 mov 0x60(%rax),%eax 0.00 : 5b37d3: 8d 48 ff lea -0x1(%rax),%ecx 0.00 : 5b37d6: 48 8b 82 d8 00 00 00 mov 0xd8(%rdx),%rax 0.00 : 5b37dd: 80 3c 08 00 cmpb $0x0,(%rax,%rcx,1) 0.00 : 5b37e1: 0f 84 f1 00 00 00 je 5b38d8 : { : TupleTableSlot *slot = node->ss_ScanTupleSlot; : : /* Return empty slot if we already returned a tuple */ : if (estate->es_epqScanDone[scanrelid - 1]) 0.00 : 5b37e7: 48 89 c8 mov %rcx,%rax 0.00 : 5b37ea: 48 03 82 e0 00 00 00 add 0xe0(%rdx),%rax : Index scanrelid = ((Scan *) node->ps.plan)->scanrelid; : : Assert(scanrelid > 0); : if (estate->es_epqTupleSet[scanrelid - 1]) : { : TupleTableSlot *slot = node->ss_ScanTupleSlot; 0.00 : 5b37f1: 49 8b 9c 24 88 00 00 mov 0x88(%r12),%rbx 0.00 : 5b37f8: 00 : : /* Return empty slot if we already returned a tuple */ : if (estate->es_epqScanDone[scanrelid - 1]) 0.00 : 5b37f9: 80 38 00 cmpb $0x0,(%rax) 0.00 : 5b37fc: 0f 85 16 01 00 00 jne 5b3918 : return ExecClearTuple(slot); : /* Else mark to remember that we shouldn't return more */ : estate->es_epqScanDone[scanrelid - 1] = true; 0.00 : 5b3802: c6 00 01 movb $0x1,(%rax) : : /* Return empty slot if we haven't got a test tuple */ : if (estate->es_epqTuple[scanrelid - 1] == NULL) 0.00 : 5b3805: 48 8b 82 d0 00 00 00 mov 0xd0(%rdx),%rax 0.00 : 5b380c: 48 8b 3c c8 mov (%rax,%rcx,8),%rdi 0.00 : 5b3810: 48 85 ff test %rdi,%rdi 0.00 : 5b3813: 0f 84 ff 00 00 00 je 5b3918 : return ExecClearTuple(slot); : : /* Store test tuple in the plan node's scan slot */ : ExecStoreTuple(estate->es_epqTuple[scanrelid - 1], 0.00 : 5b3819: 31 c9 xor %ecx,%ecx 0.00 : 5b381b: 31 d2 xor %edx,%edx 0.00 : 5b381d: 48 89 de mov %rbx,%rsi 0.00 : 5b3820: e8 5b 0c 00 00 callq 5b4480 : slot, InvalidBuffer, false); : : /* Check if it meets the access-method conditions */ : if (!(*recheckMtd) (node, slot)) 0.00 : 5b3825: 48 89 de mov %rbx,%rsi 0.00 : 5b3828: 4c 89 e7 mov %r12,%rdi 0.00 : 5b382b: ff 55 b0 callq *-0x50(%rbp) 0.00 : 5b382e: 84 c0 test %al,%al 0.00 : 5b3830: 0f 84 fa 00 00 00 je 5b3930 : * if the slot returned by the accessMtd contains NULL, then it means : * there is nothing more to scan so we just return an empty slot, : * being careful to use the projection result slot so it has correct : * tupleDesc. : */ : if (TupIsNull(slot)) 0.00 : 5b3836: 48 85 db test %rbx,%rbx 0.00 : 5b3839: 0f 84 ab 00 00 00 je 5b38ea /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:175 14.29 : 5b383f: 80 7b 04 00 cmpb $0x0,0x4(%rbx) 0.00 : 5b3843: 0f 85 a1 00 00 00 jne 5b38ea : * : * check for non-nil qual here to avoid a function call to ExecQual() : * when the qual is nil ... saves only a few cycles, but they add up : * ... : */ : if (!qual || ExecQual(qual, econtext, false)) 0.00 : 5b3849: 45 84 ff test %r15b,%r15b : } : : /* : * place the current tuple into the expr context : */ : econtext->ecxt_scantuple = slot; 0.00 : 5b384c: 49 89 5d 08 mov %rbx,0x8(%r13) : * : * check for non-nil qual here to avoid a function call to ExecQual() : * when the qual is nil ... saves only a few cycles, but they add up : * ... : */ : if (!qual || ExecQual(qual, econtext, false)) /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:195 7.14 : 5b3850: 75 3e jne 5b3890 0.00 : 5b3852: 48 8b 7d c0 mov -0x40(%rbp),%rdi 0.00 : 5b3856: 31 d2 xor %edx,%edx 0.00 : 5b3858: 4c 89 ee mov %r13,%rsi 0.00 : 5b385b: e8 b0 96 ff ff callq 5acf10 0.00 : 5b3860: 84 c0 test %al,%al 0.00 : 5b3862: 75 2c jne 5b3890 : */ : return slot; : } : } : else : InstrCountFiltered1(node, 1); 0.00 : 5b3864: 49 8b 44 24 18 mov 0x18(%r12),%rax 0.00 : 5b3869: 48 85 c0 test %rax,%rax 0.00 : 5b386c: 0f 84 2e ff ff ff je 5b37a0 0.00 : 5b3872: f2 0f 10 05 de b8 1f movsd 0x1fb8de(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 5b3879: 00 0.00 : 5b387a: f2 0f 58 80 c8 00 00 addsd 0xc8(%rax),%xmm0 0.00 : 5b3881: 00 0.00 : 5b3882: f2 0f 11 80 c8 00 00 movsd %xmm0,0xc8(%rax) 0.00 : 5b3889: 00 0.00 : 5b388a: e9 11 ff ff ff jmpq 5b37a0 0.00 : 5b388f: 90 nop : if (!qual || ExecQual(qual, econtext, false)) : { : /* : * Found a satisfactory scan tuple. : */ : if (projInfo) 0.00 : 5b3890: 4d 85 f6 test %r14,%r14 0.00 : 5b3893: 74 2b je 5b38c0 : /* : * Form a projection tuple, store it in the result tuple slot : * and return it --- unless we find we can project no tuples : * from this scan tuple, in which case continue scan. : */ : resultSlot = ExecProject(projInfo, &isDone); 0.00 : 5b3895: 48 8d 75 d4 lea -0x2c(%rbp),%rsi 0.00 : 5b3899: 4c 89 f7 mov %r14,%rdi 0.00 : 5b389c: e8 5f 97 ff ff callq 5ad000 0.00 : 5b38a1: 48 89 c3 mov %rax,%rbx : if (isDone != ExprEndResult) /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:208 7.14 : 5b38a4: 8b 45 d4 mov -0x2c(%rbp),%eax 0.00 : 5b38a7: 83 f8 02 cmp $0x2,%eax 0.00 : 5b38aa: 0f 84 f0 fe ff ff je 5b37a0 : { : node->ps.ps_TupFromTlist = (isDone == ExprMultipleResult); 0.00 : 5b38b0: 83 e8 01 sub $0x1,%eax 0.00 : 5b38b3: 41 0f 94 44 24 70 sete 0x70(%r12) 0.00 : 5b38b9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : /* : * Tuple fails qual, so free per-tuple memory and try again. : */ : ResetExprContext(econtext); : } : } 0.00 : 5b38c0: 48 83 c4 28 add $0x28,%rsp 0.00 : 5b38c4: 48 89 d8 mov %rbx,%rax 0.00 : 5b38c7: 5b pop %rbx 0.00 : 5b38c8: 41 5c pop %r12 0.00 : 5b38ca: 41 5d pop %r13 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:230 7.14 : 5b38cc: 41 5e pop %r14 0.00 : 5b38ce: 41 5f pop %r15 0.00 : 5b38d0: c9 leaveq 7.14 : 5b38d1: c3 retq 0.00 : 5b38d2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : } : : /* : * Run the node-type-specific access method function to get the next tuple : */ : return (*accessMtd) (node); 0.00 : 5b38d8: 4c 89 e7 mov %r12,%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:82 14.29 : 5b38db: ff 55 b8 callq *-0x48(%rbp) 14.29 : 5b38de: 48 89 c3 mov %rax,%rbx : * if the slot returned by the accessMtd contains NULL, then it means : * there is nothing more to scan so we just return an empty slot, : * being careful to use the projection result slot so it has correct : * tupleDesc. : */ : if (TupIsNull(slot)) 0.00 : 5b38e1: 48 85 db test %rbx,%rbx 0.00 : 5b38e4: 0f 85 55 ff ff ff jne 5b383f : { : if (projInfo) 0.00 : 5b38ea: 4d 85 f6 test %r14,%r14 0.00 : 5b38ed: 0f 1f 00 nopl (%rax) 0.00 : 5b38f0: 74 ce je 5b38c0 : return ExecClearTuple(projInfo->pi_slot); 0.00 : 5b38f2: 49 8b 7e 18 mov 0x18(%r14),%rdi 0.00 : 5b38f6: e8 15 08 00 00 callq 5b4110 0.00 : 5b38fb: 48 89 c3 mov %rax,%rbx 0.00 : 5b38fe: 66 90 xchg %ax,%ax : /* : * Tuple fails qual, so free per-tuple memory and try again. : */ : ResetExprContext(econtext); : } : } 0.00 : 5b3900: eb be jmp 5b38c0 0.00 : 5b3902: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : */ : for (;;) : { : TupleTableSlot *slot; : : CHECK_FOR_INTERRUPTS(); 0.00 : 5b3908: e8 93 89 0e 00 callq 69c2a0 0.00 : 5b390d: 0f 1f 00 nopl (%rax) 0.00 : 5b3910: e9 a3 fe ff ff jmpq 5b37b8 0.00 : 5b3915: 0f 1f 00 nopl (%rax) : /* Else mark to remember that we shouldn't return more */ : estate->es_epqScanDone[scanrelid - 1] = true; : : /* Return empty slot if we haven't got a test tuple */ : if (estate->es_epqTuple[scanrelid - 1] == NULL) : return ExecClearTuple(slot); 0.00 : 5b3918: 48 89 df mov %rbx,%rdi 0.00 : 5b391b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5b3920: e8 eb 07 00 00 callq 5b4110 0.00 : 5b3925: 48 89 c3 mov %rax,%rbx 0.00 : 5b3928: e9 09 ff ff ff jmpq 5b3836 0.00 : 5b392d: 0f 1f 00 nopl (%rax) : ExecStoreTuple(estate->es_epqTuple[scanrelid - 1], : slot, InvalidBuffer, false); : : /* Check if it meets the access-method conditions */ : if (!(*recheckMtd) (node, slot)) : ExecClearTuple(slot); /* would not be returned by scan */ 0.00 : 5b3930: 48 89 df mov %rbx,%rdi 0.00 : 5b3933: e8 d8 07 00 00 callq 5b4110 0.00 : 5b3938: e9 f9 fe ff ff jmpq 5b3836 0.00 : 5b393d: 0f 1f 00 nopl (%rax) : * expressions). If so, try to project another one. : */ : if (node->ps.ps_TupFromTlist) : { : Assert(projInfo); /* can't get here if not projecting */ : resultSlot = ExecProject(projInfo, &isDone); 0.00 : 5b3940: 48 8d 75 d4 lea -0x2c(%rbp),%rsi 0.00 : 5b3944: 4c 89 f7 mov %r14,%rdi 0.00 : 5b3947: e8 b4 96 ff ff callq 5ad000 : if (isDone == ExprMultipleResult) 0.00 : 5b394c: 83 7d d4 01 cmpl $0x1,-0x2c(%rbp) : * expressions). If so, try to project another one. : */ : if (node->ps.ps_TupFromTlist) : { : Assert(projInfo); /* can't get here if not projecting */ : resultSlot = ExecProject(projInfo, &isDone); 0.00 : 5b3950: 48 89 c3 mov %rax,%rbx : if (isDone == ExprMultipleResult) 0.00 : 5b3953: 0f 84 67 ff ff ff je 5b38c0 : return resultSlot; : /* Done with that source tuple... */ : node->ps.ps_TupFromTlist = false; 0.00 : 5b3959: 41 c6 44 24 70 00 movb $0x0,0x70(%r12) 0.00 : 5b395f: e9 3c fe ff ff jmpq 5b37a0 : * If we have neither a qual to check nor a projection to do, just skip : * all the overhead and return the raw scan tuple. : */ : if (!qual && !projInfo) : { : ResetExprContext(econtext); 0.00 : 5b3964: 49 8b 7d 28 mov 0x28(%r13),%rdi 0.00 : 5b3968: e8 43 50 1e 00 callq 7989b0 : static inline TupleTableSlot * : ExecScanFetch(ScanState *node, : ExecScanAccessMtd accessMtd, : ExecScanRecheckMtd recheckMtd) : { : EState *estate = node->ps.state; 0.00 : 5b396d: 49 8b 54 24 10 mov 0x10(%r12),%rdx : : if (estate->es_epqTuple != NULL) 0.00 : 5b3972: 48 83 ba d0 00 00 00 cmpq $0x0,0xd0(%rdx) 0.00 : 5b3979: 00 0.00 : 5b397a: 74 74 je 5b39f0 : * conditions. : */ : Index scanrelid = ((Scan *) node->ps.plan)->scanrelid; : : Assert(scanrelid > 0); : if (estate->es_epqTupleSet[scanrelid - 1]) 0.00 : 5b397c: 49 8b 44 24 08 mov 0x8(%r12),%rax 0.00 : 5b3981: 8b 40 60 mov 0x60(%rax),%eax 0.00 : 5b3984: 8d 48 ff lea -0x1(%rax),%ecx 0.00 : 5b3987: 48 8b 82 d8 00 00 00 mov 0xd8(%rdx),%rax 0.00 : 5b398e: 80 3c 08 00 cmpb $0x0,(%rax,%rcx,1) 0.00 : 5b3992: 74 5c je 5b39f0 : { : TupleTableSlot *slot = node->ss_ScanTupleSlot; : : /* Return empty slot if we already returned a tuple */ : if (estate->es_epqScanDone[scanrelid - 1]) 0.00 : 5b3994: 48 89 c8 mov %rcx,%rax 0.00 : 5b3997: 48 03 82 e0 00 00 00 add 0xe0(%rdx),%rax : Index scanrelid = ((Scan *) node->ps.plan)->scanrelid; : : Assert(scanrelid > 0); : if (estate->es_epqTupleSet[scanrelid - 1]) : { : TupleTableSlot *slot = node->ss_ScanTupleSlot; 0.00 : 5b399e: 49 8b 9c 24 88 00 00 mov 0x88(%r12),%rbx 0.00 : 5b39a5: 00 : : /* Return empty slot if we already returned a tuple */ : if (estate->es_epqScanDone[scanrelid - 1]) 0.00 : 5b39a6: 80 38 00 cmpb $0x0,(%rax) 0.00 : 5b39a9: 75 5a jne 5b3a05 : return ExecClearTuple(slot); : /* Else mark to remember that we shouldn't return more */ : estate->es_epqScanDone[scanrelid - 1] = true; 0.00 : 5b39ab: c6 00 01 movb $0x1,(%rax) : : /* Return empty slot if we haven't got a test tuple */ : if (estate->es_epqTuple[scanrelid - 1] == NULL) 0.00 : 5b39ae: 48 8b 82 d0 00 00 00 mov 0xd0(%rdx),%rax 0.00 : 5b39b5: 48 8b 3c c8 mov (%rax,%rcx,8),%rdi 0.00 : 5b39b9: 48 85 ff test %rdi,%rdi 0.00 : 5b39bc: 74 47 je 5b3a05 : return ExecClearTuple(slot); : : /* Store test tuple in the plan node's scan slot */ : ExecStoreTuple(estate->es_epqTuple[scanrelid - 1], 0.00 : 5b39be: 31 c9 xor %ecx,%ecx 0.00 : 5b39c0: 31 d2 xor %edx,%edx 0.00 : 5b39c2: 48 89 de mov %rbx,%rsi 0.00 : 5b39c5: e8 b6 0a 00 00 callq 5b4480 : slot, InvalidBuffer, false); : : /* Check if it meets the access-method conditions */ : if (!(*recheckMtd) (node, slot)) 0.00 : 5b39ca: 48 89 de mov %rbx,%rsi 0.00 : 5b39cd: 4c 89 e7 mov %r12,%rdi 0.00 : 5b39d0: ff 55 b0 callq *-0x50(%rbp) 0.00 : 5b39d3: 84 c0 test %al,%al 0.00 : 5b39d5: 0f 85 e5 fe ff ff jne 5b38c0 : ExecClearTuple(slot); /* would not be returned by scan */ 0.00 : 5b39db: 48 89 df mov %rbx,%rdi 0.00 : 5b39de: e8 2d 07 00 00 callq 5b4110 0.00 : 5b39e3: e9 d8 fe ff ff jmpq 5b38c0 0.00 : 5b39e8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5b39ef: 00 : } : : /* : * Run the node-type-specific access method function to get the next tuple : */ : return (*accessMtd) (node); 0.00 : 5b39f0: 4c 89 e7 mov %r12,%rdi 0.00 : 5b39f3: ff 55 b8 callq *-0x48(%rbp) 0.00 : 5b39f6: 48 89 c3 mov %rax,%rbx 0.00 : 5b39f9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 5b3a00: e9 bb fe ff ff jmpq 5b38c0 : /* Else mark to remember that we shouldn't return more */ : estate->es_epqScanDone[scanrelid - 1] = true; : : /* Return empty slot if we haven't got a test tuple */ : if (estate->es_epqTuple[scanrelid - 1] == NULL) : return ExecClearTuple(slot); 0.00 : 5b3a05: 48 89 df mov %rbx,%rdi 0.00 : 5b3a08: e8 03 07 00 00 callq 5b4110 0.00 : 5b3a0d: 48 89 c3 mov %rax,%rbx 0.00 : 5b3a10: e9 ab fe ff ff jmpq 5b38c0 Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 53.85 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:109 15.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:116 15.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:126 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:109 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:115 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bd030 : : * than one batch is required. : * ---------------------------------------------------------------- : */ : Node * : MultiExecHash(HashState *node) : { 0.00 : 5bd030: 55 push %rbp 0.00 : 5bd031: 48 89 e5 mov %rsp,%rbp 0.00 : 5bd034: 41 57 push %r15 0.00 : 5bd036: 41 56 push %r14 0.00 : 5bd038: 41 55 push %r13 0.00 : 5bd03a: 41 54 push %r12 0.00 : 5bd03c: 53 push %rbx 0.00 : 5bd03d: 48 83 ec 58 sub $0x58,%rsp 0.00 : 5bd041: 48 89 7d 80 mov %rdi,-0x80(%rbp) : TupleTableSlot *slot; : ExprContext *econtext; : uint32 hashvalue; : : /* must provide our own instrumentation support */ : if (node->ps.instrument) 0.00 : 5bd045: 48 8b 7f 18 mov 0x18(%rdi),%rdi 0.00 : 5bd049: 48 85 ff test %rdi,%rdi 0.00 : 5bd04c: 74 05 je 5bd053 : InstrStartNode(node->ps.instrument); 0.00 : 5bd04e: e8 ad ae ff ff callq 5b7f00 : : /* : * get state info from node : */ : outerNode = outerPlanState(node); 0.00 : 5bd053: 48 8b 55 80 mov -0x80(%rbp),%rdx : hashtable = node->hashtable; 0.00 : 5bd057: 48 8b 45 80 mov -0x80(%rbp),%rax : InstrStartNode(node->ps.instrument); : : /* : * get state info from node : */ : outerNode = outerPlanState(node); 0.00 : 5bd05b: 48 8b 52 30 mov 0x30(%rdx),%rdx 0.00 : 5bd05f: 48 89 55 88 mov %rdx,-0x78(%rbp) : hashtable = node->hashtable; : : /* : * set expression context : */ : hashkeys = node->hashkeys; 0.00 : 5bd063: 48 8b 90 80 00 00 00 mov 0x80(%rax),%rdx : : /* : * get state info from node : */ : outerNode = outerPlanState(node); : hashtable = node->hashtable; 0.00 : 5bd06a: 4c 8b 78 78 mov 0x78(%rax),%r15 : : /* : * set expression context : */ : hashkeys = node->hashkeys; 0.00 : 5bd06e: 48 89 55 90 mov %rdx,-0x70(%rbp) : econtext = node->ps.ps_ExprContext; 0.00 : 5bd072: 48 8b 40 60 mov 0x60(%rax),%rax 0.00 : 5bd076: 48 89 45 98 mov %rax,-0x68(%rbp) 0.00 : 5bd07a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : /* : * get all inner tuples and insert into the hash table (or temp files) : */ : for (;;) : { : slot = ExecProcNode(outerNode); 0.00 : 5bd080: 48 8b 7d 88 mov -0x78(%rbp),%rdi 0.00 : 5bd084: e8 17 f4 fe ff callq 5ac4a0 : if (TupIsNull(slot)) 0.00 : 5bd089: 48 85 c0 test %rax,%rax : /* : * get all inner tuples and insert into the hash table (or temp files) : */ : for (;;) : { : slot = ExecProcNode(outerNode); 0.00 : 5bd08c: 49 89 c4 mov %rax,%r12 : if (TupIsNull(slot)) 0.00 : 5bd08f: 0f 84 9e 02 00 00 je 5bd333 0.00 : 5bd095: 80 78 04 00 cmpb $0x0,0x4(%rax) 0.00 : 5bd099: 0f 85 94 02 00 00 jne 5bd333 : break; : /* We have to compute the hash value */ : econtext->ecxt_innertuple = slot; 0.00 : 5bd09f: 48 8b 55 98 mov -0x68(%rbp),%rdx : if (ExecHashGetHashValue(hashtable, econtext, hashkeys, /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:109 7.69 : 5bd0a3: 4c 8d 4d d4 lea -0x2c(%rbp),%r9 0.00 : 5bd0a7: 31 c9 xor %ecx,%ecx 0.00 : 5bd0a9: 4c 89 ff mov %r15,%rdi : { : slot = ExecProcNode(outerNode); : if (TupIsNull(slot)) : break; : /* We have to compute the hash value */ : econtext->ecxt_innertuple = slot; 0.00 : 5bd0ac: 48 89 42 10 mov %rax,0x10(%rdx) : if (ExecHashGetHashValue(hashtable, econtext, hashkeys, 53.85 : 5bd0b0: 45 0f be 47 20 movsbl 0x20(%r15),%r8d 0.00 : 5bd0b5: 48 8b 55 90 mov -0x70(%rbp),%rdx 0.00 : 5bd0b9: 48 8b 75 98 mov -0x68(%rbp),%rsi 0.00 : 5bd0bd: e8 ce ed ff ff callq 5bbe90 0.00 : 5bd0c2: 84 c0 test %al,%al 0.00 : 5bd0c4: 74 ba je 5bd080 : false, hashtable->keepNulls, : &hashvalue)) : { : int bucketNumber; : : bucketNumber = ExecHashGetSkewBucket(hashtable, hashvalue); 0.00 : 5bd0c6: 8b 75 d4 mov -0x2c(%rbp),%esi 0.00 : 5bd0c9: 4c 89 ff mov %r15,%rdi 0.00 : 5bd0cc: e8 df ea ff ff callq 5bbbb0 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:115 7.69 : 5bd0d1: 89 45 a0 mov %eax,-0x60(%rbp) : if (bucketNumber != INVALID_SKEW_BUCKET_NO) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:116 15.38 : 5bd0d4: 83 c0 01 add $0x1,%eax 0.00 : 5bd0d7: 0f 84 b0 02 00 00 je 5bd38d : ExecHashSkewTableInsert(HashJoinTable hashtable, : TupleTableSlot *slot, : uint32 hashvalue, : int bucketNumber) : { : MinimalTuple tuple = ExecFetchSlotMinimalTuple(slot); 0.00 : 5bd0dd: 4c 89 e7 mov %r12,%rdi : : bucketNumber = ExecHashGetSkewBucket(hashtable, hashvalue); : if (bucketNumber != INVALID_SKEW_BUCKET_NO) : { : /* It's a skew tuple, so put it into that hash table */ : ExecHashSkewTableInsert(hashtable, slot, hashvalue, 0.00 : 5bd0e0: 8b 5d d4 mov -0x2c(%rbp),%ebx : ExecHashSkewTableInsert(HashJoinTable hashtable, : TupleTableSlot *slot, : uint32 hashvalue, : int bucketNumber) : { : MinimalTuple tuple = ExecFetchSlotMinimalTuple(slot); 0.00 : 5bd0e3: e8 68 6e ff ff callq 5b3f50 : HashJoinTuple hashTuple; : int hashTupleSize; : : /* Create the HashJoinTuple */ : hashTupleSize = HJTUPLE_OVERHEAD + tuple->t_len; : hashTuple = (HashJoinTuple) MemoryContextAlloc(hashtable->batchCxt, 0.00 : 5bd0e8: 44 8b 20 mov (%rax),%r12d 0.00 : 5bd0eb: 49 8b bf c0 00 00 00 mov 0xc0(%r15),%rdi : ExecHashSkewTableInsert(HashJoinTable hashtable, : TupleTableSlot *slot, : uint32 hashvalue, : int bucketNumber) : { : MinimalTuple tuple = ExecFetchSlotMinimalTuple(slot); 0.00 : 5bd0f2: 49 89 c6 mov %rax,%r14 : HashJoinTuple hashTuple; : int hashTupleSize; : : /* Create the HashJoinTuple */ : hashTupleSize = HJTUPLE_OVERHEAD + tuple->t_len; : hashTuple = (HashJoinTuple) MemoryContextAlloc(hashtable->batchCxt, 0.00 : 5bd0f5: 41 83 c4 10 add $0x10,%r12d 0.00 : 5bd0f9: 4d 63 e4 movslq %r12d,%r12 0.00 : 5bd0fc: 4c 89 e6 mov %r12,%rsi 0.00 : 5bd0ff: e8 8c bd 1d 00 callq 798e90 : hashTupleSize); : hashTuple->hashvalue = hashvalue; 0.00 : 5bd104: 89 58 08 mov %ebx,0x8(%rax) : memcpy(HJTUPLE_MINTUPLE(hashTuple), tuple, tuple->t_len); 0.00 : 5bd107: 41 8b 16 mov (%r14),%edx 0.00 : 5bd10a: 48 8d 58 10 lea 0x10(%rax),%rbx 0.00 : 5bd10e: 4c 89 f6 mov %r14,%rsi : HashJoinTuple hashTuple; : int hashTupleSize; : : /* Create the HashJoinTuple */ : hashTupleSize = HJTUPLE_OVERHEAD + tuple->t_len; : hashTuple = (HashJoinTuple) MemoryContextAlloc(hashtable->batchCxt, 0.00 : 5bd111: 49 89 c5 mov %rax,%r13 : hashTupleSize); : hashTuple->hashvalue = hashvalue; : memcpy(HJTUPLE_MINTUPLE(hashTuple), tuple, tuple->t_len); 0.00 : 5bd114: 48 89 df mov %rbx,%rdi 0.00 : 5bd117: e8 d4 ca ea ff callq 469bf0 : HeapTupleHeaderClearMatch(HJTUPLE_MINTUPLE(hashTuple)); 0.00 : 5bd11c: 66 81 63 0a ff 7f andw $0x7fff,0xa(%rbx) : : /* Push it onto the front of the skew bucket's list */ : hashTuple->next = hashtable->skewBucket[bucketNumber]->tuples; 0.00 : 5bd122: 48 63 55 a0 movslq -0x60(%rbp),%rdx 0.00 : 5bd126: 49 8b 47 28 mov 0x28(%r15),%rax 0.00 : 5bd12a: 48 8b 04 d0 mov (%rax,%rdx,8),%rax 0.00 : 5bd12e: 48 8b 40 08 mov 0x8(%rax),%rax 0.00 : 5bd132: 49 89 45 00 mov %rax,0x0(%r13) : hashtable->skewBucket[bucketNumber]->tuples = hashTuple; 0.00 : 5bd136: 49 8b 47 28 mov 0x28(%r15),%rax 0.00 : 5bd13a: 48 8b 04 d0 mov (%rax,%rdx,8),%rax 0.00 : 5bd13e: 4c 89 68 08 mov %r13,0x8(%rax) : : /* Account for space used, and back off if we've used too much */ : hashtable->spaceUsed += hashTupleSize; 0.00 : 5bd142: 4d 01 a7 90 00 00 00 add %r12,0x90(%r15) : hashtable->spaceUsedSkew += hashTupleSize; 0.00 : 5bd149: 4d 01 a7 a8 00 00 00 add %r12,0xa8(%r15) : if (hashtable->spaceUsed > hashtable->spacePeak) 0.00 : 5bd150: 49 8b 87 90 00 00 00 mov 0x90(%r15),%rax 0.00 : 5bd157: 49 3b 87 a0 00 00 00 cmp 0xa0(%r15),%rax 0.00 : 5bd15e: 76 10 jbe 5bd170 : hashtable->spacePeak = hashtable->spaceUsed; 0.00 : 5bd160: 49 89 87 a0 00 00 00 mov %rax,0xa0(%r15) 0.00 : 5bd167: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5bd16e: 00 00 : while (hashtable->spaceUsedSkew > hashtable->spaceAllowedSkew) 0.00 : 5bd170: 49 8b 87 b0 00 00 00 mov 0xb0(%r15),%rax 0.00 : 5bd177: 49 39 87 a8 00 00 00 cmp %rax,0xa8(%r15) 0.00 : 5bd17e: 0f 86 72 01 00 00 jbe 5bd2f6 : int batchno; : HashJoinTuple hashTuple; : : /* Locate the bucket to remove */ : bucketToRemove = hashtable->skewBucketNums[hashtable->nSkewBuckets - 1]; : bucket = hashtable->skewBucket[bucketToRemove]; 0.00 : 5bd184: 49 63 47 34 movslq 0x34(%r15),%rax 0.00 : 5bd188: 49 8b 57 38 mov 0x38(%r15),%rdx 0.00 : 5bd18c: 48 63 44 82 fc movslq -0x4(%rdx,%rax,4),%rax 0.00 : 5bd191: 48 c1 e0 03 shl $0x3,%rax 0.00 : 5bd195: 48 89 45 c0 mov %rax,-0x40(%rbp) 0.00 : 5bd199: 48 89 c6 mov %rax,%rsi 0.00 : 5bd19c: 49 03 77 28 add 0x28(%r15),%rsi 0.00 : 5bd1a0: 48 8b 06 mov (%rsi),%rax 0.00 : 5bd1a3: 48 89 45 a8 mov %rax,-0x58(%rbp) : * Calculate which bucket and batch the tuples belong to in the main : * hashtable. They all have the same hash value, so it's the same for all : * of them. Also note that it's not possible for nbatch to increase while : * we are processing the tuples. : */ : hashvalue = bucket->hashvalue; 0.00 : 5bd1a7: 8b 10 mov (%rax),%edx 0.00 : 5bd1a9: 89 55 a4 mov %edx,-0x5c(%rbp) : uint32 hashvalue, : int *bucketno, : int *batchno) : { : uint32 nbuckets = (uint32) hashtable->nbuckets; : uint32 nbatch = (uint32) hashtable->nbatch; 0.00 : 5bd1ac: 41 8b 47 40 mov 0x40(%r15),%eax : ExecHashGetBucketAndBatch(HashJoinTable hashtable, : uint32 hashvalue, : int *bucketno, : int *batchno) : { : uint32 nbuckets = (uint32) hashtable->nbuckets; 0.00 : 5bd1b0: 41 8b 17 mov (%r15),%edx : uint32 nbatch = (uint32) hashtable->nbatch; : : if (nbatch > 1) 0.00 : 5bd1b3: 83 f8 01 cmp $0x1,%eax 0.00 : 5bd1b6: 0f 86 2c 01 00 00 jbe 5bd2e8 : { : /* we can do MOD by masking, DIV by shifting */ : *bucketno = hashvalue & (nbuckets - 1); : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); 0.00 : 5bd1bc: 44 8d 70 ff lea -0x1(%rax),%r14d 0.00 : 5bd1c0: 41 8b 4f 04 mov 0x4(%r15),%ecx 0.00 : 5bd1c4: 8b 45 a4 mov -0x5c(%rbp),%eax : uint32 nbatch = (uint32) hashtable->nbatch; : : if (nbatch > 1) : { : /* we can do MOD by masking, DIV by shifting */ : *bucketno = hashvalue & (nbuckets - 1); 0.00 : 5bd1c7: 83 ea 01 sub $0x1,%edx 0.00 : 5bd1ca: 23 55 a4 and -0x5c(%rbp),%edx : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); 0.00 : 5bd1cd: d3 e8 shr %cl,%eax 0.00 : 5bd1cf: 41 21 c6 and %eax,%r14d : */ : hashvalue = bucket->hashvalue; : ExecHashGetBucketAndBatch(hashtable, hashvalue, &bucketno, &batchno); : : /* Process all tuples in the bucket */ : hashTuple = bucket->tuples; 0.00 : 5bd1d2: 48 8b 45 a8 mov -0x58(%rbp),%rax 0.00 : 5bd1d6: 48 8b 58 08 mov 0x8(%rax),%rbx : while (hashTuple != NULL) 0.00 : 5bd1da: 48 85 db test %rbx,%rbx 0.00 : 5bd1dd: 0f 84 8a 00 00 00 je 5bd26d : : /* Decide whether to put the tuple in the hash table or a temp file */ : if (batchno == hashtable->curbatch) : { : /* Move the tuple to the main hash table */ : hashTuple->next = hashtable->buckets[bucketno]; 0.00 : 5bd1e3: 48 63 c2 movslq %edx,%rax 0.00 : 5bd1e6: 48 c1 e0 03 shl $0x3,%rax 0.00 : 5bd1ea: 48 89 45 b8 mov %rax,-0x48(%rbp) : } : else : { : /* Put the tuple into a temp file for later batches */ : Assert(batchno > hashtable->curbatch); : ExecHashJoinSaveTuple(tuple, hashvalue, 0.00 : 5bd1ee: 49 63 c6 movslq %r14d,%rax 0.00 : 5bd1f1: 48 c1 e0 03 shl $0x3,%rax 0.00 : 5bd1f5: 48 89 45 b0 mov %rax,-0x50(%rbp) 0.00 : 5bd1f9: eb 2b jmp 5bd226 0.00 : 5bd1fb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : : /* Decide whether to put the tuple in the hash table or a temp file */ : if (batchno == hashtable->curbatch) : { : /* Move the tuple to the main hash table */ : hashTuple->next = hashtable->buckets[bucketno]; 0.00 : 5bd200: 48 8b 55 b8 mov -0x48(%rbp),%rdx 0.00 : 5bd204: 49 8b 47 18 mov 0x18(%r15),%rax 0.00 : 5bd208: 48 8b 04 10 mov (%rax,%rdx,1),%rax 0.00 : 5bd20c: 48 89 03 mov %rax,(%rbx) : hashtable->buckets[bucketno] = hashTuple; 0.00 : 5bd20f: 49 8b 47 18 mov 0x18(%r15),%rax 0.00 : 5bd213: 48 89 1c 10 mov %rbx,(%rax,%rdx,1) : /* We have reduced skew space, but overall space doesn't change */ : hashtable->spaceUsedSkew -= tupleSize; 0.00 : 5bd217: 4d 29 a7 a8 00 00 00 sub %r12,0xa8(%r15) : hashvalue = bucket->hashvalue; : ExecHashGetBucketAndBatch(hashtable, hashvalue, &bucketno, &batchno); : : /* Process all tuples in the bucket */ : hashTuple = bucket->tuples; : while (hashTuple != NULL) 0.00 : 5bd21e: 4d 85 ed test %r13,%r13 0.00 : 5bd221: 74 42 je 5bd265 0.00 : 5bd223: 4c 89 eb mov %r13,%rbx : * This code must agree with ExecHashTableInsert. We do not use : * ExecHashTableInsert directly as ExecHashTableInsert expects a : * TupleTableSlot while we already have HashJoinTuples. : */ : tuple = HJTUPLE_MINTUPLE(hashTuple); : tupleSize = HJTUPLE_OVERHEAD + tuple->t_len; 0.00 : 5bd226: 8b 43 10 mov 0x10(%rbx),%eax : : /* Decide whether to put the tuple in the hash table or a temp file */ : if (batchno == hashtable->curbatch) 0.00 : 5bd229: 45 39 77 44 cmp %r14d,0x44(%r15) : /* : * This code must agree with ExecHashTableInsert. We do not use : * ExecHashTableInsert directly as ExecHashTableInsert expects a : * TupleTableSlot while we already have HashJoinTuples. : */ : tuple = HJTUPLE_MINTUPLE(hashTuple); 0.00 : 5bd22d: 48 8d 7b 10 lea 0x10(%rbx),%rdi : : /* Process all tuples in the bucket */ : hashTuple = bucket->tuples; : while (hashTuple != NULL) : { : HashJoinTuple nextHashTuple = hashTuple->next; 0.00 : 5bd231: 4c 8b 2b mov (%rbx),%r13 : * This code must agree with ExecHashTableInsert. We do not use : * ExecHashTableInsert directly as ExecHashTableInsert expects a : * TupleTableSlot while we already have HashJoinTuples. : */ : tuple = HJTUPLE_MINTUPLE(hashTuple); : tupleSize = HJTUPLE_OVERHEAD + tuple->t_len; 0.00 : 5bd234: 4c 8d 60 10 lea 0x10(%rax),%r12 : : /* Decide whether to put the tuple in the hash table or a temp file */ : if (batchno == hashtable->curbatch) 0.00 : 5bd238: 74 c6 je 5bd200 : } : else : { : /* Put the tuple into a temp file for later batches */ : Assert(batchno > hashtable->curbatch); : ExecHashJoinSaveTuple(tuple, hashvalue, 0.00 : 5bd23a: 48 8b 55 b0 mov -0x50(%rbp),%rdx 0.00 : 5bd23e: 49 03 57 68 add 0x68(%r15),%rdx 0.00 : 5bd242: 8b 75 a4 mov -0x5c(%rbp),%esi 0.00 : 5bd245: e8 16 03 00 00 callq 5bd560 : &hashtable->innerBatchFile[batchno]); : pfree(hashTuple); 0.00 : 5bd24a: 48 89 df mov %rbx,%rdi 0.00 : 5bd24d: e8 2e b9 1d 00 callq 798b80 : hashtable->spaceUsed -= tupleSize; 0.00 : 5bd252: 4d 29 a7 90 00 00 00 sub %r12,0x90(%r15) : hashtable->spaceUsedSkew -= tupleSize; 0.00 : 5bd259: 4d 29 a7 a8 00 00 00 sub %r12,0xa8(%r15) : hashvalue = bucket->hashvalue; : ExecHashGetBucketAndBatch(hashtable, hashvalue, &bucketno, &batchno); : : /* Process all tuples in the bucket */ : hashTuple = bucket->tuples; : while (hashTuple != NULL) 0.00 : 5bd260: 4d 85 ed test %r13,%r13 0.00 : 5bd263: 75 be jne 5bd223 0.00 : 5bd265: 48 8b 75 c0 mov -0x40(%rbp),%rsi 0.00 : 5bd269: 49 03 77 28 add 0x28(%r15),%rsi : * to remove A first then ExecHashGetSkewBucket would mistakenly start : * reporting that B is not in the hashtable, because it would hit the NULL : * before finding B. However, we always remove entries in the reverse : * order of creation, so this failure cannot happen. : */ : hashtable->skewBucket[bucketToRemove] = NULL; 0.00 : 5bd26d: 48 c7 06 00 00 00 00 movq $0x0,(%rsi) : hashtable->nSkewBuckets--; 0.00 : 5bd274: 41 83 6f 34 01 subl $0x1,0x34(%r15) : pfree(bucket); 0.00 : 5bd279: 48 8b 7d a8 mov -0x58(%rbp),%rdi 0.00 : 5bd27d: e8 fe b8 1d 00 callq 798b80 : : /* : * If we have removed all skew buckets then give up on skew optimization. : * Release the arrays since they aren't useful any more. : */ : if (hashtable->nSkewBuckets == 0) 0.00 : 5bd282: 41 8b 4f 34 mov 0x34(%r15),%ecx : * order of creation, so this failure cannot happen. : */ : hashtable->skewBucket[bucketToRemove] = NULL; : hashtable->nSkewBuckets--; : pfree(bucket); : hashtable->spaceUsed -= SKEW_BUCKET_OVERHEAD; 0.00 : 5bd286: 49 83 af 90 00 00 00 subq $0x10,0x90(%r15) 0.00 : 5bd28d: 10 : hashtable->spaceUsedSkew -= SKEW_BUCKET_OVERHEAD; 0.00 : 5bd28e: 49 83 af a8 00 00 00 subq $0x10,0xa8(%r15) 0.00 : 5bd295: 10 : : /* : * If we have removed all skew buckets then give up on skew optimization. : * Release the arrays since they aren't useful any more. : */ : if (hashtable->nSkewBuckets == 0) 0.00 : 5bd296: 85 c9 test %ecx,%ecx 0.00 : 5bd298: 0f 85 d2 fe ff ff jne 5bd170 : { : hashtable->skewEnabled = false; : pfree(hashtable->skewBucket); 0.00 : 5bd29e: 49 8b 7f 28 mov 0x28(%r15),%rdi : * If we have removed all skew buckets then give up on skew optimization. : * Release the arrays since they aren't useful any more. : */ : if (hashtable->nSkewBuckets == 0) : { : hashtable->skewEnabled = false; 0.00 : 5bd2a2: 41 c6 47 21 00 movb $0x0,0x21(%r15) : pfree(hashtable->skewBucket); 0.00 : 5bd2a7: e8 d4 b8 1d 00 callq 798b80 : pfree(hashtable->skewBucketNums); 0.00 : 5bd2ac: 49 8b 7f 38 mov 0x38(%r15),%rdi 0.00 : 5bd2b0: e8 cb b8 1d 00 callq 798b80 : hashtable->skewBucket = NULL; : hashtable->skewBucketNums = NULL; : hashtable->spaceUsed -= hashtable->spaceUsedSkew; 0.00 : 5bd2b5: 49 8b 87 a8 00 00 00 mov 0xa8(%r15),%rax : if (hashtable->nSkewBuckets == 0) : { : hashtable->skewEnabled = false; : pfree(hashtable->skewBucket); : pfree(hashtable->skewBucketNums); : hashtable->skewBucket = NULL; 0.00 : 5bd2bc: 49 c7 47 28 00 00 00 movq $0x0,0x28(%r15) 0.00 : 5bd2c3: 00 : hashtable->skewBucketNums = NULL; 0.00 : 5bd2c4: 49 c7 47 38 00 00 00 movq $0x0,0x38(%r15) 0.00 : 5bd2cb: 00 : hashtable->spaceUsed -= hashtable->spaceUsedSkew; 0.00 : 5bd2cc: 49 29 87 90 00 00 00 sub %rax,0x90(%r15) : hashtable->spaceUsedSkew = 0; 0.00 : 5bd2d3: 49 c7 87 a8 00 00 00 movq $0x0,0xa8(%r15) 0.00 : 5bd2da: 00 00 00 00 0.00 : 5bd2de: e9 8d fe ff ff jmpq 5bd170 0.00 : 5bd2e3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : *bucketno = hashvalue & (nbuckets - 1); : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); : } : else : { : *bucketno = hashvalue & (nbuckets - 1); 0.00 : 5bd2e8: 83 ea 01 sub $0x1,%edx 0.00 : 5bd2eb: 45 31 f6 xor %r14d,%r14d 0.00 : 5bd2ee: 23 55 a4 and -0x5c(%rbp),%edx 0.00 : 5bd2f1: e9 dc fe ff ff jmpq 5bd1d2 : hashtable->spacePeak = hashtable->spaceUsed; : while (hashtable->spaceUsedSkew > hashtable->spaceAllowedSkew) : ExecHashRemoveNextSkewBucket(hashtable); : : /* Check we are not over the total spaceAllowed, either */ : if (hashtable->spaceUsed > hashtable->spaceAllowed) 0.00 : 5bd2f6: 49 8b 97 98 00 00 00 mov 0x98(%r15),%rdx 0.00 : 5bd2fd: 49 39 97 90 00 00 00 cmp %rdx,0x90(%r15) 0.00 : 5bd304: 0f 87 40 01 00 00 ja 5bd44a : if (bucketNumber != INVALID_SKEW_BUCKET_NO) : { : /* It's a skew tuple, so put it into that hash table */ : ExecHashSkewTableInsert(hashtable, slot, hashvalue, : bucketNumber); : hashtable->skewTuples += 1; 0.00 : 5bd30a: f2 0f 10 0d 46 1e 1f movsd 0x1f1e46(%rip),%xmm1 # 7af158 <__func__.15777+0x10> 0.00 : 5bd311: 00 0.00 : 5bd312: 66 0f 28 c1 movapd %xmm1,%xmm0 0.00 : 5bd316: f2 41 0f 58 47 60 addsd 0x60(%r15),%xmm0 0.00 : 5bd31c: f2 41 0f 11 47 60 movsd %xmm0,0x60(%r15) : else : { : /* Not subject to skew optimization, so insert normally */ : ExecHashTableInsert(hashtable, slot, hashvalue); : } : hashtable->totalTuples += 1; 0.00 : 5bd322: f2 41 0f 58 4f 58 addsd 0x58(%r15),%xmm1 0.00 : 5bd328: f2 41 0f 11 4f 58 movsd %xmm1,0x58(%r15) 0.00 : 5bd32e: e9 4d fd ff ff jmpq 5bd080 : } : } : : /* resize the hash table if needed (NTUP_PER_BUCKET exceeded) */ : if (hashtable->nbuckets != hashtable->nbuckets_optimal) 0.00 : 5bd333: 41 8b 07 mov (%r15),%eax 0.00 : 5bd336: 41 8b 57 0c mov 0xc(%r15),%edx 0.00 : 5bd33a: 39 d0 cmp %edx,%eax 0.00 : 5bd33c: 74 02 je 5bd340 : ExecHashIncreaseNumBuckets(HashJoinTable hashtable) : { : HashMemoryChunk chunk; : : /* do nothing if not an increase (it's called increase for a reason) */ : if (hashtable->nbuckets >= hashtable->nbuckets_optimal) 0.00 : 5bd33e: 7c 68 jl 5bd3a8 : : ExecHashIncreaseNumBuckets(hashtable); : } : : /* Account for the buckets in spaceUsed (reported in EXPLAIN ANALYZE) */ : hashtable->spaceUsed += hashtable->nbuckets * sizeof(HashJoinTuple); 0.00 : 5bd340: 48 98 cltq 0.00 : 5bd342: 48 c1 e0 03 shl $0x3,%rax 0.00 : 5bd346: 49 03 87 90 00 00 00 add 0x90(%r15),%rax : if (hashtable->spaceUsed > hashtable->spacePeak) 0.00 : 5bd34d: 49 3b 87 a0 00 00 00 cmp 0xa0(%r15),%rax : : ExecHashIncreaseNumBuckets(hashtable); : } : : /* Account for the buckets in spaceUsed (reported in EXPLAIN ANALYZE) */ : hashtable->spaceUsed += hashtable->nbuckets * sizeof(HashJoinTuple); 0.00 : 5bd354: 49 89 87 90 00 00 00 mov %rax,0x90(%r15) : if (hashtable->spaceUsed > hashtable->spacePeak) 0.00 : 5bd35b: 76 07 jbe 5bd364 : hashtable->spacePeak = hashtable->spaceUsed; 0.00 : 5bd35d: 49 89 87 a0 00 00 00 mov %rax,0xa0(%r15) : : /* must provide our own instrumentation support */ : if (node->ps.instrument) 0.00 : 5bd364: 48 8b 45 80 mov -0x80(%rbp),%rax 0.00 : 5bd368: 48 8b 78 18 mov 0x18(%rax),%rdi 0.00 : 5bd36c: 48 85 ff test %rdi,%rdi 0.00 : 5bd36f: 74 0b je 5bd37c : InstrStopNode(node->ps.instrument, hashtable->totalTuples); 0.00 : 5bd371: f2 41 0f 10 47 58 movsd 0x58(%r15),%xmm0 0.00 : 5bd377: e8 54 a8 ff ff callq 5b7bd0 : * parent Hashjoin node is expected to know how to fish it out of our node : * state. Ugly but not really worth cleaning up, since Hashjoin knows : * quite a bit more about Hash besides that. : */ : return NULL; : } 0.00 : 5bd37c: 48 83 c4 58 add $0x58,%rsp 0.00 : 5bd380: 31 c0 xor %eax,%eax 0.00 : 5bd382: 5b pop %rbx 0.00 : 5bd383: 41 5c pop %r12 0.00 : 5bd385: 41 5d pop %r13 0.00 : 5bd387: 41 5e pop %r14 0.00 : 5bd389: 41 5f pop %r15 0.00 : 5bd38b: c9 leaveq 0.00 : 5bd38c: c3 retq : hashtable->skewTuples += 1; : } : else : { : /* Not subject to skew optimization, so insert normally */ : ExecHashTableInsert(hashtable, slot, hashvalue); 0.00 : 5bd38d: 8b 55 d4 mov -0x2c(%rbp),%edx 0.00 : 5bd390: 4c 89 e6 mov %r12,%rsi 0.00 : 5bd393: 4c 89 ff mov %r15,%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:126 15.38 : 5bd396: e8 75 f0 ff ff callq 5bc410 0.00 : 5bd39b: f2 0f 10 0d b5 1d 1f movsd 0x1f1db5(%rip),%xmm1 # 7af158 <__func__.15777+0x10> 0.00 : 5bd3a2: 00 0.00 : 5bd3a3: e9 7a ff ff ff jmpq 5bd322 : /* : * We already know the optimal number of buckets, so let's just : * compute the log2_nbuckets for it. : */ : hashtable->nbuckets = hashtable->nbuckets_optimal; : hashtable->log2_nbuckets = my_log2(hashtable->nbuckets_optimal); 0.00 : 5bd3a8: 48 63 fa movslq %edx,%rdi : : /* : * We already know the optimal number of buckets, so let's just : * compute the log2_nbuckets for it. : */ : hashtable->nbuckets = hashtable->nbuckets_optimal; 0.00 : 5bd3ab: 41 89 17 mov %edx,(%r15) : hashtable->log2_nbuckets = my_log2(hashtable->nbuckets_optimal); 0.00 : 5bd3ae: e8 4d 64 1c 00 callq 783800 : * Just reallocate the proper number of buckets - we don't need to : * walk through them - we can walk the dense-allocated chunks : * (just like in ExecHashIncreaseNumBatches, but without all the : * copying into new chunks) : */ : hashtable->buckets = 0.00 : 5bd3b3: 49 63 37 movslq (%r15),%rsi 0.00 : 5bd3b6: 49 8b 7f 18 mov 0x18(%r15),%rdi : /* : * We already know the optimal number of buckets, so let's just : * compute the log2_nbuckets for it. : */ : hashtable->nbuckets = hashtable->nbuckets_optimal; : hashtable->log2_nbuckets = my_log2(hashtable->nbuckets_optimal); 0.00 : 5bd3ba: 41 89 47 04 mov %eax,0x4(%r15) : * Just reallocate the proper number of buckets - we don't need to : * walk through them - we can walk the dense-allocated chunks : * (just like in ExecHashIncreaseNumBatches, but without all the : * copying into new chunks) : */ : hashtable->buckets = 0.00 : 5bd3be: 48 c1 e6 03 shl $0x3,%rsi 0.00 : 5bd3c2: e8 29 b9 1d 00 callq 798cf0 : (HashJoinTuple *) repalloc(hashtable->buckets, : hashtable->nbuckets * sizeof(HashJoinTuple)); : : memset(hashtable->buckets, 0, sizeof(void *) * hashtable->nbuckets); 0.00 : 5bd3c7: 49 63 17 movslq (%r15),%rdx : * Just reallocate the proper number of buckets - we don't need to : * walk through them - we can walk the dense-allocated chunks : * (just like in ExecHashIncreaseNumBatches, but without all the : * copying into new chunks) : */ : hashtable->buckets = 0.00 : 5bd3ca: 48 89 c7 mov %rax,%rdi : (HashJoinTuple *) repalloc(hashtable->buckets, : hashtable->nbuckets * sizeof(HashJoinTuple)); : : memset(hashtable->buckets, 0, sizeof(void *) * hashtable->nbuckets); 0.00 : 5bd3cd: 31 f6 xor %esi,%esi : * Just reallocate the proper number of buckets - we don't need to : * walk through them - we can walk the dense-allocated chunks : * (just like in ExecHashIncreaseNumBatches, but without all the : * copying into new chunks) : */ : hashtable->buckets = 0.00 : 5bd3cf: 49 89 47 18 mov %rax,0x18(%r15) : (HashJoinTuple *) repalloc(hashtable->buckets, : hashtable->nbuckets * sizeof(HashJoinTuple)); : : memset(hashtable->buckets, 0, sizeof(void *) * hashtable->nbuckets); 0.00 : 5bd3d3: 48 c1 e2 03 shl $0x3,%rdx 0.00 : 5bd3d7: e8 44 c0 ea ff callq 469420 : : /* scan through all tuples in all chunks to rebuild the hash table */ : for (chunk = hashtable->chunks; chunk != NULL; chunk = chunk->next) 0.00 : 5bd3dc: 49 8b bf c8 00 00 00 mov 0xc8(%r15),%rdi 0.00 : 5bd3e3: 48 85 ff test %rdi,%rdi 0.00 : 5bd3e6: 74 5a je 5bd442 0.00 : 5bd3e8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5bd3ef: 00 : { : /* process all tuples stored in this chunk */ : size_t idx = 0; : while (idx < chunk->used) 0.00 : 5bd3f0: 48 83 7f 10 00 cmpq $0x0,0x10(%rdi) 0.00 : 5bd3f5: 74 42 je 5bd439 : { : HashJoinTuple hashTuple = (HashJoinTuple) (chunk->data + idx); 0.00 : 5bd3f7: 4c 8d 47 20 lea 0x20(%rdi),%r8 0.00 : 5bd3fb: 31 f6 xor %esi,%esi 0.00 : 5bd3fd: 0f 1f 00 nopl (%rax) 0.00 : 5bd400: 49 8d 0c 30 lea (%r8,%rsi,1),%rcx : ExecHashGetBucketAndBatch(HashJoinTable hashtable, : uint32 hashvalue, : int *bucketno, : int *batchno) : { : uint32 nbuckets = (uint32) hashtable->nbuckets; 0.00 : 5bd404: 41 8b 07 mov (%r15),%eax : { : HashJoinTuple hashTuple = (HashJoinTuple) (chunk->data + idx); : int bucketno; : int batchno; : : ExecHashGetBucketAndBatch(hashtable, hashTuple->hashvalue, 0.00 : 5bd407: 8b 51 08 mov 0x8(%rcx),%edx : *bucketno = hashvalue & (nbuckets - 1); : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); : } : else : { : *bucketno = hashvalue & (nbuckets - 1); 0.00 : 5bd40a: 83 e8 01 sub $0x1,%eax 0.00 : 5bd40d: 21 d0 and %edx,%eax : : ExecHashGetBucketAndBatch(hashtable, hashTuple->hashvalue, : &bucketno, &batchno); : : /* add the tuple to the proper bucket */ : hashTuple->next = hashtable->buckets[bucketno]; 0.00 : 5bd40f: 48 63 d0 movslq %eax,%rdx 0.00 : 5bd412: 49 8b 47 18 mov 0x18(%r15),%rax 0.00 : 5bd416: 48 8b 04 d0 mov (%rax,%rdx,8),%rax 0.00 : 5bd41a: 48 89 01 mov %rax,(%rcx) : hashtable->buckets[bucketno] = hashTuple; 0.00 : 5bd41d: 49 8b 47 18 mov 0x18(%r15),%rax 0.00 : 5bd421: 48 89 0c d0 mov %rcx,(%rax,%rdx,8) : : /* advance index past the tuple */ : idx += MAXALIGN(HJTUPLE_OVERHEAD + 0.00 : 5bd425: 8b 41 10 mov 0x10(%rcx),%eax 0.00 : 5bd428: 48 83 c0 17 add $0x17,%rax 0.00 : 5bd42c: 48 83 e0 f8 and $0xfffffffffffffff8,%rax 0.00 : 5bd430: 48 01 c6 add %rax,%rsi : /* scan through all tuples in all chunks to rebuild the hash table */ : for (chunk = hashtable->chunks; chunk != NULL; chunk = chunk->next) : { : /* process all tuples stored in this chunk */ : size_t idx = 0; : while (idx < chunk->used) 0.00 : 5bd433: 48 3b 77 10 cmp 0x10(%rdi),%rsi 0.00 : 5bd437: 72 c7 jb 5bd400 : hashtable->nbuckets * sizeof(HashJoinTuple)); : : memset(hashtable->buckets, 0, sizeof(void *) * hashtable->nbuckets); : : /* scan through all tuples in all chunks to rebuild the hash table */ : for (chunk = hashtable->chunks; chunk != NULL; chunk = chunk->next) 0.00 : 5bd439: 48 8b 7f 18 mov 0x18(%rdi),%rdi 0.00 : 5bd43d: 48 85 ff test %rdi,%rdi 0.00 : 5bd440: 75 ae jne 5bd3f0 0.00 : 5bd442: 41 8b 07 mov (%r15),%eax 0.00 : 5bd445: e9 f6 fe ff ff jmpq 5bd340 : while (hashtable->spaceUsedSkew > hashtable->spaceAllowedSkew) : ExecHashRemoveNextSkewBucket(hashtable); : : /* Check we are not over the total spaceAllowed, either */ : if (hashtable->spaceUsed > hashtable->spaceAllowed) : ExecHashIncreaseNumBatches(hashtable); 0.00 : 5bd44a: 4c 89 ff mov %r15,%rdi 0.00 : 5bd44d: e8 8e ec ff ff callq 5bc0e0 0.00 : 5bd452: e9 b3 fe ff ff jmpq 5bd30a Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 46.15 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:720 38.46 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:697 15.38 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:780 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000782ca0 : : CHashBucketScan(CHashTable table, : CHashPtr *start, : uint32 hashcode, : const void *key, : CHashScanResult *res) : { 0.00 : 782ca0: 55 push %rbp 0.00 : 782ca1: 48 89 e5 mov %rsp,%rbp 0.00 : 782ca4: 41 57 push %r15 0.00 : 782ca6: 41 89 d7 mov %edx,%r15d 0.00 : 782ca9: 41 56 push %r14 0.00 : 782cab: 41 55 push %r13 0.00 : 782cad: 49 89 fd mov %rdi,%r13 0.00 : 782cb0: 41 54 push %r12 0.00 : 782cb2: 45 31 e4 xor %r12d,%r12d 0.00 : 782cb5: 53 push %rbx 0.00 : 782cb6: 48 83 ec 18 sub $0x18,%rsp 0.00 : 782cba: 48 89 75 d0 mov %rsi,-0x30(%rbp) 0.00 : 782cbe: 48 89 4d c8 mov %rcx,-0x38(%rbp) 0.00 : 782cc2: 4c 89 45 c0 mov %r8,-0x40(%rbp) : CHashPtr *pointer_to_target; : CHashNode *target_node = NULL; : : retry: : pointer_to_target = start; : target = *pointer_to_target; 0.00 : 782cc6: 48 8b 45 d0 mov -0x30(%rbp),%rax 0.00 : 782cca: 44 8b 10 mov (%rax),%r10d : : /* : * If we've reached the end of the bucket chain, stop; otherwise, : * figure out the actual address of the next item. : */ : if (CHashPtrIsInvalid(target)) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:697 38.46 : 782ccd: 41 83 fa fd cmp $0xfffffffd,%r10d 0.00 : 782cd1: 0f 87 ff 00 00 00 ja 782dd6 : { : res->found = false; : break; 0.00 : 782cd7: 4c 8b 75 d0 mov -0x30(%rbp),%r14 0.00 : 782cdb: eb 21 jmp 782cfe 0.00 : 782cdd: 0f 1f 00 nopl (%rax) : /* : * Bucket chains are kept in order, so that there is exactly one legal : * point at which any given key can be inserted. The ordering is by : * hashcode first, and then by memcmp ordering of the keys involved. : */ : h = target_node->un.hashcode; 0.00 : 782ce0: 41 8b 44 24 04 mov 0x4(%r12),%eax : if (h == hashcode) 0.00 : 782ce5: 44 39 f8 cmp %r15d,%eax 0.00 : 782ce8: 74 5e je 782d48 : cmp = memcmp(CHashNodeGetItem(target_node), key, : table->desc.key_size); : else if (h > hashcode) 0.00 : 782cea: 41 39 c7 cmp %eax,%r15d 0.00 : 782ced: 0f 1f 00 nopl (%rax) 0.00 : 782cf0: 72 7b jb 782d6d : break; : } : } : : /* Continue scan from next node. */ : pointer_to_target = &target_node->next; 0.00 : 782cf2: 4d 89 e6 mov %r12,%r14 0.00 : 782cf5: 45 89 c2 mov %r8d,%r10d : : /* : * If we've reached the end of the bucket chain, stop; otherwise, : * figure out the actual address of the next item. : */ : if (CHashPtrIsInvalid(target)) 0.00 : 782cf8: 41 83 fa fd cmp $0xfffffffd,%r10d 0.00 : 782cfc: 77 79 ja 782d77 : { : res->found = false; : break; : } : target_node = CHashTableGetNode(table, target); 0.00 : 782cfe: 44 89 d0 mov %r10d,%eax 0.00 : 782d01: d1 e8 shr %eax 0.00 : 782d03: 41 89 c4 mov %eax,%r12d 0.00 : 782d06: 45 0f af 65 1c imul 0x1c(%r13),%r12d 0.00 : 782d0b: 4d 03 65 30 add 0x30(%r13),%r12 : * target may have been fetched from an arena entry that could be : * concurrently modified, so a dependency barrier is required before : * dereferencing the derived pointer. : */ : pg_read_barrier_depends(); : next = target_node->next; 0.00 : 782d0f: 45 8b 04 24 mov (%r12),%r8d : * ensures that delete-marked elements are removed from bucket chains : * as quickly as possible and reduces code duplication. See : * CHashDelete for further comments about why delete-marking is : * necessary and how it allows safe deletion. : */ : if (CHashPtrIsMarked(next)) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:720 46.15 : 782d13: 41 f6 c0 01 test $0x1,%r8b 0.00 : 782d17: 74 c7 je 782ce0 : { : zap: : if (__sync_bool_compare_and_swap(pointer_to_target, 0.00 : 782d19: 44 89 c3 mov %r8d,%ebx 0.00 : 782d1c: 44 89 d0 mov %r10d,%eax 0.00 : 782d1f: 83 e3 fe and $0xfffffffe,%ebx 0.00 : 782d22: f0 41 0f b1 1e lock cmpxchg %ebx,(%r14) 0.00 : 782d27: 74 77 je 782da0 : * the node which precedes it before we advance to the next : * node. That could certainly happen occasionally, but we'd : * have to be pretty unlucky to have it happen even twice in : * a row. : */ : CHashTableIncrementStatistic(table, CHS_Scan_Expunge_Fail); 0.00 : 782d29: 49 83 85 88 00 00 00 addq $0x1,0x88(%r13) 0.00 : 782d30: 01 : target = *pointer_to_target; 0.00 : 782d31: 45 8b 16 mov (%r14),%r10d : if (CHashPtrIsMarked(target)) 0.00 : 782d34: 41 f6 c2 01 test $0x1,%r10b 0.00 : 782d38: 74 be je 782cf8 : { : CHashTableIncrementStatistic(table, CHS_Scan_Restart); 0.00 : 782d3a: 49 83 85 90 00 00 00 addq $0x1,0x90(%r13) 0.00 : 782d41: 01 : goto retry; 0.00 : 782d42: eb 82 jmp 782cc6 0.00 : 782d44: 0f 1f 40 00 nopl 0x0(%rax) : * point at which any given key can be inserted. The ordering is by : * hashcode first, and then by memcmp ordering of the keys involved. : */ : h = target_node->un.hashcode; : if (h == hashcode) : cmp = memcmp(CHashNodeGetItem(target_node), key, 0.00 : 782d48: 41 0f b7 4d 0e movzwl 0xe(%r13),%ecx 0.00 : 782d4d: 48 8b 7d c8 mov -0x38(%rbp),%rdi 0.00 : 782d51: 49 8d 74 24 08 lea 0x8(%r12),%rsi 0.00 : 782d56: 48 39 c9 cmp %rcx,%rcx 0.00 : 782d59: f3 a6 repz cmpsb %es:(%rdi),%ds:(%rsi) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:780 15.38 : 782d5b: 0f 97 c0 seta %al 0.00 : 782d5e: 0f 92 c2 setb %dl 0.00 : 782d61: 28 d0 sub %dl,%al 0.00 : 782d63: 0f be c0 movsbl %al,%eax : * the point where we expect to find the key OR someone delete-marked : * the item and overwrote the hashcode with a gcnext pointer. In the : * latter case we must take care not to be fooled into stopping the : * scan early. : */ : if (cmp >= 0) 0.00 : 782d66: 83 f8 00 cmp $0x0,%eax 0.00 : 782d69: 7c 87 jl 782cf2 : { : if (cmp == 0) 0.00 : 782d6b: 74 5b je 782dc8 : /* : * pg_read_barrier() prevents the reread of the next pointer : * from being speculated ahead of the read of the hash value. : */ : pg_read_barrier(); : next = target_node->next; 0.00 : 782d6d: 45 8b 04 24 mov (%r12),%r8d : if (CHashPtrIsMarked(next)) 0.00 : 782d71: 41 f6 c0 01 test $0x1,%r8b 0.00 : 782d75: 75 a2 jne 782d19 : goto zap; : res->found = false; 0.00 : 782d77: 48 8b 7d c0 mov -0x40(%rbp),%rdi 0.00 : 782d7b: c6 47 18 00 movb $0x0,0x18(%rdi) : pointer_to_target = &target_node->next; : target = next; : } : : /* Send results back to caller. */ : res->target = target; 0.00 : 782d7f: 48 8b 45 c0 mov -0x40(%rbp),%rax 0.00 : 782d83: 44 89 10 mov %r10d,(%rax) : res->pointer_to_target = pointer_to_target; 0.00 : 782d86: 4c 89 70 08 mov %r14,0x8(%rax) : res->target_node = target_node; 0.00 : 782d8a: 4c 89 60 10 mov %r12,0x10(%rax) : } 0.00 : 782d8e: 48 83 c4 18 add $0x18,%rsp 0.00 : 782d92: 5b pop %rbx 0.00 : 782d93: 41 5c pop %r12 0.00 : 782d95: 41 5d pop %r13 0.00 : 782d97: 41 5e pop %r14 0.00 : 782d99: 41 5f pop %r15 0.00 : 782d9b: c9 leaveq 0.00 : 782d9c: c3 retq 0.00 : 782d9d: 0f 1f 00 nopl (%rax) : * delete-mark has been applied. Thus, if we just keep : * following the next pointers, we're guaranteed to visit : * all non-deleted items (and possibly some deleted items) : * that were present at the time we began the scan. : */ : CHashTableIncrementStatistic(table, CHS_Scan_Expunge); 0.00 : 782da0: 49 83 85 80 00 00 00 addq $0x1,0x80(%r13) 0.00 : 782da7: 01 : CHashAddToGarbage(table, hashcode & table->bucket_mask, 0.00 : 782da8: 44 89 fe mov %r15d,%esi 0.00 : 782dab: 41 23 75 10 and 0x10(%r13),%esi 0.00 : 782daf: 44 89 d2 mov %r10d,%edx 0.00 : 782db2: 4c 89 ef mov %r13,%rdi 0.00 : 782db5: e8 96 fe ff ff callq 782c50 0.00 : 782dba: 41 89 da mov %ebx,%r10d 0.00 : 782dbd: e9 36 ff ff ff jmpq 782cf8 0.00 : 782dc2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : */ : if (cmp >= 0) : { : if (cmp == 0) : { : res->found = true; 0.00 : 782dc8: 48 8b 45 c0 mov -0x40(%rbp),%rax 0.00 : 782dcc: c6 40 18 01 movb $0x1,0x18(%rax) : res->next = next; 0.00 : 782dd0: 44 89 40 04 mov %r8d,0x4(%rax) : break; 0.00 : 782dd4: eb a9 jmp 782d7f : : /* : * If we've reached the end of the bucket chain, stop; otherwise, : * figure out the actual address of the next item. : */ : if (CHashPtrIsInvalid(target)) 0.00 : 782dd6: 49 89 c6 mov %rax,%r14 0.00 : 782dd9: eb 9c jmp 782d77 Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 30.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 10.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:511 10.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 10.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 10.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 10.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000490660 : : register uint32 a, : b, : c; : : a = b = c = 0x9e3779b9 + (uint32) sizeof(uint32) + 3923095; : a += k; 0.00 : 490660: 81 ef ac a9 8c 61 sub $0x618ca9ac,%edi : * hash_any(&k, sizeof(uint32)) : * but is faster and doesn't force the caller to store k into memory. : */ : Datum : hash_uint32(uint32 k) : { /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:511 10.00 : 490666: 55 push %rbp : c; : : a = b = c = 0x9e3779b9 + (uint32) sizeof(uint32) + 3923095; : a += k; : : final(a, b, c); 0.00 : 490667: 81 f7 64 d8 6a 2a xor $0x2a6ad864,%edi 0.00 : 49066d: 81 ef 53 21 c3 56 sub $0x56c32153,%edi : * hash_any(&k, sizeof(uint32)) : * but is faster and doesn't force the caller to store k into memory. : */ : Datum : hash_uint32(uint32 k) : { 0.00 : 490673: 48 89 e5 mov %rsp,%rbp : c; : : a = b = c = 0x9e3779b9 + (uint32) sizeof(uint32) + 3923095; : a += k; : : final(a, b, c); 0.00 : 490676: 89 fe mov %edi,%esi 0.00 : 490678: 89 f8 mov %edi,%eax 0.00 : 49067a: c1 c8 07 ror $0x7,%eax 0.00 : 49067d: 81 f6 54 56 73 9e xor $0x9e735654,%esi 0.00 : 490683: 29 c6 sub %eax,%esi : : /* report the result */ : return UInt32GetDatum(c); : } 0.00 : 490685: c9 leaveq : c; : : a = b = c = 0x9e3779b9 + (uint32) sizeof(uint32) + 3923095; : a += k; : : final(a, b, c); /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 30.00 : 490686: 89 f0 mov %esi,%eax 10.00 : 490688: 89 f2 mov %esi,%edx 0.00 : 49068a: c1 ca 10 ror $0x10,%edx 0.00 : 49068d: 35 64 d8 6a 2a xor $0x2a6ad864,%eax 0.00 : 490692: 29 d0 sub %edx,%eax 0.00 : 490694: 89 c2 mov %eax,%edx 0.00 : 490696: 89 c1 mov %eax,%ecx 0.00 : 490698: c1 c9 1c ror $0x1c,%ecx 10.00 : 49069b: 31 fa xor %edi,%edx 0.00 : 49069d: 29 ca sub %ecx,%edx 0.00 : 49069f: 89 d1 mov %edx,%ecx 10.00 : 4906a1: c1 ca 12 ror $0x12,%edx 10.00 : 4906a4: 31 f1 xor %esi,%ecx 0.00 : 4906a6: 29 d1 sub %edx,%ecx 0.00 : 4906a8: 31 c8 xor %ecx,%eax 0.00 : 4906aa: c1 c9 08 ror $0x8,%ecx 20.00 : 4906ad: 29 c8 sub %ecx,%eax Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1742 30.00 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1720 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1706 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000049d220 : : */ : bool : heap_hot_search_buffer(ItemPointer tid, Relation relation, Buffer buffer, : Snapshot snapshot, HeapTuple heapTuple, : bool *all_dead, bool first_call) : { 0.00 : 49d220: 55 push %rbp 0.00 : 49d221: 48 89 e5 mov %rsp,%rbp 0.00 : 49d224: 41 57 push %r15 0.00 : 49d226: 4d 89 cf mov %r9,%r15 0.00 : 49d229: 41 56 push %r14 0.00 : 49d22b: 4d 89 c6 mov %r8,%r14 0.00 : 49d22e: 41 55 push %r13 0.00 : 49d230: 41 54 push %r12 0.00 : 49d232: 53 push %rbx 0.00 : 49d233: 48 83 ec 28 sub $0x28,%rsp : Page dp = (Page) BufferGetPage(buffer); 0.00 : 49d237: 85 d2 test %edx,%edx : */ : bool : heap_hot_search_buffer(ItemPointer tid, Relation relation, Buffer buffer, : Snapshot snapshot, HeapTuple heapTuple, : bool *all_dead, bool first_call) : { 0.00 : 49d239: 48 89 4d b8 mov %rcx,-0x48(%rbp) 0.00 : 49d23d: 48 89 7d d0 mov %rdi,-0x30(%rbp) 0.00 : 49d241: 48 89 75 c8 mov %rsi,-0x38(%rbp) 0.00 : 49d245: 89 55 c4 mov %edx,-0x3c(%rbp) 0.00 : 49d248: 0f b6 4d 10 movzbl 0x10(%rbp),%ecx : Page dp = (Page) BufferGetPage(buffer); 0.00 : 49d24c: 0f 88 5e 02 00 00 js 49d4b0 0.00 : 49d252: 8b 45 c4 mov -0x3c(%rbp),%eax 0.00 : 49d255: 83 e8 01 sub $0x1,%eax 0.00 : 49d258: 4c 63 e8 movslq %eax,%r13 0.00 : 49d25b: 49 c1 e5 0d shl $0xd,%r13 0.00 : 49d25f: 4c 03 2d 92 28 72 00 add 0x722892(%rip),%r13 # bbfaf8 : bool at_chain_start; : bool valid; : bool skip; : : /* If this is not the first call, previous call returned a (live!) tuple */ : if (all_dead) 0.00 : 49d266: 4d 85 ff test %r15,%r15 0.00 : 49d269: 74 03 je 49d26e : *all_dead = first_call; 0.00 : 49d26b: 41 88 0f mov %cl,(%r15) : : Assert(TransactionIdIsValid(RecentGlobalXmin)); : : Assert(ItemPointerGetBlockNumber(tid) == BufferGetBlockNumber(buffer)); : offnum = ItemPointerGetOffsetNumber(tid); 0.00 : 49d26e: 48 8b 45 d0 mov -0x30(%rbp),%rax 0.00 : 49d272: 44 0f b7 60 04 movzwl 0x4(%rax),%r12d : at_chain_start = first_call; : skip = !first_call; : : heapTuple->t_self = *tid; 0.00 : 49d277: 48 89 c2 mov %rax,%rdx 0.00 : 49d27a: 8b 00 mov (%rax),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1706 20.00 : 49d27c: 41 89 46 04 mov %eax,0x4(%r14) 0.00 : 49d280: 0f b7 42 04 movzwl 0x4(%rdx),%eax : for (;;) : { : ItemId lp; : : /* check for bogus TID */ : if (offnum < FirstOffsetNumber || offnum > PageGetMaxOffsetNumber(dp)) 0.00 : 49d284: 66 45 85 e4 test %r12w,%r12w : Assert(ItemPointerGetBlockNumber(tid) == BufferGetBlockNumber(buffer)); : offnum = ItemPointerGetOffsetNumber(tid); : at_chain_start = first_call; : skip = !first_call; : : heapTuple->t_self = *tid; 0.00 : 49d288: 66 41 89 46 08 mov %ax,0x8(%r14) : for (;;) : { : ItemId lp; : : /* check for bogus TID */ : if (offnum < FirstOffsetNumber || offnum > PageGetMaxOffsetNumber(dp)) 0.00 : 49d28d: 74 4e je 49d2dd : Assert(TransactionIdIsValid(RecentGlobalXmin)); : : Assert(ItemPointerGetBlockNumber(tid) == BufferGetBlockNumber(buffer)); : offnum = ItemPointerGetOffsetNumber(tid); : at_chain_start = first_call; : skip = !first_call; 0.00 : 49d28f: 84 c9 test %cl,%cl 0.00 : 49d291: 89 ce mov %ecx,%esi 0.00 : 49d293: 41 0f 94 c0 sete %r8b 0.00 : 49d297: 31 ff xor %edi,%edi 0.00 : 49d299: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : for (;;) : { : ItemId lp; : : /* check for bogus TID */ : if (offnum < FirstOffsetNumber || offnum > PageGetMaxOffsetNumber(dp)) 0.00 : 49d2a0: 41 0f b7 55 0c movzwl 0xc(%r13),%edx 0.00 : 49d2a5: 31 c0 xor %eax,%eax 0.00 : 49d2a7: 41 0f b7 cc movzwl %r12w,%ecx 0.00 : 49d2ab: 66 83 fa 18 cmp $0x18,%dx 0.00 : 49d2af: 76 0b jbe 49d2bc 0.00 : 49d2b1: 0f b7 c2 movzwl %dx,%eax 0.00 : 49d2b4: 48 83 e8 18 sub $0x18,%rax 0.00 : 49d2b8: 48 c1 e8 02 shr $0x2,%rax 0.00 : 49d2bc: 48 39 c8 cmp %rcx,%rax 0.00 : 49d2bf: 72 1c jb 49d2dd : break; : : lp = PageGetItemId(dp, offnum); : : /* check for unused, dead, or redirected items */ : if (!ItemIdIsNormal(lp)) 0.00 : 49d2c1: 48 8d 51 03 lea 0x3(%rcx),%rdx 0.00 : 49d2c5: 41 8b 44 95 08 mov 0x8(%r13,%rdx,4),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1720 30.00 : 49d2ca: 25 00 80 01 00 and $0x18000,%eax 0.00 : 49d2cf: 3d 00 80 00 00 cmp $0x8000,%eax 0.00 : 49d2d4: 74 3a je 49d310 : { : /* We should only see a redirect at start of chain */ : if (ItemIdIsRedirected(lp) && at_chain_start) 0.00 : 49d2d6: 3d 00 00 01 00 cmp $0x10000,%eax 0.00 : 49d2db: 74 13 je 49d2f0 : { : Assert(ItemPointerGetBlockNumber(&heapTuple->t_data->t_ctid) == : ItemPointerGetBlockNumber(tid)); : offnum = ItemPointerGetOffsetNumber(&heapTuple->t_data->t_ctid); : at_chain_start = false; : prev_xmax = HeapTupleHeaderGetUpdateXid(heapTuple->t_data); 0.00 : 49d2dd: 31 c0 xor %eax,%eax : else : break; /* end of chain */ : } : : return false; : } 0.00 : 49d2df: 48 83 c4 28 add $0x28,%rsp 0.00 : 49d2e3: 5b pop %rbx 0.00 : 49d2e4: 41 5c pop %r12 0.00 : 49d2e6: 41 5d pop %r13 0.00 : 49d2e8: 41 5e pop %r14 0.00 : 49d2ea: 41 5f pop %r15 0.00 : 49d2ec: c9 leaveq 0.00 : 49d2ed: c3 retq 0.00 : 49d2ee: 66 90 xchg %ax,%ax : : /* check for unused, dead, or redirected items */ : if (!ItemIdIsNormal(lp)) : { : /* We should only see a redirect at start of chain */ : if (ItemIdIsRedirected(lp) && at_chain_start) 0.00 : 49d2f0: 40 84 f6 test %sil,%sil 0.00 : 49d2f3: 74 e8 je 49d2dd : { : /* Follow the redirect */ : offnum = ItemIdGetRedirect(lp); 0.00 : 49d2f5: 45 0f b7 64 95 08 movzwl 0x8(%r13,%rdx,4),%r12d 0.00 : 49d2fb: 66 41 81 e4 ff 7f and $0x7fff,%r12w : Assert(TransactionIdIsValid(RecentGlobalXmin)); : : Assert(ItemPointerGetBlockNumber(tid) == BufferGetBlockNumber(buffer)); : offnum = ItemPointerGetOffsetNumber(tid); : at_chain_start = first_call; : skip = !first_call; 0.00 : 49d301: 31 f6 xor %esi,%esi : for (;;) : { : ItemId lp; : : /* check for bogus TID */ : if (offnum < FirstOffsetNumber || offnum > PageGetMaxOffsetNumber(dp)) 0.00 : 49d303: 66 45 85 e4 test %r12w,%r12w 0.00 : 49d307: 75 97 jne 49d2a0 0.00 : 49d309: eb d2 jmp 49d2dd 0.00 : 49d30b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : } : /* else must be end of chain */ : break; : } : : heapTuple->t_data = (HeapTupleHeader) PageGetItem(dp, lp); 0.00 : 49d310: 41 0f b7 44 95 08 movzwl 0x8(%r13,%rdx,4),%eax 0.00 : 49d316: 25 ff 7f 00 00 and $0x7fff,%eax 0.00 : 49d31b: 49 8d 4c 05 00 lea 0x0(%r13,%rax,1),%rcx 0.00 : 49d320: 49 89 4e 10 mov %rcx,0x10(%r14) : heapTuple->t_len = ItemIdGetLength(lp); 0.00 : 49d324: 41 0f b7 44 95 0a movzwl 0xa(%r13,%rdx,4),%eax : heapTuple->t_tableOid = RelationGetRelid(relation); 0.00 : 49d32a: 48 8b 55 c8 mov -0x38(%rbp),%rdx : /* else must be end of chain */ : break; : } : : heapTuple->t_data = (HeapTupleHeader) PageGetItem(dp, lp); : heapTuple->t_len = ItemIdGetLength(lp); 0.00 : 49d32e: 66 d1 e8 shr %ax : ItemPointerSetOffsetNumber(&heapTuple->t_self, offnum); : : /* : * Shouldn't see a HEAP_ONLY tuple at chain start. : */ : if (at_chain_start && HeapTupleIsHeapOnly(heapTuple)) 0.00 : 49d331: 40 84 f6 test %sil,%sil : /* else must be end of chain */ : break; : } : : heapTuple->t_data = (HeapTupleHeader) PageGetItem(dp, lp); : heapTuple->t_len = ItemIdGetLength(lp); 0.00 : 49d334: 0f b7 c0 movzwl %ax,%eax 0.00 : 49d337: 41 89 06 mov %eax,(%r14) : heapTuple->t_tableOid = RelationGetRelid(relation); 0.00 : 49d33a: 8b 42 40 mov 0x40(%rdx),%eax : ItemPointerSetOffsetNumber(&heapTuple->t_self, offnum); 0.00 : 49d33d: 66 45 89 66 08 mov %r12w,0x8(%r14) : break; : } : : heapTuple->t_data = (HeapTupleHeader) PageGetItem(dp, lp); : heapTuple->t_len = ItemIdGetLength(lp); : heapTuple->t_tableOid = RelationGetRelid(relation); 0.00 : 49d342: 41 89 46 0c mov %eax,0xc(%r14) : ItemPointerSetOffsetNumber(&heapTuple->t_self, offnum); : : /* : * Shouldn't see a HEAP_ONLY tuple at chain start. : */ : if (at_chain_start && HeapTupleIsHeapOnly(heapTuple)) 0.00 : 49d346: 74 07 je 49d34f 0.00 : 49d348: 66 83 79 12 00 cmpw $0x0,0x12(%rcx) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1742 50.00 : 49d34d: 78 8e js 49d2dd : : /* : * The xmin should match the previous xmax value, else chain is : * broken. : */ : if (TransactionIdIsValid(prev_xmax) && 0.00 : 49d34f: 85 ff test %edi,%edi 0.00 : 49d351: 74 23 je 49d376 0.00 : 49d353: 49 8b 4e 10 mov 0x10(%r14),%rcx 0.00 : 49d357: ba 02 00 00 00 mov $0x2,%edx 0.00 : 49d35c: 0f b7 41 14 movzwl 0x14(%rcx),%eax 0.00 : 49d360: 25 00 03 00 00 and $0x300,%eax 0.00 : 49d365: 3d 00 03 00 00 cmp $0x300,%eax 0.00 : 49d36a: 74 02 je 49d36e 0.00 : 49d36c: 8b 11 mov (%rcx),%edx 0.00 : 49d36e: 39 fa cmp %edi,%edx 0.00 : 49d370: 0f 85 67 ff ff ff jne 49d2dd : * return the first tuple we find. But on later passes, heapTuple : * will initially be pointing to the tuple we returned last time. : * Returning it again would be incorrect (and would loop forever), so : * we skip it and return the next match we find. : */ : if (!skip) 0.00 : 49d376: 45 84 c0 test %r8b,%r8b 0.00 : 49d379: 74 65 je 49d3e0 : /* : * If we can't see it, maybe no one else can either. At caller : * request, check whether all chain members are dead to all : * transactions. : */ : if (all_dead && *all_dead && 0.00 : 49d37b: 4d 85 ff test %r15,%r15 0.00 : 49d37e: 66 90 xchg %ax,%ax 0.00 : 49d380: 74 0a je 49d38c 0.00 : 49d382: 41 80 3f 00 cmpb $0x0,(%r15) 0.00 : 49d386: 0f 85 04 01 00 00 jne 49d490 : : /* : * Check to see if HOT chain continues past this tuple; if so fetch : * the next offnum and loop around. : */ : if (HeapTupleIsHotUpdated(heapTuple)) 0.00 : 49d38c: 49 8b 7e 10 mov 0x10(%r14),%rdi 0.00 : 49d390: f6 47 13 40 testb $0x40,0x13(%rdi) 0.00 : 49d394: 0f 84 43 ff ff ff je 49d2dd 0.00 : 49d39a: 0f b7 57 14 movzwl 0x14(%rdi),%edx 0.00 : 49d39e: f6 c6 08 test $0x8,%dh 0.00 : 49d3a1: 0f 85 36 ff ff ff jne 49d2dd 0.00 : 49d3a7: 89 d0 mov %edx,%eax 0.00 : 49d3a9: 25 00 03 00 00 and $0x300,%eax 0.00 : 49d3ae: 3d 00 02 00 00 cmp $0x200,%eax 0.00 : 49d3b3: 0f 84 24 ff ff ff je 49d2dd : { : Assert(ItemPointerGetBlockNumber(&heapTuple->t_data->t_ctid) == : ItemPointerGetBlockNumber(tid)); : offnum = ItemPointerGetOffsetNumber(&heapTuple->t_data->t_ctid); : at_chain_start = false; : prev_xmax = HeapTupleHeaderGetUpdateXid(heapTuple->t_data); 0.00 : 49d3b9: 89 d0 mov %edx,%eax : */ : if (HeapTupleIsHotUpdated(heapTuple)) : { : Assert(ItemPointerGetBlockNumber(&heapTuple->t_data->t_ctid) == : ItemPointerGetBlockNumber(tid)); : offnum = ItemPointerGetOffsetNumber(&heapTuple->t_data->t_ctid); 0.00 : 49d3bb: 44 0f b7 67 10 movzwl 0x10(%rdi),%r12d : at_chain_start = false; : prev_xmax = HeapTupleHeaderGetUpdateXid(heapTuple->t_data); 0.00 : 49d3c0: 25 00 18 00 00 and $0x1800,%eax 0.00 : 49d3c5: 3d 00 10 00 00 cmp $0x1000,%eax 0.00 : 49d3ca: 0f 84 a8 00 00 00 je 49d478 0.00 : 49d3d0: 8b 7f 04 mov 0x4(%rdi),%edi 0.00 : 49d3d3: 45 31 c0 xor %r8d,%r8d 0.00 : 49d3d6: e9 26 ff ff ff jmpq 49d301 0.00 : 49d3db: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : * element of the HOT chain we're currently investigating instead : * of the root tuple of the HOT chain. This is important because : * the *Satisfies routine for historical mvcc snapshots needs the : * correct tid to decide about the visibility in some cases. : */ : ItemPointerSet(&(heapTuple->t_self), BufferGetBlockNumber(buffer), offnum); 0.00 : 49d3e0: 8b 7d c4 mov -0x3c(%rbp),%edi 0.00 : 49d3e3: e8 48 6c 1d 00 callq 674030 0.00 : 49d3e8: 8b 7d c4 mov -0x3c(%rbp),%edi 0.00 : 49d3eb: c1 e8 10 shr $0x10,%eax 0.00 : 49d3ee: 66 41 89 46 04 mov %ax,0x4(%r14) 0.00 : 49d3f3: e8 38 6c 1d 00 callq 674030 : : /* If it's visible per the snapshot, we must return it */ : valid = HeapTupleSatisfiesVisibility(heapTuple, snapshot, buffer); 0.00 : 49d3f8: 48 8b 75 b8 mov -0x48(%rbp),%rsi 0.00 : 49d3fc: 8b 55 c4 mov -0x3c(%rbp),%edx 0.00 : 49d3ff: 4c 89 f7 mov %r14,%rdi : * element of the HOT chain we're currently investigating instead : * of the root tuple of the HOT chain. This is important because : * the *Satisfies routine for historical mvcc snapshots needs the : * correct tid to decide about the visibility in some cases. : */ : ItemPointerSet(&(heapTuple->t_self), BufferGetBlockNumber(buffer), offnum); 0.00 : 49d402: 66 41 89 46 06 mov %ax,0x6(%r14) 0.00 : 49d407: 66 45 89 66 08 mov %r12w,0x8(%r14) : : /* If it's visible per the snapshot, we must return it */ : valid = HeapTupleSatisfiesVisibility(heapTuple, snapshot, buffer); 0.00 : 49d40c: ff 16 callq *(%rsi) : CheckForSerializableConflictOut(valid, relation, heapTuple, 0.00 : 49d40e: 8b 4d c4 mov -0x3c(%rbp),%ecx 0.00 : 49d411: 4c 8b 45 b8 mov -0x48(%rbp),%r8 0.00 : 49d415: 0f be f8 movsbl %al,%edi 0.00 : 49d418: 48 8b 75 c8 mov -0x38(%rbp),%rsi 0.00 : 49d41c: 4c 89 f2 mov %r14,%rdx : * correct tid to decide about the visibility in some cases. : */ : ItemPointerSet(&(heapTuple->t_self), BufferGetBlockNumber(buffer), offnum); : : /* If it's visible per the snapshot, we must return it */ : valid = HeapTupleSatisfiesVisibility(heapTuple, snapshot, buffer); 0.00 : 49d41f: 89 c3 mov %eax,%ebx : CheckForSerializableConflictOut(valid, relation, heapTuple, 0.00 : 49d421: e8 3a 72 1f 00 callq 694660 : buffer, snapshot); : /* reset to original, non-redirected, tid */ : heapTuple->t_self = *tid; 0.00 : 49d426: 48 8b 4d d0 mov -0x30(%rbp),%rcx : : if (valid) 0.00 : 49d42a: 84 db test %bl,%bl : /* If it's visible per the snapshot, we must return it */ : valid = HeapTupleSatisfiesVisibility(heapTuple, snapshot, buffer); : CheckForSerializableConflictOut(valid, relation, heapTuple, : buffer, snapshot); : /* reset to original, non-redirected, tid */ : heapTuple->t_self = *tid; 0.00 : 49d42c: 8b 01 mov (%rcx),%eax 0.00 : 49d42e: 41 89 46 04 mov %eax,0x4(%r14) 0.00 : 49d432: 0f b7 41 04 movzwl 0x4(%rcx),%eax 0.00 : 49d436: 66 41 89 46 08 mov %ax,0x8(%r14) : : if (valid) 0.00 : 49d43b: 0f 84 3a ff ff ff je 49d37b : { : ItemPointerSetOffsetNumber(tid, offnum); 0.00 : 49d441: 66 44 89 61 04 mov %r12w,0x4(%rcx) : PredicateLockTuple(relation, heapTuple, snapshot); 0.00 : 49d446: 48 8b 55 b8 mov -0x48(%rbp),%rdx 0.00 : 49d44a: 4c 89 f6 mov %r14,%rsi 0.00 : 49d44d: 48 8b 7d c8 mov -0x38(%rbp),%rdi 0.00 : 49d451: e8 4a 77 1f 00 callq 694ba0 : if (all_dead) 0.00 : 49d456: 4d 85 ff test %r15,%r15 0.00 : 49d459: b8 01 00 00 00 mov $0x1,%eax 0.00 : 49d45e: 0f 84 7b fe ff ff je 49d2df : *all_dead = false; 0.00 : 49d464: 41 c6 07 00 movb $0x0,(%r15) 0.00 : 49d468: b8 01 00 00 00 mov $0x1,%eax 0.00 : 49d46d: e9 6d fe ff ff jmpq 49d2df 0.00 : 49d472: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : { : Assert(ItemPointerGetBlockNumber(&heapTuple->t_data->t_ctid) == : ItemPointerGetBlockNumber(tid)); : offnum = ItemPointerGetOffsetNumber(&heapTuple->t_data->t_ctid); : at_chain_start = false; : prev_xmax = HeapTupleHeaderGetUpdateXid(heapTuple->t_data); 0.00 : 49d478: 84 d2 test %dl,%dl 0.00 : 49d47a: 0f 88 50 ff ff ff js 49d3d0 0.00 : 49d480: e8 9b 9c ff ff callq 497120 0.00 : 49d485: 45 31 c0 xor %r8d,%r8d 0.00 : 49d488: 89 c7 mov %eax,%edi 0.00 : 49d48a: e9 72 fe ff ff jmpq 49d301 0.00 : 49d48f: 90 nop : /* : * If we can't see it, maybe no one else can either. At caller : * request, check whether all chain members are dead to all : * transactions. : */ : if (all_dead && *all_dead && 0.00 : 49d490: 8b 35 6a d4 71 00 mov 0x71d46a(%rip),%esi # bba900 0.00 : 49d496: 4c 89 f7 mov %r14,%rdi 0.00 : 49d499: e8 62 72 30 00 callq 7a4700 0.00 : 49d49e: 84 c0 test %al,%al 0.00 : 49d4a0: 0f 85 e6 fe ff ff jne 49d38c : !HeapTupleIsSurelyDead(heapTuple, RecentGlobalXmin)) : *all_dead = false; 0.00 : 49d4a6: 41 c6 07 00 movb $0x0,(%r15) 0.00 : 49d4aa: e9 dd fe ff ff jmpq 49d38c 0.00 : 49d4af: 90 nop : bool : heap_hot_search_buffer(ItemPointer tid, Relation relation, Buffer buffer, : Snapshot snapshot, HeapTuple heapTuple, : bool *all_dead, bool first_call) : { : Page dp = (Page) BufferGetPage(buffer); 0.00 : 49d4b0: 89 d0 mov %edx,%eax 0.00 : 49d4b2: 48 8b 15 5f fc 6d 00 mov 0x6dfc5f(%rip),%rdx # b7d118 0.00 : 49d4b9: f7 d0 not %eax 0.00 : 49d4bb: 48 98 cltq 0.00 : 49d4bd: 4c 8b 2c c2 mov (%rdx,%rax,8),%r13 0.00 : 49d4c1: e9 a0 fd ff ff jmpq 49d266 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 40.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:337 30.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:989 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:336 10.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:325 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000007986d0 : : * AllocSetFree : * Frees allocated memory; memory is removed from the set. : */ : static void : AllocSetFree(MemoryContext context, void *pointer) : { 0.00 : 7986d0: 55 push %rbp 0.00 : 7986d1: 48 89 f9 mov %rdi,%rcx 0.00 : 7986d4: 48 89 e5 mov %rsp,%rbp 0.00 : 7986d7: 53 push %rbx : AllocSet set = (AllocSet) context; : AllocChunk chunk = AllocPointerGetChunk(pointer); 0.00 : 7986d8: 48 8d 5e f0 lea -0x10(%rsi),%rbx : * AllocSetFree : * Frees allocated memory; memory is removed from the set. : */ : static void : AllocSetFree(MemoryContext context, void *pointer) : { 0.00 : 7986dc: 48 83 ec 08 sub $0x8,%rsp : if (!sentinel_ok(pointer, chunk->requested_size)) : elog(WARNING, "detected write past chunk end in %s %p", : set->header.name, chunk); : #endif : : if (chunk->size > set->allocChunkLimit) 0.00 : 7986e0: 48 8b 46 f8 mov -0x8(%rsi),%rax 0.00 : 7986e4: 48 3b 87 b0 00 00 00 cmp 0xb0(%rdi),%rax 0.00 : 7986eb: 76 63 jbe 798750 : { : /* : * Big chunks are certain to have been allocated as single-chunk : * blocks. Find the containing block and return it to malloc(). : */ : AllocBlock block = set->blocks; 0.00 : 7986ed: 48 8b 7f 38 mov 0x38(%rdi),%rdi : AllocBlock prevblock = NULL; : : while (block != NULL) 0.00 : 7986f1: 48 85 ff test %rdi,%rdi 0.00 : 7986f4: 74 2c je 798722 : { : if (chunk == (AllocChunk) (((char *) block) + ALLOC_BLOCKHDRSZ)) 0.00 : 7986f6: 48 8d 47 20 lea 0x20(%rdi),%rax 0.00 : 7986fa: 48 39 c3 cmp %rax,%rbx 0.00 : 7986fd: 75 17 jne 798716 0.00 : 7986ff: 90 nop 0.00 : 798700: e9 be 00 00 00 jmpq 7987c3 0.00 : 798705: 0f 1f 00 nopl (%rax) 0.00 : 798708: 48 8d 47 20 lea 0x20(%rdi),%rax 0.00 : 79870c: 48 39 c3 cmp %rax,%rbx 0.00 : 79870f: 90 nop 0.00 : 798710: 0f 84 8a 00 00 00 je 7987a0 : break; 0.00 : 798716: 48 89 fa mov %rdi,%rdx : prevblock = block; : block = block->next; 0.00 : 798719: 48 8b 7f 08 mov 0x8(%rdi),%rdi : * blocks. Find the containing block and return it to malloc(). : */ : AllocBlock block = set->blocks; : AllocBlock prevblock = NULL; : : while (block != NULL) 0.00 : 79871d: 48 85 ff test %rdi,%rdi 0.00 : 798720: 75 e6 jne 798708 : break; : prevblock = block; : block = block->next; : } : if (block == NULL) : elog(ERROR, "could not find block containing chunk %p", chunk); 0.00 : 798722: ba 70 1e 8e 00 mov $0x8e1e70,%edx 0.00 : 798727: be c9 03 00 00 mov $0x3c9,%esi 0.00 : 79872c: bf 6d 1d 8e 00 mov $0x8e1d6d,%edi 0.00 : 798731: e8 ea 2c fe ff callq 77b420 0.00 : 798736: 48 89 da mov %rbx,%rdx 0.00 : 798739: be 08 1e 8e 00 mov $0x8e1e08,%esi 0.00 : 79873e: bf 14 00 00 00 mov $0x14,%edi 0.00 : 798743: 31 c0 xor %eax,%eax 0.00 : 798745: e8 e6 2a fe ff callq 77b230 0.00 : 79874a: e8 81 0d cd ff callq 4694d0 0.00 : 79874f: 90 nop : { : int idx; : unsigned int t, : tsize; : : if (size > (1 << ALLOC_MINBITS)) 0.00 : 798750: 31 d2 xor %edx,%edx 0.00 : 798752: 48 83 f8 08 cmp $0x8,%rax 0.00 : 798756: 77 20 ja 798778 : else : { : /* Normal case, put the chunk into appropriate freelist */ : int fidx = AllocSetFreeIndex(chunk->size); : : chunk->aset = (void *) set->freelist[fidx]; 0.00 : 798758: 48 63 c2 movslq %edx,%rax 0.00 : 79875b: 48 83 c0 08 add $0x8,%rax 0.00 : 79875f: 48 8b 14 c1 mov (%rcx,%rax,8),%rdx /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:989 30.00 : 798763: 48 89 56 f0 mov %rdx,-0x10(%rsi) : : #ifdef MEMORY_CONTEXT_CHECKING : /* Reset requested_size to 0 in chunks that are on freelist */ : chunk->requested_size = 0; : #endif : set->freelist[fidx] = chunk; 0.00 : 798767: 48 89 1c c1 mov %rbx,(%rcx,%rax,8) : } : } 0.00 : 79876b: 48 83 c4 08 add $0x8,%rsp 0.00 : 79876f: 5b pop %rbx 0.00 : 798770: c9 leaveq 0.00 : 798771: c3 retq 0.00 : 798772: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : unsigned int t, : tsize; : : if (size > (1 << ALLOC_MINBITS)) : { : tsize = (size - 1) >> ALLOC_MINBITS; /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:325 10.00 : 798778: 48 83 e8 01 sub $0x1,%rax 0.00 : 79877c: 48 89 c2 mov %rax,%rdx 0.00 : 79877f: 48 c1 ea 03 shr $0x3,%rdx : * justify micro-optimization effort. The best approach seems to be : * to use a lookup table. Note that this code assumes that : * ALLOCSET_NUM_FREELISTS <= 17, since we only cope with two bytes of : * the tsize value. : */ : t = tsize >> 8; 0.00 : 798783: 89 d0 mov %edx,%eax /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:336 20.00 : 798785: c1 e8 08 shr $0x8,%eax : idx = t ? LogTable256[t] + 8 : LogTable256[tsize]; 0.00 : 798788: 85 c0 test %eax,%eax 0.00 : 79878a: 74 2c je 7987b8 0.00 : 79878c: 89 c0 mov %eax,%eax 0.00 : 79878e: 0f b6 80 80 1e 8e 00 movzbl 0x8e1e80(%rax),%eax 0.00 : 798795: 8d 50 08 lea 0x8(%rax),%edx 0.00 : 798798: eb be jmp 798758 0.00 : 79879a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : : /* OK, remove block from aset's list and free it */ : if (prevblock == NULL) : set->blocks = block->next; : else : prevblock->next = block->next; 0.00 : 7987a0: 48 8b 47 08 mov 0x8(%rdi),%rax 0.00 : 7987a4: 48 89 42 08 mov %rax,0x8(%rdx) : /* Reset requested_size to 0 in chunks that are on freelist */ : chunk->requested_size = 0; : #endif : set->freelist[fidx] = chunk; : } : } 0.00 : 7987a8: 48 83 c4 08 add $0x8,%rsp 0.00 : 7987ac: 5b pop %rbx 0.00 : 7987ad: c9 leaveq : else : prevblock->next = block->next; : #ifdef CLOBBER_FREED_MEMORY : wipe_mem(block, block->freeptr - ((char *) block)); : #endif : free(block); 0.00 : 7987ae: e9 6d 10 cd ff jmpq 469820 0.00 : 7987b3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : * to use a lookup table. Note that this code assumes that : * ALLOCSET_NUM_FREELISTS <= 17, since we only cope with two bytes of : * the tsize value. : */ : t = tsize >> 8; : idx = t ? LogTable256[t] + 8 : LogTable256[tsize]; 0.00 : 7987b8: 89 d0 mov %edx,%eax 0.00 : 7987ba: 0f b6 90 80 1e 8e 00 movzbl 0x8e1e80(%rax),%edx /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:337 40.00 : 7987c1: eb 95 jmp 798758 : Assert(block->freeptr == ((char *) block) + : (chunk->size + ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ)); : : /* OK, remove block from aset's list and free it */ : if (prevblock == NULL) : set->blocks = block->next; 0.00 : 7987c3: 48 8b 47 08 mov 0x8(%rdi),%rax 0.00 : 7987c7: 48 89 41 38 mov %rax,0x38(%rcx) 0.00 : 7987cb: eb db jmp 7987a8 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:394 22.22 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:403 11.11 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:403 11.11 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:409 11.11 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:409 11.11 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:411 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000495e60 : : * In page-at-a-time mode it performs additional work, namely determining : * which tuples on the page are visible. : */ : static void : heapgetpage(HeapScanDesc scan, BlockNumber page) : { 0.00 : 495e60: 55 push %rbp 0.00 : 495e61: 48 89 e5 mov %rsp,%rbp 0.00 : 495e64: 41 57 push %r15 0.00 : 495e66: 41 56 push %r14 0.00 : 495e68: 49 89 fe mov %rdi,%r14 0.00 : 495e6b: 41 55 push %r13 0.00 : 495e6d: 41 54 push %r12 0.00 : 495e6f: 53 push %rbx 0.00 : 495e70: 48 83 ec 78 sub $0x78,%rsp 0.00 : 495e74: 89 b5 6c ff ff ff mov %esi,-0x94(%rbp) : bool all_visible; : : Assert(page < scan->rs_nblocks); : : /* release previous scan buffer, if any */ : if (BufferIsValid(scan->rs_cbuf)) 0.00 : 495e7a: 8b 7f 64 mov 0x64(%rdi),%edi 0.00 : 495e7d: 85 ff test %edi,%edi 0.00 : 495e7f: 0f 85 fb 01 00 00 jne 496080 : /* : * Be sure to check for interrupts at least once per page. Checks at : * higher code levels won't be able to stop a seqscan that encounters many : * pages' worth of consecutive dead tuples. : */ : CHECK_FOR_INTERRUPTS(); 0.00 : 495e85: 0f b6 05 04 42 72 00 movzbl 0x724204(%rip),%eax # bba090 0.00 : 495e8c: 84 c0 test %al,%al 0.00 : 495e8e: 0f 85 d4 01 00 00 jne 496068 : : /* read page using selected strategy */ : scan->rs_cbuf = ReadBufferExtended(scan->rs_rd, MAIN_FORKNUM, page, 0.00 : 495e94: 4d 8b 46 38 mov 0x38(%r14),%r8 0.00 : 495e98: 8b 95 6c ff ff ff mov -0x94(%rbp),%edx 0.00 : 495e9e: 31 c9 xor %ecx,%ecx 0.00 : 495ea0: 49 8b 3e mov (%r14),%rdi 0.00 : 495ea3: 31 f6 xor %esi,%esi 0.00 : 495ea5: e8 c6 06 1e 00 callq 676570 : RBM_NORMAL, scan->rs_strategy); : scan->rs_cblock = page; : : if (!scan->rs_pageatatime) 0.00 : 495eaa: 41 80 7e 21 00 cmpb $0x0,0x21(%r14) : * pages' worth of consecutive dead tuples. : */ : CHECK_FOR_INTERRUPTS(); : : /* read page using selected strategy */ : scan->rs_cbuf = ReadBufferExtended(scan->rs_rd, MAIN_FORKNUM, page, 0.00 : 495eaf: 41 89 c7 mov %eax,%r15d 0.00 : 495eb2: 41 89 46 64 mov %eax,0x64(%r14) : RBM_NORMAL, scan->rs_strategy); : scan->rs_cblock = page; 0.00 : 495eb6: 8b 85 6c ff ff ff mov -0x94(%rbp),%eax 0.00 : 495ebc: 41 89 46 60 mov %eax,0x60(%r14) : : if (!scan->rs_pageatatime) 0.00 : 495ec0: 75 16 jne 495ed8 : : LockBuffer(buffer, BUFFER_LOCK_UNLOCK); : : Assert(ntup <= MaxHeapTuplesPerPage); : scan->rs_ntuples = ntup; : } 0.00 : 495ec2: 48 83 c4 78 add $0x78,%rsp 0.00 : 495ec6: 5b pop %rbx 0.00 : 495ec7: 41 5c pop %r12 0.00 : 495ec9: 41 5d pop %r13 0.00 : 495ecb: 41 5e pop %r14 0.00 : 495ecd: 41 5f pop %r15 0.00 : 495ecf: c9 leaveq 0.00 : 495ed0: c3 retq 0.00 : 495ed1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : : if (!scan->rs_pageatatime) : return; : : buffer = scan->rs_cbuf; : snapshot = scan->rs_snapshot; 0.00 : 495ed8: 49 8b 4e 08 mov 0x8(%r14),%rcx : : /* : * Prune and repair fragmentation for the whole page, if possible. : */ : heap_page_prune_opt(scan->rs_rd, buffer); 0.00 : 495edc: 44 89 fe mov %r15d,%esi : : if (!scan->rs_pageatatime) : return; : : buffer = scan->rs_cbuf; : snapshot = scan->rs_snapshot; 0.00 : 495edf: 48 89 4d 88 mov %rcx,-0x78(%rbp) : : /* : * Prune and repair fragmentation for the whole page, if possible. : */ : heap_page_prune_opt(scan->rs_rd, buffer); 0.00 : 495ee3: 49 8b 3e mov (%r14),%rdi 0.00 : 495ee6: e8 65 97 00 00 callq 49f650 : /* : * We must hold share lock on the buffer content while examining tuple : * visibility. Afterwards, however, the tuples we have found to be : * visible are guaranteed good as long as we hold the buffer pin. : */ : LockBuffer(buffer, BUFFER_LOCK_SHARE); 0.00 : 495eeb: be 01 00 00 00 mov $0x1,%esi 0.00 : 495ef0: 44 89 ff mov %r15d,%edi 0.00 : 495ef3: e8 18 e8 1d 00 callq 674710 : : dp = (Page) BufferGetPage(buffer); 0.00 : 495ef8: 45 85 ff test %r15d,%r15d 0.00 : 495efb: 0f 88 cf 01 00 00 js 4960d0 0.00 : 495f01: 41 8d 47 ff lea -0x1(%r15),%eax 0.00 : 495f05: 48 63 d8 movslq %eax,%rbx 0.00 : 495f08: 48 c1 e3 0d shl $0xd,%rbx 0.00 : 495f0c: 48 03 1d e5 9b 72 00 add 0x729be5(%rip),%rbx # bbfaf8 : lines = PageGetMaxOffsetNumber(dp); 0.00 : 495f13: 0f b7 43 0c movzwl 0xc(%rbx),%eax 0.00 : 495f17: c7 45 90 00 00 00 00 movl $0x0,-0x70(%rbp) 0.00 : 495f1e: 66 83 f8 18 cmp $0x18,%ax 0.00 : 495f22: 0f 87 88 01 00 00 ja 4960b0 : * the page-level flag can be trusted in the same way, because it might : * get propagated somehow without being explicitly WAL-logged, e.g. via a : * full page write. Until we can prove that beyond doubt, let's check each : * tuple for visibility the hard way. : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; 0.00 : 495f28: c6 45 af 00 movb $0x0,-0x51(%rbp) 0.00 : 495f2c: f6 43 0a 04 testb $0x4,0xa(%rbx) 0.00 : 495f30: 0f 85 62 01 00 00 jne 496098 : : for (lineoff = FirstOffsetNumber, lpp = PageGetItemId(dp, lineoff); : lineoff <= lines; 0.00 : 495f36: 8b 7d 90 mov -0x70(%rbp),%edi : lineoff++, lpp++) 0.00 : 495f39: c7 45 a8 00 00 00 00 movl $0x0,-0x58(%rbp) : * tuple for visibility the hard way. : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; : : for (lineoff = FirstOffsetNumber, lpp = PageGetItemId(dp, lineoff); : lineoff <= lines; 0.00 : 495f40: 85 ff test %edi,%edi 0.00 : 495f42: 0f 8e c8 00 00 00 jle 496010 : bool valid; : : loctup.t_tableOid = RelationGetRelid(scan->rs_rd); : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); : loctup.t_len = ItemIdGetLength(lpp); : ItemPointerSet(&(loctup.t_self), page, lineoff); 0.00 : 495f48: 8b 8d 6c ff ff ff mov -0x94(%rbp),%ecx : * full page write. Until we can prove that beyond doubt, let's check each : * tuple for visibility the hard way. : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; : : for (lineoff = FirstOffsetNumber, lpp = PageGetItemId(dp, lineoff); 0.00 : 495f4e: 4c 8d 6b 18 lea 0x18(%rbx),%r13 : bool valid; : : loctup.t_tableOid = RelationGetRelid(scan->rs_rd); : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); : loctup.t_len = ItemIdGetLength(lpp); : ItemPointerSet(&(loctup.t_self), page, lineoff); 0.00 : 495f52: 41 bc 01 00 00 00 mov $0x1,%r12d 0.00 : 495f58: c1 e9 10 shr $0x10,%ecx 0.00 : 495f5b: 66 89 8d 70 ff ff ff mov %cx,-0x90(%rbp) 0.00 : 495f62: eb 19 jmp 495f7d 0.00 : 495f64: 0f 1f 40 00 nopl 0x0(%rax) : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; : : for (lineoff = FirstOffsetNumber, lpp = PageGetItemId(dp, lineoff); : lineoff <= lines; : lineoff++, lpp++) 0.00 : 495f68: 41 83 c4 01 add $0x1,%r12d : * tuple for visibility the hard way. : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; : : for (lineoff = FirstOffsetNumber, lpp = PageGetItemId(dp, lineoff); : lineoff <= lines; 0.00 : 495f6c: 41 0f b7 c4 movzwl %r12w,%eax 0.00 : 495f70: 39 45 90 cmp %eax,-0x70(%rbp) 0.00 : 495f73: 0f 8c 97 00 00 00 jl 496010 : lineoff++, lpp++) 0.00 : 495f79: 49 83 c5 04 add $0x4,%r13 : { : if (ItemIdIsNormal(lpp)) 0.00 : 495f7d: 41 8b 45 00 mov 0x0(%r13),%eax 0.00 : 495f81: 25 00 80 01 00 and $0x18000,%eax 0.00 : 495f86: 3d 00 80 00 00 cmp $0x8000,%eax 0.00 : 495f8b: 75 db jne 495f68 : { : HeapTupleData loctup; : bool valid; : : loctup.t_tableOid = RelationGetRelid(scan->rs_rd); 0.00 : 495f8d: 49 8b 36 mov (%r14),%rsi : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); : loctup.t_len = ItemIdGetLength(lpp); : ItemPointerSet(&(loctup.t_self), page, lineoff); 0.00 : 495f90: 0f b7 8d 6c ff ff ff movzwl -0x94(%rbp),%ecx : if (ItemIdIsNormal(lpp)) : { : HeapTupleData loctup; : bool valid; : : loctup.t_tableOid = RelationGetRelid(scan->rs_rd); 0.00 : 495f97: 8b 46 40 mov 0x40(%rsi),%eax 0.00 : 495f9a: 89 45 bc mov %eax,-0x44(%rbp) : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); 0.00 : 495f9d: 41 0f b7 45 00 movzwl 0x0(%r13),%eax 0.00 : 495fa2: 25 ff 7f 00 00 and $0x7fff,%eax 0.00 : 495fa7: 48 8d 04 03 lea (%rbx,%rax,1),%rax 0.00 : 495fab: 48 89 45 c0 mov %rax,-0x40(%rbp) : loctup.t_len = ItemIdGetLength(lpp); 0.00 : 495faf: 41 0f b7 45 02 movzwl 0x2(%r13),%eax : ItemPointerSet(&(loctup.t_self), page, lineoff); 0.00 : 495fb4: 66 89 4d b6 mov %cx,-0x4a(%rbp) 0.00 : 495fb8: 66 44 89 65 b8 mov %r12w,-0x48(%rbp) : HeapTupleData loctup; : bool valid; : : loctup.t_tableOid = RelationGetRelid(scan->rs_rd); : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); : loctup.t_len = ItemIdGetLength(lpp); 0.00 : 495fbd: 66 d1 e8 shr %ax : ItemPointerSet(&(loctup.t_self), page, lineoff); : : if (all_visible) 0.00 : 495fc0: 80 7d af 00 cmpb $0x0,-0x51(%rbp) : HeapTupleData loctup; : bool valid; : : loctup.t_tableOid = RelationGetRelid(scan->rs_rd); : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lpp); : loctup.t_len = ItemIdGetLength(lpp); /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:403 11.11 : 495fc4: 0f b7 c0 movzwl %ax,%eax 22.22 : 495fc7: 89 45 b0 mov %eax,-0x50(%rbp) : ItemPointerSet(&(loctup.t_self), page, lineoff); 0.00 : 495fca: 0f b7 85 70 ff ff ff movzwl -0x90(%rbp),%eax 0.00 : 495fd1: 66 89 45 b4 mov %ax,-0x4c(%rbp) : : if (all_visible) 0.00 : 495fd5: 74 59 je 496030 : valid = true; : else : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); : : CheckForSerializableConflictOut(valid, scan->rs_rd, &loctup, 0.00 : 495fd7: 4c 8b 45 88 mov -0x78(%rbp),%r8 0.00 : 495fdb: 48 8d 55 b0 lea -0x50(%rbp),%rdx 0.00 : 495fdf: 44 89 f9 mov %r15d,%ecx 0.00 : 495fe2: bf 01 00 00 00 mov $0x1,%edi 0.00 : 495fe7: e8 74 e6 1f 00 callq 694660 : buffer, snapshot); : : if (valid) : scan->rs_vistuples[ntup++] = lineoff; 0.00 : 495fec: 48 63 45 a8 movslq -0x58(%rbp),%rax 0.00 : 495ff0: 66 45 89 64 46 7c mov %r12w,0x7c(%r14,%rax,2) : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; : : for (lineoff = FirstOffsetNumber, lpp = PageGetItemId(dp, lineoff); : lineoff <= lines; : lineoff++, lpp++) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:394 33.33 : 495ff6: 41 83 c4 01 add $0x1,%r12d : : CheckForSerializableConflictOut(valid, scan->rs_rd, &loctup, : buffer, snapshot); : : if (valid) : scan->rs_vistuples[ntup++] = lineoff; 0.00 : 495ffa: 83 45 a8 01 addl $0x1,-0x58(%rbp) : * tuple for visibility the hard way. : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; : : for (lineoff = FirstOffsetNumber, lpp = PageGetItemId(dp, lineoff); : lineoff <= lines; 0.00 : 495ffe: 41 0f b7 c4 movzwl %r12w,%eax 0.00 : 496002: 39 45 90 cmp %eax,-0x70(%rbp) 0.00 : 496005: 0f 8d 6e ff ff ff jge 495f79 0.00 : 49600b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : if (valid) : scan->rs_vistuples[ntup++] = lineoff; : } : } : : LockBuffer(buffer, BUFFER_LOCK_UNLOCK); 0.00 : 496010: 44 89 ff mov %r15d,%edi 0.00 : 496013: 31 f6 xor %esi,%esi 0.00 : 496015: e8 f6 e6 1d 00 callq 674710 : : Assert(ntup <= MaxHeapTuplesPerPage); : scan->rs_ntuples = ntup; 0.00 : 49601a: 8b 45 a8 mov -0x58(%rbp),%eax 0.00 : 49601d: 41 89 46 78 mov %eax,0x78(%r14) : } 0.00 : 496021: 48 83 c4 78 add $0x78,%rsp 0.00 : 496025: 5b pop %rbx 0.00 : 496026: 41 5c pop %r12 0.00 : 496028: 41 5d pop %r13 0.00 : 49602a: 41 5e pop %r14 0.00 : 49602c: 41 5f pop %r15 0.00 : 49602e: c9 leaveq 0.00 : 49602f: c3 retq : ItemPointerSet(&(loctup.t_self), page, lineoff); : : if (all_visible) : valid = true; : else : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:409 11.11 : 496030: 48 8b 75 88 mov -0x78(%rbp),%rsi 0.00 : 496034: 44 89 fa mov %r15d,%edx 0.00 : 496037: 48 8d 7d b0 lea -0x50(%rbp),%rdi 0.00 : 49603b: ff 16 callq *(%rsi) : : CheckForSerializableConflictOut(valid, scan->rs_rd, &loctup, 0.00 : 49603d: 4c 8b 45 88 mov -0x78(%rbp),%r8 : ItemPointerSet(&(loctup.t_self), page, lineoff); : : if (all_visible) : valid = true; : else : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); 11.11 : 496041: 88 45 ae mov %al,-0x52(%rbp) : : CheckForSerializableConflictOut(valid, scan->rs_rd, &loctup, /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:411 11.11 : 496044: 48 8d 55 b0 lea -0x50(%rbp),%rdx 0.00 : 496048: 49 8b 36 mov (%r14),%rsi 0.00 : 49604b: 0f be f8 movsbl %al,%edi 0.00 : 49604e: 44 89 f9 mov %r15d,%ecx 0.00 : 496051: e8 0a e6 1f 00 callq 694660 : buffer, snapshot); : : if (valid) 0.00 : 496056: 80 7d ae 00 cmpb $0x0,-0x52(%rbp) 0.00 : 49605a: 0f 84 08 ff ff ff je 495f68 0.00 : 496060: eb 8a jmp 495fec 0.00 : 496062: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 496068: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 49606f: 00 : /* : * Be sure to check for interrupts at least once per page. Checks at : * higher code levels won't be able to stop a seqscan that encounters many : * pages' worth of consecutive dead tuples. : */ : CHECK_FOR_INTERRUPTS(); 0.00 : 496070: e8 2b 62 20 00 callq 69c2a0 0.00 : 496075: 0f 1f 00 nopl (%rax) 0.00 : 496078: e9 17 fe ff ff jmpq 495e94 0.00 : 49607d: 0f 1f 00 nopl (%rax) : Assert(page < scan->rs_nblocks); : : /* release previous scan buffer, if any */ : if (BufferIsValid(scan->rs_cbuf)) : { : ReleaseBuffer(scan->rs_cbuf); 0.00 : 496080: e8 db ed 1d 00 callq 674e60 : scan->rs_cbuf = InvalidBuffer; 0.00 : 496085: 41 c7 46 64 00 00 00 movl $0x0,0x64(%r14) 0.00 : 49608c: 00 0.00 : 49608d: 0f 1f 00 nopl (%rax) 0.00 : 496090: e9 f0 fd ff ff jmpq 495e85 0.00 : 496095: 0f 1f 00 nopl (%rax) : * the page-level flag can be trusted in the same way, because it might : * get propagated somehow without being explicitly WAL-logged, e.g. via a : * full page write. Until we can prove that beyond doubt, let's check each : * tuple for visibility the hard way. : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; 0.00 : 496098: 48 8b 45 88 mov -0x78(%rbp),%rax 0.00 : 49609c: 80 78 29 00 cmpb $0x0,0x29(%rax) 0.00 : 4960a0: 0f 94 45 af sete -0x51(%rbp) 0.00 : 4960a4: e9 8d fe ff ff jmpq 495f36 0.00 : 4960a9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * visible are guaranteed good as long as we hold the buffer pin. : */ : LockBuffer(buffer, BUFFER_LOCK_SHARE); : : dp = (Page) BufferGetPage(buffer); : lines = PageGetMaxOffsetNumber(dp); 0.00 : 4960b0: 0f b7 c0 movzwl %ax,%eax : * the page-level flag can be trusted in the same way, because it might : * get propagated somehow without being explicitly WAL-logged, e.g. via a : * full page write. Until we can prove that beyond doubt, let's check each : * tuple for visibility the hard way. : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; 0.00 : 4960b3: c6 45 af 00 movb $0x0,-0x51(%rbp) : * visible are guaranteed good as long as we hold the buffer pin. : */ : LockBuffer(buffer, BUFFER_LOCK_SHARE); : : dp = (Page) BufferGetPage(buffer); : lines = PageGetMaxOffsetNumber(dp); 0.00 : 4960b7: 48 83 e8 18 sub $0x18,%rax 0.00 : 4960bb: 48 c1 e8 02 shr $0x2,%rax 0.00 : 4960bf: 89 45 90 mov %eax,-0x70(%rbp) : * the page-level flag can be trusted in the same way, because it might : * get propagated somehow without being explicitly WAL-logged, e.g. via a : * full page write. Until we can prove that beyond doubt, let's check each : * tuple for visibility the hard way. : */ : all_visible = PageIsAllVisible(dp) && !snapshot->takenDuringRecovery; 0.00 : 4960c2: f6 43 0a 04 testb $0x4,0xa(%rbx) 0.00 : 4960c6: 0f 84 6a fe ff ff je 495f36 0.00 : 4960cc: eb ca jmp 496098 0.00 : 4960ce: 66 90 xchg %ax,%ax : * visibility. Afterwards, however, the tuples we have found to be : * visible are guaranteed good as long as we hold the buffer pin. : */ : LockBuffer(buffer, BUFFER_LOCK_SHARE); : : dp = (Page) BufferGetPage(buffer); 0.00 : 4960d0: 44 89 f8 mov %r15d,%eax 0.00 : 4960d3: 48 8b 15 3e 70 6e 00 mov 0x6e703e(%rip),%rdx # b7d118 0.00 : 4960da: f7 d0 not %eax 0.00 : 4960dc: 48 98 cltq 0.00 : 4960de: 48 8b 1c c2 mov (%rdx,%rax,8),%rbx 0.00 : 4960e2: e9 2c fe ff ff jmpq 495f13 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:654 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:654 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:323 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:736 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:740 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:759 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:928 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:928 11.11 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:336 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000798110 : : * MAXALIGN_DOWN(SIZE_MAX) - ALLOC_BLOCKHDRSZ - ALLOC_CHUNKHDRSZ : * All callers use a much-lower limit. : */ : static void * : AllocSetAlloc(MemoryContext context, Size size) : { /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:654 11.11 : 798110: 55 push %rbp 0.00 : 798111: 48 89 e5 mov %rsp,%rbp 0.00 : 798114: 4c 89 65 e0 mov %r12,-0x20(%rbp) 0.00 : 798118: 4c 89 75 f0 mov %r14,-0x10(%rbp) 0.00 : 79811c: 49 89 fc mov %rdi,%r12 0.00 : 79811f: 48 89 5d d8 mov %rbx,-0x28(%rbp) 11.11 : 798123: 4c 89 6d e8 mov %r13,-0x18(%rbp) 0.00 : 798127: 49 89 f6 mov %rsi,%r14 0.00 : 79812a: 4c 89 7d f8 mov %r15,-0x8(%rbp) 0.00 : 79812e: 48 83 ec 30 sub $0x30,%rsp : : /* : * If requested size exceeds maximum for chunks, allocate an entire block : * for this request. : */ : if (size > set->allocChunkLimit) 0.00 : 798132: 48 39 b7 b0 00 00 00 cmp %rsi,0xb0(%rdi) 0.00 : 798139: 72 6d jb 7981a8 : { : int idx; : unsigned int t, : tsize; : : if (size > (1 << ALLOC_MINBITS)) 0.00 : 79813b: 31 f6 xor %esi,%esi /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:323 11.11 : 79813d: 49 83 fe 08 cmp $0x8,%r14 0.00 : 798141: 77 3d ja 798180 : * corresponding free list to see if there is a free chunk we could reuse. : * If one is found, remove it from the free list, make it again a member : * of the alloc set and return its data address. : */ : fidx = AllocSetFreeIndex(size); : chunk = set->freelist[fidx]; 0.00 : 798143: 48 63 c6 movslq %esi,%rax 0.00 : 798146: 48 8d 48 08 lea 0x8(%rax),%rcx 0.00 : 79814a: 49 8b 14 cc mov (%r12,%rcx,8),%rdx : if (chunk != NULL) /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:736 11.11 : 79814e: 48 85 d2 test %rdx,%rdx 0.00 : 798151: 0f 84 c9 00 00 00 je 798220 : { : Assert(chunk->size >= size); : : set->freelist[fidx] = (AllocChunk) chunk->aset; 0.00 : 798157: 48 8b 02 mov (%rdx),%rax /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:740 11.11 : 79815a: 49 89 04 cc mov %rax,(%r12,%rcx,8) : /* fill the allocated space with junk */ : randomize_mem((char *) AllocChunkGetPointer(chunk), size); : #endif : : AllocAllocInfo(set, chunk); : return AllocChunkGetPointer(chunk); /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:759 11.11 : 79815e: 48 8d 42 10 lea 0x10(%rdx),%rax : { : Assert(chunk->size >= size); : : set->freelist[fidx] = (AllocChunk) chunk->aset; : : chunk->aset = (void *) set; 0.00 : 798162: 4c 89 22 mov %r12,(%rdx) : randomize_mem((char *) AllocChunkGetPointer(chunk), size); : #endif : : AllocAllocInfo(set, chunk); : return AllocChunkGetPointer(chunk); : } 0.00 : 798165: 48 8b 5d d8 mov -0x28(%rbp),%rbx 0.00 : 798169: 4c 8b 65 e0 mov -0x20(%rbp),%r12 0.00 : 79816d: 4c 8b 6d e8 mov -0x18(%rbp),%r13 0.00 : 798171: 4c 8b 75 f0 mov -0x10(%rbp),%r14 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:928 11.11 : 798175: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 798179: c9 leaveq 11.11 : 79817a: c3 retq 0.00 : 79817b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : unsigned int t, : tsize; : : if (size > (1 << ALLOC_MINBITS)) : { : tsize = (size - 1) >> ALLOC_MINBITS; 0.00 : 798180: 49 8d 46 ff lea -0x1(%r14),%rax 0.00 : 798184: 48 89 c2 mov %rax,%rdx 0.00 : 798187: 48 c1 ea 03 shr $0x3,%rdx : * justify micro-optimization effort. The best approach seems to be : * to use a lookup table. Note that this code assumes that : * ALLOCSET_NUM_FREELISTS <= 17, since we only cope with two bytes of : * the tsize value. : */ : t = tsize >> 8; 0.00 : 79818b: 89 d0 mov %edx,%eax /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:336 11.11 : 79818d: c1 e8 08 shr $0x8,%eax : idx = t ? LogTable256[t] + 8 : LogTable256[tsize]; 0.00 : 798190: 85 c0 test %eax,%eax 0.00 : 798192: 74 7c je 798210 0.00 : 798194: 89 c0 mov %eax,%eax 0.00 : 798196: 0f b6 80 80 1e 8e 00 movzbl 0x8e1e80(%rax),%eax 0.00 : 79819d: 8d 70 08 lea 0x8(%rax),%esi 0.00 : 7981a0: eb a1 jmp 798143 0.00 : 7981a2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * If requested size exceeds maximum for chunks, allocate an entire block : * for this request. : */ : if (size > set->allocChunkLimit) : { : chunk_size = MAXALIGN(size); 0.00 : 7981a8: 48 8d 5e 07 lea 0x7(%rsi),%rbx 0.00 : 7981ac: 48 83 e3 f8 and $0xfffffffffffffff8,%rbx : blksize = chunk_size + ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ; 0.00 : 7981b0: 4c 8d 6b 30 lea 0x30(%rbx),%r13 : block = (AllocBlock) malloc(blksize); 0.00 : 7981b4: 4c 89 ef mov %r13,%rdi 0.00 : 7981b7: e8 74 14 cd ff callq 469630 : if (block == NULL) 0.00 : 7981bc: 48 85 c0 test %rax,%rax : */ : if (size > set->allocChunkLimit) : { : chunk_size = MAXALIGN(size); : blksize = chunk_size + ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ; : block = (AllocBlock) malloc(blksize); 0.00 : 7981bf: 48 89 c2 mov %rax,%rdx : if (block == NULL) 0.00 : 7981c2: 0f 84 2e 02 00 00 je 7983f6 : ereport(ERROR, : (errcode(ERRCODE_OUT_OF_MEMORY), : errmsg("out of memory"), : errdetail("Failed on request of size %zu.", size))); : } : block->aset = set; 0.00 : 7981c8: 4c 89 20 mov %r12,(%rax) : block->freeptr = block->endptr = ((char *) block) + blksize; : : chunk = (AllocChunk) (((char *) block) + ALLOC_BLOCKHDRSZ); 0.00 : 7981cb: 48 8d 72 20 lea 0x20(%rdx),%rsi : (errcode(ERRCODE_OUT_OF_MEMORY), : errmsg("out of memory"), : errdetail("Failed on request of size %zu.", size))); : } : block->aset = set; : block->freeptr = block->endptr = ((char *) block) + blksize; 0.00 : 7981cf: 4a 8d 04 28 lea (%rax,%r13,1),%rax : : chunk = (AllocChunk) (((char *) block) + ALLOC_BLOCKHDRSZ); : chunk->aset = set; 0.00 : 7981d3: 4c 89 62 20 mov %r12,0x20(%rdx) : (errcode(ERRCODE_OUT_OF_MEMORY), : errmsg("out of memory"), : errdetail("Failed on request of size %zu.", size))); : } : block->aset = set; : block->freeptr = block->endptr = ((char *) block) + blksize; 0.00 : 7981d7: 48 89 42 18 mov %rax,0x18(%rdx) 0.00 : 7981db: 48 89 42 10 mov %rax,0x10(%rdx) : : chunk = (AllocChunk) (((char *) block) + ALLOC_BLOCKHDRSZ); : chunk->aset = set; : chunk->size = chunk_size; 0.00 : 7981df: 48 89 5e 08 mov %rbx,0x8(%rsi) : : /* : * Stick the new block underneath the active allocation block, so that : * we don't lose the use of the space remaining therein. : */ : if (set->blocks != NULL) 0.00 : 7981e3: 49 8b 4c 24 38 mov 0x38(%r12),%rcx 0.00 : 7981e8: 48 85 c9 test %rcx,%rcx 0.00 : 7981eb: 0f 84 cf 01 00 00 je 7983c0 : { : block->next = set->blocks->next; 0.00 : 7981f1: 48 8b 41 08 mov 0x8(%rcx),%rax 0.00 : 7981f5: 48 89 42 08 mov %rax,0x8(%rdx) : set->blocks->next = block; 0.00 : 7981f9: 48 89 51 08 mov %rdx,0x8(%rcx) : * if any, NOACCESS. : */ : VALGRIND_MAKE_MEM_NOACCESS((char *) chunk + ALLOC_CHUNK_PUBLIC, : chunk_size + ALLOC_CHUNKHDRSZ - ALLOC_CHUNK_PUBLIC); : : return AllocChunkGetPointer(chunk); 0.00 : 7981fd: 48 8d 46 10 lea 0x10(%rsi),%rax : randomize_mem((char *) AllocChunkGetPointer(chunk), size); : #endif : : AllocAllocInfo(set, chunk); : return AllocChunkGetPointer(chunk); : } 0.00 : 798201: e9 5f ff ff ff jmpq 798165 0.00 : 798206: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 79820d: 00 00 00 : * to use a lookup table. Note that this code assumes that : * ALLOCSET_NUM_FREELISTS <= 17, since we only cope with two bytes of : * the tsize value. : */ : t = tsize >> 8; : idx = t ? LogTable256[t] + 8 : LogTable256[tsize]; 0.00 : 798210: 89 d0 mov %edx,%eax 0.00 : 798212: 0f b6 b0 80 1e 8e 00 movzbl 0x8e1e80(%rax),%esi 0.00 : 798219: e9 25 ff ff ff jmpq 798143 0.00 : 79821e: 66 90 xchg %ax,%ax : : /* : * If there is enough room in the active allocation block, we will put the : * chunk into that block. Else must start a new one. : */ : if ((block = set->blocks) != NULL) 0.00 : 798220: 4d 8b 4c 24 38 mov 0x38(%r12),%r9 : } : : /* : * Choose the actual chunk size to allocate. : */ : chunk_size = (1 << ALLOC_MINBITS) << fidx; 0.00 : 798225: b8 08 00 00 00 mov $0x8,%eax 0.00 : 79822a: 89 f1 mov %esi,%ecx 0.00 : 79822c: d3 e0 shl %cl,%eax 0.00 : 79822e: 4c 63 f8 movslq %eax,%r15 : : /* : * If there is enough room in the active allocation block, we will put the : * chunk into that block. Else must start a new one. : */ : if ((block = set->blocks) != NULL) 0.00 : 798231: 4d 85 c9 test %r9,%r9 0.00 : 798234: 0f 84 ce 00 00 00 je 798308 : { : Size availspace = block->endptr - block->freeptr; 0.00 : 79823a: 49 8b 79 10 mov 0x10(%r9),%rdi 0.00 : 79823e: 4d 8b 41 18 mov 0x18(%r9),%r8 : : if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 0.00 : 798242: 49 8d 47 10 lea 0x10(%r15),%rax : * If there is enough room in the active allocation block, we will put the : * chunk into that block. Else must start a new one. : */ : if ((block = set->blocks) != NULL) : { : Size availspace = block->endptr - block->freeptr; 0.00 : 798246: 49 29 f8 sub %rdi,%r8 : : if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 0.00 : 798249: 49 39 c0 cmp %rax,%r8 0.00 : 79824c: 0f 83 52 01 00 00 jae 7983a4 : * : * Because we can only get here when there's less than : * ALLOC_CHUNK_LIMIT left in the block, this loop cannot iterate : * more than ALLOCSET_NUM_FREELISTS-1 times. : */ : while (availspace >= ((1 << ALLOC_MINBITS) + ALLOC_CHUNKHDRSZ)) 0.00 : 798252: 49 83 f8 17 cmp $0x17,%r8 0.00 : 798256: 0f 86 ac 00 00 00 jbe 798308 : * to use a lookup table. Note that this code assumes that : * ALLOCSET_NUM_FREELISTS <= 17, since we only cope with two bytes of : * the tsize value. : */ : t = tsize >> 8; : idx = t ? LogTable256[t] + 8 : LogTable256[tsize]; 0.00 : 79825c: 41 ba 01 00 00 00 mov $0x1,%r10d : : /* Prepare to initialize the chunk header. */ : VALGRIND_MAKE_MEM_UNDEFINED(chunk, ALLOC_CHUNK_USED); : : block->freeptr += (availchunk + ALLOC_CHUNKHDRSZ); : availspace -= (availchunk + ALLOC_CHUNKHDRSZ); 0.00 : 798262: 49 c7 c3 f0 ff ff ff mov $0xfffffffffffffff0,%r11 0.00 : 798269: eb 5d jmp 7982c8 0.00 : 79826b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : * to use a lookup table. Note that this code assumes that : * ALLOCSET_NUM_FREELISTS <= 17, since we only cope with two bytes of : * the tsize value. : */ : t = tsize >> 8; : idx = t ? LogTable256[t] + 8 : LogTable256[tsize]; 0.00 : 798270: 89 c0 mov %eax,%eax 0.00 : 798272: 0f b6 88 80 1e 8e 00 movzbl 0x8e1e80(%rax),%ecx 0.00 : 798279: 4c 89 d0 mov %r10,%rax 0.00 : 79827c: 8d 51 08 lea 0x8(%rcx),%edx 0.00 : 79827f: 83 c1 0b add $0xb,%ecx 0.00 : 798282: 48 d3 e0 shl %cl,%rax : /* : * In most cases, we'll get back the index of the next larger : * freelist than the one we need to put this chunk on. The : * exception is when availchunk is exactly a power of 2. : */ : if (availchunk != ((Size) 1 << (a_fidx + ALLOC_MINBITS))) 0.00 : 798285: 48 39 c6 cmp %rax,%rsi 0.00 : 798288: 74 0c je 798296 : { : a_fidx--; 0.00 : 79828a: 83 ea 01 sub $0x1,%edx : Assert(a_fidx >= 0); : availchunk = ((Size) 1 << (a_fidx + ALLOC_MINBITS)); 0.00 : 79828d: 4c 89 d6 mov %r10,%rsi 0.00 : 798290: 8d 4a 03 lea 0x3(%rdx),%ecx 0.00 : 798293: 48 d3 e6 shl %cl,%rsi : chunk = (AllocChunk) (block->freeptr); : : /* Prepare to initialize the chunk header. */ : VALGRIND_MAKE_MEM_UNDEFINED(chunk, ALLOC_CHUNK_USED); : : block->freeptr += (availchunk + ALLOC_CHUNKHDRSZ); 0.00 : 798296: 48 8d 44 37 10 lea 0x10(%rdi,%rsi,1),%rax 0.00 : 79829b: 49 89 41 10 mov %rax,0x10(%r9) : availspace -= (availchunk + ALLOC_CHUNKHDRSZ); 0.00 : 79829f: 4c 89 d8 mov %r11,%rax : : chunk->size = availchunk; 0.00 : 7982a2: 48 89 77 08 mov %rsi,0x8(%rdi) : : /* Prepare to initialize the chunk header. */ : VALGRIND_MAKE_MEM_UNDEFINED(chunk, ALLOC_CHUNK_USED); : : block->freeptr += (availchunk + ALLOC_CHUNKHDRSZ); : availspace -= (availchunk + ALLOC_CHUNKHDRSZ); 0.00 : 7982a6: 48 29 f0 sub %rsi,%rax 0.00 : 7982a9: 49 01 c0 add %rax,%r8 : : chunk->size = availchunk; : #ifdef MEMORY_CONTEXT_CHECKING : chunk->requested_size = 0; /* mark it free */ : #endif : chunk->aset = (void *) set->freelist[a_fidx]; 0.00 : 7982ac: 48 63 c2 movslq %edx,%rax 0.00 : 7982af: 48 83 c0 08 add $0x8,%rax : * : * Because we can only get here when there's less than : * ALLOC_CHUNK_LIMIT left in the block, this loop cannot iterate : * more than ALLOCSET_NUM_FREELISTS-1 times. : */ : while (availspace >= ((1 << ALLOC_MINBITS) + ALLOC_CHUNKHDRSZ)) 0.00 : 7982b3: 49 83 f8 17 cmp $0x17,%r8 : : chunk->size = availchunk; : #ifdef MEMORY_CONTEXT_CHECKING : chunk->requested_size = 0; /* mark it free */ : #endif : chunk->aset = (void *) set->freelist[a_fidx]; 0.00 : 7982b7: 49 8b 14 c4 mov (%r12,%rax,8),%rdx 0.00 : 7982bb: 48 89 17 mov %rdx,(%rdi) : set->freelist[a_fidx] = chunk; 0.00 : 7982be: 49 89 3c c4 mov %rdi,(%r12,%rax,8) : * : * Because we can only get here when there's less than : * ALLOC_CHUNK_LIMIT left in the block, this loop cannot iterate : * more than ALLOCSET_NUM_FREELISTS-1 times. : */ : while (availspace >= ((1 << ALLOC_MINBITS) + ALLOC_CHUNKHDRSZ)) 0.00 : 7982c2: 76 44 jbe 798308 0.00 : 7982c4: 49 8b 79 10 mov 0x10(%r9),%rdi : { : Size availchunk = availspace - ALLOC_CHUNKHDRSZ; 0.00 : 7982c8: 49 8d 70 f0 lea -0x10(%r8),%rsi : { : int idx; : unsigned int t, : tsize; : : if (size > (1 << ALLOC_MINBITS)) 0.00 : 7982cc: 31 d2 xor %edx,%edx 0.00 : 7982ce: b8 08 00 00 00 mov $0x8,%eax 0.00 : 7982d3: 48 83 fe 08 cmp $0x8,%rsi 0.00 : 7982d7: 76 ac jbe 798285 : { : tsize = (size - 1) >> ALLOC_MINBITS; 0.00 : 7982d9: 49 8d 40 ef lea -0x11(%r8),%rax 0.00 : 7982dd: 48 89 c2 mov %rax,%rdx 0.00 : 7982e0: 48 c1 ea 03 shr $0x3,%rdx : * justify micro-optimization effort. The best approach seems to be : * to use a lookup table. Note that this code assumes that : * ALLOCSET_NUM_FREELISTS <= 17, since we only cope with two bytes of : * the tsize value. : */ : t = tsize >> 8; 0.00 : 7982e4: 89 d0 mov %edx,%eax 0.00 : 7982e6: c1 e8 08 shr $0x8,%eax : idx = t ? LogTable256[t] + 8 : LogTable256[tsize]; 0.00 : 7982e9: 85 c0 test %eax,%eax 0.00 : 7982eb: 75 83 jne 798270 0.00 : 7982ed: 89 d0 mov %edx,%eax 0.00 : 7982ef: 0f b6 90 80 1e 8e 00 movzbl 0x8e1e80(%rax),%edx 0.00 : 7982f6: 4c 89 d0 mov %r10,%rax 0.00 : 7982f9: 8d 4a 03 lea 0x3(%rdx),%ecx 0.00 : 7982fc: 48 d3 e0 shl %cl,%rax 0.00 : 7982ff: eb 84 jmp 798285 0.00 : 798301: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : : /* : * The first such block has size initBlockSize, and we double the : * space in each succeeding block, but not more than maxBlockSize. : */ : blksize = set->nextBlockSize; 0.00 : 798308: 49 8b 94 24 a8 00 00 mov 0xa8(%r12),%rdx 0.00 : 79830f: 00 : set->nextBlockSize <<= 1; : if (set->nextBlockSize > set->maxBlockSize) 0.00 : 798310: 49 8b 8c 24 a0 00 00 mov 0xa0(%r12),%rcx 0.00 : 798317: 00 : /* : * The first such block has size initBlockSize, and we double the : * space in each succeeding block, but not more than maxBlockSize. : */ : blksize = set->nextBlockSize; : set->nextBlockSize <<= 1; 0.00 : 798318: 48 8d 04 12 lea (%rdx,%rdx,1),%rax : if (set->nextBlockSize > set->maxBlockSize) 0.00 : 79831c: 48 39 c8 cmp %rcx,%rax : /* : * The first such block has size initBlockSize, and we double the : * space in each succeeding block, but not more than maxBlockSize. : */ : blksize = set->nextBlockSize; : set->nextBlockSize <<= 1; 0.00 : 79831f: 49 89 84 24 a8 00 00 mov %rax,0xa8(%r12) 0.00 : 798326: 00 : if (set->nextBlockSize > set->maxBlockSize) 0.00 : 798327: 76 08 jbe 798331 : set->nextBlockSize = set->maxBlockSize; 0.00 : 798329: 49 89 8c 24 a8 00 00 mov %rcx,0xa8(%r12) 0.00 : 798330: 00 : : /* : * If initBlockSize is less than ALLOC_CHUNK_LIMIT, we could need more : * space... but try to keep it a power of 2. : */ : required_size = chunk_size + ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ; 0.00 : 798331: 4d 8d 6f 30 lea 0x30(%r15),%r13 : while (blksize < required_size) 0.00 : 798335: 4c 39 ea cmp %r13,%rdx 0.00 : 798338: 73 0e jae 798348 0.00 : 79833a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : blksize <<= 1; 0.00 : 798340: 48 01 d2 add %rdx,%rdx : /* : * If initBlockSize is less than ALLOC_CHUNK_LIMIT, we could need more : * space... but try to keep it a power of 2. : */ : required_size = chunk_size + ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ; : while (blksize < required_size) 0.00 : 798343: 49 39 d5 cmp %rdx,%r13 0.00 : 798346: 77 f8 ja 798340 0.00 : 798348: 48 89 d3 mov %rdx,%rbx 0.00 : 79834b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : while (block == NULL && blksize > 1024 * 1024) : { : blksize >>= 1; : if (blksize < required_size) : break; : block = (AllocBlock) malloc(blksize); 0.00 : 798350: 48 89 df mov %rbx,%rdi 0.00 : 798353: e8 d8 12 cd ff callq 469630 : : /* : * We could be asking for pretty big blocks here, so cope if malloc : * fails. But give up if there's less than a meg or so available... : */ : while (block == NULL && blksize > 1024 * 1024) 0.00 : 798358: 48 85 c0 test %rax,%rax : { : blksize >>= 1; : if (blksize < required_size) : break; : block = (AllocBlock) malloc(blksize); 0.00 : 79835b: 48 89 c2 mov %rax,%rdx : : /* : * We could be asking for pretty big blocks here, so cope if malloc : * fails. But give up if there's less than a meg or so available... : */ : while (block == NULL && blksize > 1024 * 1024) 0.00 : 79835e: 74 78 je 7983d8 : if (blksize < required_size) : break; : block = (AllocBlock) malloc(blksize); : } : : if (block == NULL) 0.00 : 798360: 48 85 d2 test %rdx,%rdx : : /* : * We could be asking for pretty big blocks here, so cope if malloc : * fails. But give up if there's less than a meg or so available... : */ : while (block == NULL && blksize > 1024 * 1024) 0.00 : 798363: 49 89 d1 mov %rdx,%r9 : if (blksize < required_size) : break; : block = (AllocBlock) malloc(blksize); : } : : if (block == NULL) 0.00 : 798366: 0f 84 10 01 00 00 je 79847c : errmsg("out of memory"), : errdetail("Failed on request of size %zu.", size))); : } : : block->aset = set; : block->freeptr = ((char *) block) + ALLOC_BLOCKHDRSZ; 0.00 : 79836c: 48 8d 42 20 lea 0x20(%rdx),%rax : (errcode(ERRCODE_OUT_OF_MEMORY), : errmsg("out of memory"), : errdetail("Failed on request of size %zu.", size))); : } : : block->aset = set; 0.00 : 798370: 4c 89 22 mov %r12,(%rdx) : block->freeptr = ((char *) block) + ALLOC_BLOCKHDRSZ; 0.00 : 798373: 48 89 42 10 mov %rax,0x10(%rdx) : block->endptr = ((char *) block) + blksize; 0.00 : 798377: 48 8d 04 1a lea (%rdx,%rbx,1),%rax 0.00 : 79837b: 48 89 42 18 mov %rax,0x18(%rdx) : * cycling even for contexts created with minContextSize = 0; that way : * we don't have to force space to be allocated in contexts that might : * never need any space. Don't mark an oversize block as a keeper, : * however. : */ : if (set->keeper == NULL && blksize == set->initBlockSize) 0.00 : 79837f: 49 83 bc 24 b8 00 00 cmpq $0x0,0xb8(%r12) 0.00 : 798386: 00 00 0.00 : 798388: 0f 84 99 00 00 00 je 798427 : : /* Mark unallocated space NOACCESS. */ : VALGRIND_MAKE_MEM_NOACCESS(block->freeptr, : blksize - ALLOC_BLOCKHDRSZ); : : block->next = set->blocks; 0.00 : 79838e: 49 8b 44 24 38 mov 0x38(%r12),%rax 0.00 : 798393: 48 89 42 08 mov %rax,0x8(%rdx) : set->blocks = block; 0.00 : 798397: 49 89 54 24 38 mov %rdx,0x38(%r12) 0.00 : 79839c: 49 8d 47 10 lea 0x10(%r15),%rax 0.00 : 7983a0: 48 8b 7a 10 mov 0x10(%rdx),%rdi : chunk = (AllocChunk) (block->freeptr); : : /* Prepare to initialize the chunk header. */ : VALGRIND_MAKE_MEM_UNDEFINED(chunk, ALLOC_CHUNK_USED); : : block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 0.00 : 7983a4: 48 8d 04 07 lea (%rdi,%rax,1),%rax 0.00 : 7983a8: 49 89 41 10 mov %rax,0x10(%r9) : Assert(block->freeptr <= block->endptr); : : chunk->aset = (void *) set; 0.00 : 7983ac: 4c 89 27 mov %r12,(%rdi) : /* fill the allocated space with junk */ : randomize_mem((char *) AllocChunkGetPointer(chunk), size); : #endif : : AllocAllocInfo(set, chunk); : return AllocChunkGetPointer(chunk); 0.00 : 7983af: 48 8d 47 10 lea 0x10(%rdi),%rax : : block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); : Assert(block->freeptr <= block->endptr); : : chunk->aset = (void *) set; : chunk->size = chunk_size; 0.00 : 7983b3: 4c 89 7f 08 mov %r15,0x8(%rdi) : randomize_mem((char *) AllocChunkGetPointer(chunk), size); : #endif : : AllocAllocInfo(set, chunk); : return AllocChunkGetPointer(chunk); : } 0.00 : 7983b7: e9 a9 fd ff ff jmpq 798165 0.00 : 7983bc: 0f 1f 40 00 nopl 0x0(%rax) : block->next = set->blocks->next; : set->blocks->next = block; : } : else : { : block->next = NULL; 0.00 : 7983c0: 48 c7 42 08 00 00 00 movq $0x0,0x8(%rdx) 0.00 : 7983c7: 00 : set->blocks = block; 0.00 : 7983c8: 49 89 54 24 38 mov %rdx,0x38(%r12) 0.00 : 7983cd: e9 2b fe ff ff jmpq 7981fd 0.00 : 7983d2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : : /* : * We could be asking for pretty big blocks here, so cope if malloc : * fails. But give up if there's less than a meg or so available... : */ : while (block == NULL && blksize > 1024 * 1024) 0.00 : 7983d8: 48 81 fb 00 00 10 00 cmp $0x100000,%rbx 0.00 : 7983df: 0f 86 7b ff ff ff jbe 798360 : { : blksize >>= 1; 0.00 : 7983e5: 48 d1 eb shr %rbx : if (blksize < required_size) 0.00 : 7983e8: 49 39 dd cmp %rbx,%r13 0.00 : 7983eb: 0f 86 5f ff ff ff jbe 798350 0.00 : 7983f1: e9 6a ff ff ff jmpq 798360 : chunk_size = MAXALIGN(size); : blksize = chunk_size + ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ; : block = (AllocBlock) malloc(blksize); : if (block == NULL) : { : MemoryContextStats(TopMemoryContext); 0.00 : 7983f6: 48 8b 3d 6b 24 42 00 mov 0x42246b(%rip),%rdi # bba868 0.00 : 7983fd: e8 3e 07 00 00 callq 798b40 : ereport(ERROR, 0.00 : 798402: 45 31 c0 xor %r8d,%r8d 0.00 : 798405: b9 80 1f 8e 00 mov $0x8e1f80,%ecx 0.00 : 79840a: ba a7 02 00 00 mov $0x2a7,%edx : } : : if (block == NULL) : { : MemoryContextStats(TopMemoryContext); : ereport(ERROR, 0.00 : 79840f: be 6d 1d 8e 00 mov $0x8e1d6d,%esi 0.00 : 798414: bf 14 00 00 00 mov $0x14,%edi 0.00 : 798419: e8 a2 26 fe ff callq 77aac0 0.00 : 79841e: 84 c0 test %al,%al 0.00 : 798420: 75 20 jne 798442 0.00 : 798422: e8 a9 10 cd ff callq 4694d0 : * cycling even for contexts created with minContextSize = 0; that way : * we don't have to force space to be allocated in contexts that might : * never need any space. Don't mark an oversize block as a keeper, : * however. : */ : if (set->keeper == NULL && blksize == set->initBlockSize) 0.00 : 798427: 49 39 9c 24 98 00 00 cmp %rbx,0x98(%r12) 0.00 : 79842e: 00 0.00 : 79842f: 0f 85 59 ff ff ff jne 79838e : set->keeper = block; 0.00 : 798435: 49 89 94 24 b8 00 00 mov %rdx,0xb8(%r12) 0.00 : 79843c: 00 0.00 : 79843d: e9 4c ff ff ff jmpq 79838e : } : : if (block == NULL) : { : MemoryContextStats(TopMemoryContext); : ereport(ERROR, 0.00 : 798442: 4c 89 f6 mov %r14,%rsi 0.00 : 798445: bf a8 1d 8e 00 mov $0x8e1da8,%edi 0.00 : 79844a: 31 c0 xor %eax,%eax 0.00 : 79844c: e8 df 40 fe ff callq 77c530 0.00 : 798451: bf 04 9c 7b 00 mov $0x7b9c04,%edi 0.00 : 798456: 41 89 c4 mov %eax,%r12d 0.00 : 798459: 31 c0 xor %eax,%eax 0.00 : 79845b: e8 40 44 fe ff callq 77c8a0 0.00 : 798460: bf c5 20 00 00 mov $0x20c5,%edi 0.00 : 798465: 89 c3 mov %eax,%ebx 0.00 : 798467: e8 e4 48 fe ff callq 77cd50 0.00 : 79846c: 44 89 e2 mov %r12d,%edx 0.00 : 79846f: 89 c7 mov %eax,%edi 0.00 : 798471: 89 de mov %ebx,%esi 0.00 : 798473: 31 c0 xor %eax,%eax 0.00 : 798475: e8 66 21 fe ff callq 77a5e0 0.00 : 79847a: eb a6 jmp 798422 : block = (AllocBlock) malloc(blksize); : } : : if (block == NULL) : { : MemoryContextStats(TopMemoryContext); 0.00 : 79847c: 48 8b 3d e5 23 42 00 mov 0x4223e5(%rip),%rdi # bba868 0.00 : 798483: e8 b8 06 00 00 callq 798b40 : ereport(ERROR, 0.00 : 798488: 45 31 c0 xor %r8d,%r8d 0.00 : 79848b: b9 80 1f 8e 00 mov $0x8e1f80,%ecx 0.00 : 798490: ba 69 03 00 00 mov $0x369,%edx 0.00 : 798495: e9 75 ff ff ff jmpq 79840f Sorted summary for file /lib64/libc-2.11.3.so ---------------------------------------------- 44.44 ??:0 22.22 ??:0 11.11 ??:0 11.11 ??:0 11.11 ??:0 Percent | Source code & Disassembly of /lib64/libc-2.11.3.so ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000083470 <__GI_memset>: 0.00 : 83470: 48 83 fa 01 cmp $0x1,%rdx 0.00 : 83474: 48 89 f8 mov %rdi,%rax 0.00 : 83477: 75 04 jne 8347d <__GI_memset+0xd> 0.00 : 83479: 40 88 37 mov %sil,(%rdi) 0.00 : 8347c: c3 retq 22.22 : 8347d: 49 b9 01 01 01 01 01 movabs $0x101010101010101,%r9 0.00 : 83484: 01 01 01 0.00 : 83487: 49 89 d0 mov %rdx,%r8 0.00 : 8348a: 48 0f b6 d6 movzbq %sil,%rdx 0.00 : 8348e: 49 0f af d1 imul %r9,%rdx 0.00 : 83492: 49 81 f8 90 00 00 00 cmp $0x90,%r8 0.00 : 83499: 0f 87 e1 02 00 00 ja 83780 <__GI_memset+0x310> 0.00 : 8349f: 4c 01 c7 add %r8,%rdi 0.00 : 834a2: 4c 8d 1d 13 00 00 00 lea 0x13(%rip),%r11 # 834bc <__GI_memset+0x4c> 0.00 : 834a9: 48 8d 0d 60 2d 0b 00 lea 0xb2d60(%rip),%rcx # 136210 11.11 : 834b0: 4a 0f bf 0c 41 movswq (%rcx,%r8,2),%rcx 0.00 : 834b5: 4e 8d 1c 19 lea (%rcx,%r11,1),%r11 0.00 : 834b9: 41 ff e3 jmpq *%r11 0.00 : 834bc: c3 retq 0.00 : 834bd: 0f 1f 00 nopl (%rax) 0.00 : 834c0: 48 89 97 77 ff ff ff mov %rdx,-0x89(%rdi) 0.00 : 834c7: 48 89 97 7f ff ff ff mov %rdx,-0x81(%rdi) 0.00 : 834ce: 48 89 57 87 mov %rdx,-0x79(%rdi) 0.00 : 834d2: 48 89 57 8f mov %rdx,-0x71(%rdi) 0.00 : 834d6: 48 89 57 97 mov %rdx,-0x69(%rdi) 0.00 : 834da: 48 89 57 9f mov %rdx,-0x61(%rdi) 0.00 : 834de: 48 89 57 a7 mov %rdx,-0x59(%rdi) 0.00 : 834e2: 48 89 57 af mov %rdx,-0x51(%rdi) 0.00 : 834e6: 48 89 57 b7 mov %rdx,-0x49(%rdi) 0.00 : 834ea: 48 89 57 bf mov %rdx,-0x41(%rdi) 0.00 : 834ee: 48 89 57 c7 mov %rdx,-0x39(%rdi) 0.00 : 834f2: 48 89 57 cf mov %rdx,-0x31(%rdi) 0.00 : 834f6: 48 89 57 d7 mov %rdx,-0x29(%rdi) 0.00 : 834fa: 48 89 57 df mov %rdx,-0x21(%rdi) 0.00 : 834fe: 48 89 57 e7 mov %rdx,-0x19(%rdi) 0.00 : 83502: 48 89 57 ef mov %rdx,-0x11(%rdi) 0.00 : 83506: 48 89 57 f7 mov %rdx,-0x9(%rdi) 0.00 : 8350a: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 8350d: c3 retq 0.00 : 8350e: 66 90 xchg %ax,%ax 0.00 : 83510: 48 89 97 70 ff ff ff mov %rdx,-0x90(%rdi) 0.00 : 83517: 48 89 97 78 ff ff ff mov %rdx,-0x88(%rdi) 0.00 : 8351e: 48 89 57 80 mov %rdx,-0x80(%rdi) 0.00 : 83522: 48 89 57 88 mov %rdx,-0x78(%rdi) 0.00 : 83526: 48 89 57 90 mov %rdx,-0x70(%rdi) 0.00 : 8352a: 48 89 57 98 mov %rdx,-0x68(%rdi) 0.00 : 8352e: 48 89 57 a0 mov %rdx,-0x60(%rdi) 0.00 : 83532: 48 89 57 a8 mov %rdx,-0x58(%rdi) 0.00 : 83536: 48 89 57 b0 mov %rdx,-0x50(%rdi) 0.00 : 8353a: 48 89 57 b8 mov %rdx,-0x48(%rdi) 0.00 : 8353e: 48 89 57 c0 mov %rdx,-0x40(%rdi) 0.00 : 83542: 48 89 57 c8 mov %rdx,-0x38(%rdi) 0.00 : 83546: 48 89 57 d0 mov %rdx,-0x30(%rdi) 0.00 : 8354a: 48 89 57 d8 mov %rdx,-0x28(%rdi) 0.00 : 8354e: 48 89 57 e0 mov %rdx,-0x20(%rdi) 0.00 : 83552: 48 89 57 e8 mov %rdx,-0x18(%rdi) 0.00 : 83556: 48 89 57 f0 mov %rdx,-0x10(%rdi) 0.00 : 8355a: 48 89 57 f8 mov %rdx,-0x8(%rdi) 0.00 : 8355e: c3 retq 0.00 : 8355f: 90 nop 0.00 : 83560: 48 89 97 76 ff ff ff mov %rdx,-0x8a(%rdi) 0.00 : 83567: 48 89 97 7e ff ff ff mov %rdx,-0x82(%rdi) 0.00 : 8356e: 48 89 57 86 mov %rdx,-0x7a(%rdi) 0.00 : 83572: 48 89 57 8e mov %rdx,-0x72(%rdi) 0.00 : 83576: 48 89 57 96 mov %rdx,-0x6a(%rdi) 0.00 : 8357a: 48 89 57 9e mov %rdx,-0x62(%rdi) 0.00 : 8357e: 48 89 57 a6 mov %rdx,-0x5a(%rdi) 0.00 : 83582: 48 89 57 ae mov %rdx,-0x52(%rdi) 0.00 : 83586: 48 89 57 b6 mov %rdx,-0x4a(%rdi) 0.00 : 8358a: 48 89 57 be mov %rdx,-0x42(%rdi) 0.00 : 8358e: 48 89 57 c6 mov %rdx,-0x3a(%rdi) 0.00 : 83592: 48 89 57 ce mov %rdx,-0x32(%rdi) 0.00 : 83596: 48 89 57 d6 mov %rdx,-0x2a(%rdi) 0.00 : 8359a: 48 89 57 de mov %rdx,-0x22(%rdi) 0.00 : 8359e: 48 89 57 e6 mov %rdx,-0x1a(%rdi) 0.00 : 835a2: 48 89 57 ee mov %rdx,-0x12(%rdi) 0.00 : 835a6: 48 89 57 f6 mov %rdx,-0xa(%rdi) 0.00 : 835aa: 66 89 57 fe mov %dx,-0x2(%rdi) 0.00 : 835ae: c3 retq 0.00 : 835af: 90 nop 0.00 : 835b0: 48 89 97 75 ff ff ff mov %rdx,-0x8b(%rdi) 0.00 : 835b7: 48 89 97 7d ff ff ff mov %rdx,-0x83(%rdi) 0.00 : 835be: 48 89 57 85 mov %rdx,-0x7b(%rdi) 0.00 : 835c2: 48 89 57 8d mov %rdx,-0x73(%rdi) 0.00 : 835c6: 48 89 57 95 mov %rdx,-0x6b(%rdi) 0.00 : 835ca: 48 89 57 9d mov %rdx,-0x63(%rdi) 0.00 : 835ce: 48 89 57 a5 mov %rdx,-0x5b(%rdi) 0.00 : 835d2: 48 89 57 ad mov %rdx,-0x53(%rdi) 0.00 : 835d6: 48 89 57 b5 mov %rdx,-0x4b(%rdi) 0.00 : 835da: 48 89 57 bd mov %rdx,-0x43(%rdi) 0.00 : 835de: 48 89 57 c5 mov %rdx,-0x3b(%rdi) 0.00 : 835e2: 48 89 57 cd mov %rdx,-0x33(%rdi) 0.00 : 835e6: 48 89 57 d5 mov %rdx,-0x2b(%rdi) 0.00 : 835ea: 48 89 57 dd mov %rdx,-0x23(%rdi) 0.00 : 835ee: 48 89 57 e5 mov %rdx,-0x1b(%rdi) 0.00 : 835f2: 48 89 57 ed mov %rdx,-0x13(%rdi) 0.00 : 835f6: 48 89 57 f5 mov %rdx,-0xb(%rdi) 0.00 : 835fa: 66 89 57 fd mov %dx,-0x3(%rdi) 0.00 : 835fe: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83601: c3 retq 0.00 : 83602: 66 66 66 66 66 2e 0f data32 data32 data32 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 83609: 1f 84 00 00 00 00 00 0.00 : 83610: 48 89 97 74 ff ff ff mov %rdx,-0x8c(%rdi) 0.00 : 83617: 48 89 97 7c ff ff ff mov %rdx,-0x84(%rdi) 0.00 : 8361e: 48 89 57 84 mov %rdx,-0x7c(%rdi) 0.00 : 83622: 48 89 57 8c mov %rdx,-0x74(%rdi) 0.00 : 83626: 48 89 57 94 mov %rdx,-0x6c(%rdi) 0.00 : 8362a: 48 89 57 9c mov %rdx,-0x64(%rdi) 0.00 : 8362e: 48 89 57 a4 mov %rdx,-0x5c(%rdi) 0.00 : 83632: 48 89 57 ac mov %rdx,-0x54(%rdi) 0.00 : 83636: 48 89 57 b4 mov %rdx,-0x4c(%rdi) 0.00 : 8363a: 48 89 57 bc mov %rdx,-0x44(%rdi) 0.00 : 8363e: 48 89 57 c4 mov %rdx,-0x3c(%rdi) 0.00 : 83642: 48 89 57 cc mov %rdx,-0x34(%rdi) 0.00 : 83646: 48 89 57 d4 mov %rdx,-0x2c(%rdi) 0.00 : 8364a: 48 89 57 dc mov %rdx,-0x24(%rdi) 0.00 : 8364e: 48 89 57 e4 mov %rdx,-0x1c(%rdi) 0.00 : 83652: 48 89 57 ec mov %rdx,-0x14(%rdi) 11.11 : 83656: 48 89 57 f4 mov %rdx,-0xc(%rdi) 0.00 : 8365a: 89 57 fc mov %edx,-0x4(%rdi) 0.00 : 8365d: c3 retq 0.00 : 8365e: 66 90 xchg %ax,%ax 0.00 : 83660: 48 89 97 73 ff ff ff mov %rdx,-0x8d(%rdi) 0.00 : 83667: 48 89 97 7b ff ff ff mov %rdx,-0x85(%rdi) 0.00 : 8366e: 48 89 57 83 mov %rdx,-0x7d(%rdi) 0.00 : 83672: 48 89 57 8b mov %rdx,-0x75(%rdi) 0.00 : 83676: 48 89 57 93 mov %rdx,-0x6d(%rdi) 0.00 : 8367a: 48 89 57 9b mov %rdx,-0x65(%rdi) 0.00 : 8367e: 48 89 57 a3 mov %rdx,-0x5d(%rdi) 0.00 : 83682: 48 89 57 ab mov %rdx,-0x55(%rdi) 0.00 : 83686: 48 89 57 b3 mov %rdx,-0x4d(%rdi) 0.00 : 8368a: 48 89 57 bb mov %rdx,-0x45(%rdi) 0.00 : 8368e: 48 89 57 c3 mov %rdx,-0x3d(%rdi) 0.00 : 83692: 48 89 57 cb mov %rdx,-0x35(%rdi) 0.00 : 83696: 48 89 57 d3 mov %rdx,-0x2d(%rdi) 0.00 : 8369a: 48 89 57 db mov %rdx,-0x25(%rdi) 0.00 : 8369e: 48 89 57 e3 mov %rdx,-0x1d(%rdi) 0.00 : 836a2: 48 89 57 eb mov %rdx,-0x15(%rdi) 0.00 : 836a6: 48 89 57 f3 mov %rdx,-0xd(%rdi) 0.00 : 836aa: 89 57 fb mov %edx,-0x5(%rdi) 0.00 : 836ad: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 836b0: c3 retq 0.00 : 836b1: 66 66 66 66 66 66 2e data32 data32 data32 data32 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 836b8: 0f 1f 84 00 00 00 00 0.00 : 836bf: 00 0.00 : 836c0: 48 89 97 72 ff ff ff mov %rdx,-0x8e(%rdi) 0.00 : 836c7: 48 89 97 7a ff ff ff mov %rdx,-0x86(%rdi) 0.00 : 836ce: 48 89 57 82 mov %rdx,-0x7e(%rdi) 0.00 : 836d2: 48 89 57 8a mov %rdx,-0x76(%rdi) 0.00 : 836d6: 48 89 57 92 mov %rdx,-0x6e(%rdi) 0.00 : 836da: 48 89 57 9a mov %rdx,-0x66(%rdi) 0.00 : 836de: 48 89 57 a2 mov %rdx,-0x5e(%rdi) 0.00 : 836e2: 48 89 57 aa mov %rdx,-0x56(%rdi) 0.00 : 836e6: 48 89 57 b2 mov %rdx,-0x4e(%rdi) 0.00 : 836ea: 48 89 57 ba mov %rdx,-0x46(%rdi) 0.00 : 836ee: 48 89 57 c2 mov %rdx,-0x3e(%rdi) 0.00 : 836f2: 48 89 57 ca mov %rdx,-0x36(%rdi) 0.00 : 836f6: 48 89 57 d2 mov %rdx,-0x2e(%rdi) 0.00 : 836fa: 48 89 57 da mov %rdx,-0x26(%rdi) 0.00 : 836fe: 48 89 57 e2 mov %rdx,-0x1e(%rdi) 0.00 : 83702: 48 89 57 ea mov %rdx,-0x16(%rdi) 0.00 : 83706: 48 89 57 f2 mov %rdx,-0xe(%rdi) 0.00 : 8370a: 89 57 fa mov %edx,-0x6(%rdi) 0.00 : 8370d: 66 89 57 fe mov %dx,-0x2(%rdi) 0.00 : 83711: c3 retq 0.00 : 83712: 66 66 66 66 66 2e 0f data32 data32 data32 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 83719: 1f 84 00 00 00 00 00 0.00 : 83720: 48 89 97 71 ff ff ff mov %rdx,-0x8f(%rdi) 0.00 : 83727: 48 89 97 79 ff ff ff mov %rdx,-0x87(%rdi) 0.00 : 8372e: 48 89 57 81 mov %rdx,-0x7f(%rdi) 0.00 : 83732: 48 89 57 89 mov %rdx,-0x77(%rdi) 0.00 : 83736: 48 89 57 91 mov %rdx,-0x6f(%rdi) 0.00 : 8373a: 48 89 57 99 mov %rdx,-0x67(%rdi) 0.00 : 8373e: 48 89 57 a1 mov %rdx,-0x5f(%rdi) 0.00 : 83742: 48 89 57 a9 mov %rdx,-0x57(%rdi) 0.00 : 83746: 48 89 57 b1 mov %rdx,-0x4f(%rdi) 0.00 : 8374a: 48 89 57 b9 mov %rdx,-0x47(%rdi) 0.00 : 8374e: 48 89 57 c1 mov %rdx,-0x3f(%rdi) 0.00 : 83752: 48 89 57 c9 mov %rdx,-0x37(%rdi) 0.00 : 83756: 48 89 57 d1 mov %rdx,-0x2f(%rdi) 0.00 : 8375a: 48 89 57 d9 mov %rdx,-0x27(%rdi) 0.00 : 8375e: 48 89 57 e1 mov %rdx,-0x1f(%rdi) 0.00 : 83762: 48 89 57 e9 mov %rdx,-0x17(%rdi) 0.00 : 83766: 48 89 57 f1 mov %rdx,-0xf(%rdi) 0.00 : 8376a: 89 57 f9 mov %edx,-0x7(%rdi) 0.00 : 8376d: 66 89 57 fd mov %dx,-0x3(%rdi) 0.00 : 83771: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83774: c3 retq 0.00 : 83775: 66 66 2e 0f 1f 84 00 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 8377c: 00 00 00 00 0.00 : 83780: 49 c7 c2 10 00 00 00 mov $0x10,%r10 0.00 : 83787: 49 89 f9 mov %rdi,%r9 0.00 : 8378a: 49 83 e1 0f and $0xf,%r9 0.00 : 8378e: 4d 29 ca sub %r9,%r10 0.00 : 83791: 49 83 e2 0f and $0xf,%r10 0.00 : 83795: 4c 01 d7 add %r10,%rdi 0.00 : 83798: 4d 29 d0 sub %r10,%r8 0.00 : 8379b: 4c 8d 1d 98 00 00 00 lea 0x98(%rip),%r11 # 8383a <__GI_memset+0x3ca> 0.00 : 837a2: 48 8d 0d 97 2b 0b 00 lea 0xb2b97(%rip),%rcx # 136340 0.00 : 837a9: 4a 0f bf 0c 51 movswq (%rcx,%r10,2),%rcx 0.00 : 837ae: 4e 8d 1c 19 lea (%rcx,%r11,1),%r11 0.00 : 837b2: 41 ff e3 jmpq *%r11 0.00 : 837b5: 66 66 2e 0f 1f 84 00 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 837bc: 00 00 00 00 0.00 : 837c0: 88 57 f3 mov %dl,-0xd(%rdi) 0.00 : 837c3: 89 57 f4 mov %edx,-0xc(%rdi) 0.00 : 837c6: 48 89 57 f8 mov %rdx,-0x8(%rdi) 0.00 : 837ca: eb 6e jmp 8383a <__GI_memset+0x3ca> 0.00 : 837cc: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 837d0: 88 57 f7 mov %dl,-0x9(%rdi) 0.00 : 837d3: 48 89 57 f8 mov %rdx,-0x8(%rdi) 0.00 : 837d7: eb 61 jmp 8383a <__GI_memset+0x3ca> 0.00 : 837d9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 837e0: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 837e3: eb 55 jmp 8383a <__GI_memset+0x3ca> 0.00 : 837e5: 66 66 2e 0f 1f 84 00 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 837ec: 00 00 00 00 0.00 : 837f0: 88 57 f5 mov %dl,-0xb(%rdi) 0.00 : 837f3: 66 89 57 f6 mov %dx,-0xa(%rdi) 0.00 : 837f7: 48 89 57 f8 mov %rdx,-0x8(%rdi) 0.00 : 837fb: eb 3d jmp 8383a <__GI_memset+0x3ca> 0.00 : 837fd: 0f 1f 00 nopl (%rax) 0.00 : 83800: 88 57 fd mov %dl,-0x3(%rdi) 0.00 : 83803: 66 89 57 fe mov %dx,-0x2(%rdi) 0.00 : 83807: eb 31 jmp 8383a <__GI_memset+0x3ca> 0.00 : 83809: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 83810: 88 57 fb mov %dl,-0x5(%rdi) 0.00 : 83813: 89 57 fc mov %edx,-0x4(%rdi) 0.00 : 83816: eb 22 jmp 8383a <__GI_memset+0x3ca> 0.00 : 83818: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 8381f: 00 0.00 : 83820: 88 57 f1 mov %dl,-0xf(%rdi) 0.00 : 83823: 66 89 57 f2 mov %dx,-0xe(%rdi) 0.00 : 83827: 89 57 f4 mov %edx,-0xc(%rdi) 0.00 : 8382a: 48 89 57 f8 mov %rdx,-0x8(%rdi) 0.00 : 8382e: eb 0a jmp 8383a <__GI_memset+0x3ca> 0.00 : 83830: 88 57 f9 mov %dl,-0x7(%rdi) 0.00 : 83833: 66 89 57 fa mov %dx,-0x6(%rdi) 0.00 : 83837: 89 57 fc mov %edx,-0x4(%rdi) 0.00 : 8383a: 66 48 0f 6e c2 movq %rdx,%xmm0 0.00 : 8383f: 66 0f 6c c0 punpcklqdq %xmm0,%xmm0 0.00 : 83843: 49 81 f8 b0 00 00 00 cmp $0xb0,%r8 0.00 : 8384a: 0f 83 d0 04 00 00 jae 83d20 <__GI_memset+0x8b0> 0.00 : 83850: 4c 01 c7 add %r8,%rdi 0.00 : 83853: 4c 8d 0d 53 00 00 00 lea 0x53(%rip),%r9 # 838ad <__GI_memset+0x43d> 0.00 : 8385a: 48 8d 0d ff 2a 0b 00 lea 0xb2aff(%rip),%rcx # 136360 0.00 : 83861: 4a 0f bf 0c 41 movswq (%rcx,%r8,2),%rcx 0.00 : 83866: 4e 8d 0c 09 lea (%rcx,%r9,1),%r9 0.00 : 8386a: 41 ff e1 jmpq *%r9 0.00 : 8386d: 66 0f 7f 87 50 ff ff movdqa %xmm0,-0xb0(%rdi) 0.00 : 83874: ff 0.00 : 83875: 66 0f 7f 87 60 ff ff movdqa %xmm0,-0xa0(%rdi) 0.00 : 8387c: ff 0.00 : 8387d: 66 0f 7f 87 70 ff ff movdqa %xmm0,-0x90(%rdi) 0.00 : 83884: ff 0.00 : 83885: 66 0f 7f 47 80 movdqa %xmm0,-0x80(%rdi) 0.00 : 8388a: 66 0f 7f 47 90 movdqa %xmm0,-0x70(%rdi) 0.00 : 8388f: 66 0f 7f 47 a0 movdqa %xmm0,-0x60(%rdi) 0.00 : 83894: 66 0f 7f 47 b0 movdqa %xmm0,-0x50(%rdi) 0.00 : 83899: 66 0f 7f 47 c0 movdqa %xmm0,-0x40(%rdi) 0.00 : 8389e: 66 0f 7f 47 d0 movdqa %xmm0,-0x30(%rdi) 0.00 : 838a3: 66 0f 7f 47 e0 movdqa %xmm0,-0x20(%rdi) 0.00 : 838a8: 66 0f 7f 47 f0 movdqa %xmm0,-0x10(%rdi) 0.00 : 838ad: c3 retq 0.00 : 838ae: 66 0f 7f 87 4f ff ff movdqa %xmm0,-0xb1(%rdi) 0.00 : 838b5: ff 0.00 : 838b6: 66 0f 7f 87 5f ff ff movdqa %xmm0,-0xa1(%rdi) 0.00 : 838bd: ff 0.00 : 838be: 66 0f 7f 87 6f ff ff movdqa %xmm0,-0x91(%rdi) 0.00 : 838c5: ff 0.00 : 838c6: 66 0f 7f 87 7f ff ff movdqa %xmm0,-0x81(%rdi) 0.00 : 838cd: ff 0.00 : 838ce: 66 0f 7f 47 8f movdqa %xmm0,-0x71(%rdi) 0.00 : 838d3: 66 0f 7f 47 9f movdqa %xmm0,-0x61(%rdi) 0.00 : 838d8: 66 0f 7f 47 af movdqa %xmm0,-0x51(%rdi) 0.00 : 838dd: 66 0f 7f 47 bf movdqa %xmm0,-0x41(%rdi) 0.00 : 838e2: 66 0f 7f 47 cf movdqa %xmm0,-0x31(%rdi) 0.00 : 838e7: 66 0f 7f 47 df movdqa %xmm0,-0x21(%rdi) 0.00 : 838ec: 66 0f 7f 47 ef movdqa %xmm0,-0x11(%rdi) 0.00 : 838f1: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 838f4: c3 retq 0.00 : 838f5: 66 0f 7f 87 4e ff ff movdqa %xmm0,-0xb2(%rdi) 0.00 : 838fc: ff 0.00 : 838fd: 66 0f 7f 87 5e ff ff movdqa %xmm0,-0xa2(%rdi) 0.00 : 83904: ff 0.00 : 83905: 66 0f 7f 87 6e ff ff movdqa %xmm0,-0x92(%rdi) 0.00 : 8390c: ff 0.00 : 8390d: 66 0f 7f 87 7e ff ff movdqa %xmm0,-0x82(%rdi) 0.00 : 83914: ff 0.00 : 83915: 66 0f 7f 47 8e movdqa %xmm0,-0x72(%rdi) 0.00 : 8391a: 66 0f 7f 47 9e movdqa %xmm0,-0x62(%rdi) 0.00 : 8391f: 66 0f 7f 47 ae movdqa %xmm0,-0x52(%rdi) 0.00 : 83924: 66 0f 7f 47 be movdqa %xmm0,-0x42(%rdi) 0.00 : 83929: 66 0f 7f 47 ce movdqa %xmm0,-0x32(%rdi) 0.00 : 8392e: 66 0f 7f 47 de movdqa %xmm0,-0x22(%rdi) 0.00 : 83933: 66 0f 7f 47 ee movdqa %xmm0,-0x12(%rdi) 0.00 : 83938: 66 89 57 fe mov %dx,-0x2(%rdi) 0.00 : 8393c: c3 retq 0.00 : 8393d: 66 0f 7f 87 4d ff ff movdqa %xmm0,-0xb3(%rdi) 0.00 : 83944: ff 0.00 : 83945: 66 0f 7f 87 5d ff ff movdqa %xmm0,-0xa3(%rdi) 0.00 : 8394c: ff 0.00 : 8394d: 66 0f 7f 87 6d ff ff movdqa %xmm0,-0x93(%rdi) 0.00 : 83954: ff 0.00 : 83955: 66 0f 7f 87 7d ff ff movdqa %xmm0,-0x83(%rdi) 0.00 : 8395c: ff 0.00 : 8395d: 66 0f 7f 47 8d movdqa %xmm0,-0x73(%rdi) 0.00 : 83962: 66 0f 7f 47 9d movdqa %xmm0,-0x63(%rdi) 0.00 : 83967: 66 0f 7f 47 ad movdqa %xmm0,-0x53(%rdi) 0.00 : 8396c: 66 0f 7f 47 bd movdqa %xmm0,-0x43(%rdi) 0.00 : 83971: 66 0f 7f 47 cd movdqa %xmm0,-0x33(%rdi) 0.00 : 83976: 66 0f 7f 47 dd movdqa %xmm0,-0x23(%rdi) 0.00 : 8397b: 66 0f 7f 47 ed movdqa %xmm0,-0x13(%rdi) 0.00 : 83980: 66 89 57 fd mov %dx,-0x3(%rdi) 0.00 : 83984: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83987: c3 retq 0.00 : 83988: 66 0f 7f 87 4c ff ff movdqa %xmm0,-0xb4(%rdi) 0.00 : 8398f: ff 0.00 : 83990: 66 0f 7f 87 5c ff ff movdqa %xmm0,-0xa4(%rdi) 0.00 : 83997: ff 0.00 : 83998: 66 0f 7f 87 6c ff ff movdqa %xmm0,-0x94(%rdi) 0.00 : 8399f: ff 0.00 : 839a0: 66 0f 7f 87 7c ff ff movdqa %xmm0,-0x84(%rdi) 0.00 : 839a7: ff 0.00 : 839a8: 66 0f 7f 47 8c movdqa %xmm0,-0x74(%rdi) 0.00 : 839ad: 66 0f 7f 47 9c movdqa %xmm0,-0x64(%rdi) 0.00 : 839b2: 66 0f 7f 47 ac movdqa %xmm0,-0x54(%rdi) 0.00 : 839b7: 66 0f 7f 47 bc movdqa %xmm0,-0x44(%rdi) 0.00 : 839bc: 66 0f 7f 47 cc movdqa %xmm0,-0x34(%rdi) 0.00 : 839c1: 66 0f 7f 47 dc movdqa %xmm0,-0x24(%rdi) 0.00 : 839c6: 66 0f 7f 47 ec movdqa %xmm0,-0x14(%rdi) 0.00 : 839cb: 89 57 fc mov %edx,-0x4(%rdi) 0.00 : 839ce: c3 retq 0.00 : 839cf: 66 0f 7f 87 4b ff ff movdqa %xmm0,-0xb5(%rdi) 0.00 : 839d6: ff 0.00 : 839d7: 66 0f 7f 87 5b ff ff movdqa %xmm0,-0xa5(%rdi) 0.00 : 839de: ff 0.00 : 839df: 66 0f 7f 87 6b ff ff movdqa %xmm0,-0x95(%rdi) 0.00 : 839e6: ff 0.00 : 839e7: 66 0f 7f 87 7b ff ff movdqa %xmm0,-0x85(%rdi) 0.00 : 839ee: ff 0.00 : 839ef: 66 0f 7f 47 8b movdqa %xmm0,-0x75(%rdi) 0.00 : 839f4: 66 0f 7f 47 9b movdqa %xmm0,-0x65(%rdi) 0.00 : 839f9: 66 0f 7f 47 ab movdqa %xmm0,-0x55(%rdi) 0.00 : 839fe: 66 0f 7f 47 bb movdqa %xmm0,-0x45(%rdi) 0.00 : 83a03: 66 0f 7f 47 cb movdqa %xmm0,-0x35(%rdi) 0.00 : 83a08: 66 0f 7f 47 db movdqa %xmm0,-0x25(%rdi) 0.00 : 83a0d: 66 0f 7f 47 eb movdqa %xmm0,-0x15(%rdi) 0.00 : 83a12: 89 57 fb mov %edx,-0x5(%rdi) 0.00 : 83a15: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83a18: c3 retq 0.00 : 83a19: 66 0f 7f 87 4a ff ff movdqa %xmm0,-0xb6(%rdi) 0.00 : 83a20: ff 0.00 : 83a21: 66 0f 7f 87 5a ff ff movdqa %xmm0,-0xa6(%rdi) 0.00 : 83a28: ff 0.00 : 83a29: 66 0f 7f 87 6a ff ff movdqa %xmm0,-0x96(%rdi) 0.00 : 83a30: ff 0.00 : 83a31: 66 0f 7f 87 7a ff ff movdqa %xmm0,-0x86(%rdi) 0.00 : 83a38: ff 0.00 : 83a39: 66 0f 7f 47 8a movdqa %xmm0,-0x76(%rdi) 0.00 : 83a3e: 66 0f 7f 47 9a movdqa %xmm0,-0x66(%rdi) 0.00 : 83a43: 66 0f 7f 47 aa movdqa %xmm0,-0x56(%rdi) 0.00 : 83a48: 66 0f 7f 47 ba movdqa %xmm0,-0x46(%rdi) 0.00 : 83a4d: 66 0f 7f 47 ca movdqa %xmm0,-0x36(%rdi) 0.00 : 83a52: 66 0f 7f 47 da movdqa %xmm0,-0x26(%rdi) 0.00 : 83a57: 66 0f 7f 47 ea movdqa %xmm0,-0x16(%rdi) 0.00 : 83a5c: 89 57 fa mov %edx,-0x6(%rdi) 0.00 : 83a5f: 66 89 57 fe mov %dx,-0x2(%rdi) 0.00 : 83a63: c3 retq 0.00 : 83a64: 66 0f 7f 87 49 ff ff movdqa %xmm0,-0xb7(%rdi) 0.00 : 83a6b: ff 0.00 : 83a6c: 66 0f 7f 87 59 ff ff movdqa %xmm0,-0xa7(%rdi) 0.00 : 83a73: ff 0.00 : 83a74: 66 0f 7f 87 69 ff ff movdqa %xmm0,-0x97(%rdi) 0.00 : 83a7b: ff 0.00 : 83a7c: 66 0f 7f 87 79 ff ff movdqa %xmm0,-0x87(%rdi) 0.00 : 83a83: ff 0.00 : 83a84: 66 0f 7f 47 89 movdqa %xmm0,-0x77(%rdi) 0.00 : 83a89: 66 0f 7f 47 99 movdqa %xmm0,-0x67(%rdi) 0.00 : 83a8e: 66 0f 7f 47 a9 movdqa %xmm0,-0x57(%rdi) 0.00 : 83a93: 66 0f 7f 47 b9 movdqa %xmm0,-0x47(%rdi) 0.00 : 83a98: 66 0f 7f 47 c9 movdqa %xmm0,-0x37(%rdi) 0.00 : 83a9d: 66 0f 7f 47 d9 movdqa %xmm0,-0x27(%rdi) 0.00 : 83aa2: 66 0f 7f 47 e9 movdqa %xmm0,-0x17(%rdi) 0.00 : 83aa7: 89 57 f9 mov %edx,-0x7(%rdi) 0.00 : 83aaa: 66 89 57 fd mov %dx,-0x3(%rdi) 0.00 : 83aae: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83ab1: c3 retq 0.00 : 83ab2: 66 0f 7f 87 48 ff ff movdqa %xmm0,-0xb8(%rdi) 0.00 : 83ab9: ff 0.00 : 83aba: 66 0f 7f 87 58 ff ff movdqa %xmm0,-0xa8(%rdi) 0.00 : 83ac1: ff 0.00 : 83ac2: 66 0f 7f 87 68 ff ff movdqa %xmm0,-0x98(%rdi) 0.00 : 83ac9: ff 0.00 : 83aca: 66 0f 7f 87 78 ff ff movdqa %xmm0,-0x88(%rdi) 0.00 : 83ad1: ff 0.00 : 83ad2: 66 0f 7f 47 88 movdqa %xmm0,-0x78(%rdi) 0.00 : 83ad7: 66 0f 7f 47 98 movdqa %xmm0,-0x68(%rdi) 0.00 : 83adc: 66 0f 7f 47 a8 movdqa %xmm0,-0x58(%rdi) 0.00 : 83ae1: 66 0f 7f 47 b8 movdqa %xmm0,-0x48(%rdi) 0.00 : 83ae6: 66 0f 7f 47 c8 movdqa %xmm0,-0x38(%rdi) 0.00 : 83aeb: 66 0f 7f 47 d8 movdqa %xmm0,-0x28(%rdi) 0.00 : 83af0: 66 0f 7f 47 e8 movdqa %xmm0,-0x18(%rdi) 0.00 : 83af5: 48 89 57 f8 mov %rdx,-0x8(%rdi) 0.00 : 83af9: c3 retq 0.00 : 83afa: 66 0f 7f 87 47 ff ff movdqa %xmm0,-0xb9(%rdi) 0.00 : 83b01: ff 0.00 : 83b02: 66 0f 7f 87 57 ff ff movdqa %xmm0,-0xa9(%rdi) 0.00 : 83b09: ff 0.00 : 83b0a: 66 0f 7f 87 67 ff ff movdqa %xmm0,-0x99(%rdi) 0.00 : 83b11: ff 0.00 : 83b12: 66 0f 7f 87 77 ff ff movdqa %xmm0,-0x89(%rdi) 0.00 : 83b19: ff 0.00 : 83b1a: 66 0f 7f 47 87 movdqa %xmm0,-0x79(%rdi) 0.00 : 83b1f: 66 0f 7f 47 97 movdqa %xmm0,-0x69(%rdi) 0.00 : 83b24: 66 0f 7f 47 a7 movdqa %xmm0,-0x59(%rdi) 0.00 : 83b29: 66 0f 7f 47 b7 movdqa %xmm0,-0x49(%rdi) 0.00 : 83b2e: 66 0f 7f 47 c7 movdqa %xmm0,-0x39(%rdi) 0.00 : 83b33: 66 0f 7f 47 d7 movdqa %xmm0,-0x29(%rdi) 0.00 : 83b38: 66 0f 7f 47 e7 movdqa %xmm0,-0x19(%rdi) 0.00 : 83b3d: 48 89 57 f7 mov %rdx,-0x9(%rdi) 0.00 : 83b41: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83b44: c3 retq 0.00 : 83b45: 66 0f 7f 87 46 ff ff movdqa %xmm0,-0xba(%rdi) 0.00 : 83b4c: ff 0.00 : 83b4d: 66 0f 7f 87 56 ff ff movdqa %xmm0,-0xaa(%rdi) 0.00 : 83b54: ff 0.00 : 83b55: 66 0f 7f 87 66 ff ff movdqa %xmm0,-0x9a(%rdi) 0.00 : 83b5c: ff 0.00 : 83b5d: 66 0f 7f 87 76 ff ff movdqa %xmm0,-0x8a(%rdi) 0.00 : 83b64: ff 0.00 : 83b65: 66 0f 7f 47 86 movdqa %xmm0,-0x7a(%rdi) 0.00 : 83b6a: 66 0f 7f 47 96 movdqa %xmm0,-0x6a(%rdi) 0.00 : 83b6f: 66 0f 7f 47 a6 movdqa %xmm0,-0x5a(%rdi) 0.00 : 83b74: 66 0f 7f 47 b6 movdqa %xmm0,-0x4a(%rdi) 0.00 : 83b79: 66 0f 7f 47 c6 movdqa %xmm0,-0x3a(%rdi) 0.00 : 83b7e: 66 0f 7f 47 d6 movdqa %xmm0,-0x2a(%rdi) 0.00 : 83b83: 66 0f 7f 47 e6 movdqa %xmm0,-0x1a(%rdi) 0.00 : 83b88: 48 89 57 f6 mov %rdx,-0xa(%rdi) 0.00 : 83b8c: 66 89 57 fe mov %dx,-0x2(%rdi) 0.00 : 83b90: c3 retq 0.00 : 83b91: 66 0f 7f 87 45 ff ff movdqa %xmm0,-0xbb(%rdi) 0.00 : 83b98: ff 0.00 : 83b99: 66 0f 7f 87 55 ff ff movdqa %xmm0,-0xab(%rdi) 0.00 : 83ba0: ff 0.00 : 83ba1: 66 0f 7f 87 65 ff ff movdqa %xmm0,-0x9b(%rdi) 0.00 : 83ba8: ff 0.00 : 83ba9: 66 0f 7f 87 75 ff ff movdqa %xmm0,-0x8b(%rdi) 0.00 : 83bb0: ff 0.00 : 83bb1: 66 0f 7f 47 85 movdqa %xmm0,-0x7b(%rdi) 0.00 : 83bb6: 66 0f 7f 47 95 movdqa %xmm0,-0x6b(%rdi) 0.00 : 83bbb: 66 0f 7f 47 a5 movdqa %xmm0,-0x5b(%rdi) 0.00 : 83bc0: 66 0f 7f 47 b5 movdqa %xmm0,-0x4b(%rdi) 0.00 : 83bc5: 66 0f 7f 47 c5 movdqa %xmm0,-0x3b(%rdi) 0.00 : 83bca: 66 0f 7f 47 d5 movdqa %xmm0,-0x2b(%rdi) 0.00 : 83bcf: 66 0f 7f 47 e5 movdqa %xmm0,-0x1b(%rdi) 0.00 : 83bd4: 48 89 57 f5 mov %rdx,-0xb(%rdi) 0.00 : 83bd8: 66 89 57 fd mov %dx,-0x3(%rdi) 0.00 : 83bdc: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83bdf: c3 retq 0.00 : 83be0: 66 0f 7f 87 44 ff ff movdqa %xmm0,-0xbc(%rdi) 0.00 : 83be7: ff 0.00 : 83be8: 66 0f 7f 87 54 ff ff movdqa %xmm0,-0xac(%rdi) 0.00 : 83bef: ff 0.00 : 83bf0: 66 0f 7f 87 64 ff ff movdqa %xmm0,-0x9c(%rdi) 0.00 : 83bf7: ff 0.00 : 83bf8: 66 0f 7f 87 74 ff ff movdqa %xmm0,-0x8c(%rdi) 0.00 : 83bff: ff 0.00 : 83c00: 66 0f 7f 47 84 movdqa %xmm0,-0x7c(%rdi) 0.00 : 83c05: 66 0f 7f 47 94 movdqa %xmm0,-0x6c(%rdi) 0.00 : 83c0a: 66 0f 7f 47 a4 movdqa %xmm0,-0x5c(%rdi) 0.00 : 83c0f: 66 0f 7f 47 b4 movdqa %xmm0,-0x4c(%rdi) 0.00 : 83c14: 66 0f 7f 47 c4 movdqa %xmm0,-0x3c(%rdi) 0.00 : 83c19: 66 0f 7f 47 d4 movdqa %xmm0,-0x2c(%rdi) 0.00 : 83c1e: 66 0f 7f 47 e4 movdqa %xmm0,-0x1c(%rdi) 0.00 : 83c23: 48 89 57 f4 mov %rdx,-0xc(%rdi) 0.00 : 83c27: 89 57 fc mov %edx,-0x4(%rdi) 0.00 : 83c2a: c3 retq 0.00 : 83c2b: 66 0f 7f 87 43 ff ff movdqa %xmm0,-0xbd(%rdi) 0.00 : 83c32: ff 0.00 : 83c33: 66 0f 7f 87 53 ff ff movdqa %xmm0,-0xad(%rdi) 0.00 : 83c3a: ff 0.00 : 83c3b: 66 0f 7f 87 63 ff ff movdqa %xmm0,-0x9d(%rdi) 0.00 : 83c42: ff 0.00 : 83c43: 66 0f 7f 87 73 ff ff movdqa %xmm0,-0x8d(%rdi) 0.00 : 83c4a: ff 0.00 : 83c4b: 66 0f 7f 47 83 movdqa %xmm0,-0x7d(%rdi) 0.00 : 83c50: 66 0f 7f 47 93 movdqa %xmm0,-0x6d(%rdi) 0.00 : 83c55: 66 0f 7f 47 a3 movdqa %xmm0,-0x5d(%rdi) 0.00 : 83c5a: 66 0f 7f 47 b3 movdqa %xmm0,-0x4d(%rdi) 0.00 : 83c5f: 66 0f 7f 47 c3 movdqa %xmm0,-0x3d(%rdi) 0.00 : 83c64: 66 0f 7f 47 d3 movdqa %xmm0,-0x2d(%rdi) 0.00 : 83c69: 66 0f 7f 47 e3 movdqa %xmm0,-0x1d(%rdi) 0.00 : 83c6e: 48 89 57 f3 mov %rdx,-0xd(%rdi) 0.00 : 83c72: 89 57 fb mov %edx,-0x5(%rdi) 0.00 : 83c75: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83c78: c3 retq 0.00 : 83c79: 66 0f 7f 87 42 ff ff movdqa %xmm0,-0xbe(%rdi) 0.00 : 83c80: ff 0.00 : 83c81: 66 0f 7f 87 52 ff ff movdqa %xmm0,-0xae(%rdi) 0.00 : 83c88: ff 0.00 : 83c89: 66 0f 7f 87 62 ff ff movdqa %xmm0,-0x9e(%rdi) 0.00 : 83c90: ff 0.00 : 83c91: 66 0f 7f 87 72 ff ff movdqa %xmm0,-0x8e(%rdi) 0.00 : 83c98: ff 0.00 : 83c99: 66 0f 7f 47 82 movdqa %xmm0,-0x7e(%rdi) 0.00 : 83c9e: 66 0f 7f 47 92 movdqa %xmm0,-0x6e(%rdi) 0.00 : 83ca3: 66 0f 7f 47 a2 movdqa %xmm0,-0x5e(%rdi) 0.00 : 83ca8: 66 0f 7f 47 b2 movdqa %xmm0,-0x4e(%rdi) 0.00 : 83cad: 66 0f 7f 47 c2 movdqa %xmm0,-0x3e(%rdi) 0.00 : 83cb2: 66 0f 7f 47 d2 movdqa %xmm0,-0x2e(%rdi) 0.00 : 83cb7: 66 0f 7f 47 e2 movdqa %xmm0,-0x1e(%rdi) 0.00 : 83cbc: 48 89 57 f2 mov %rdx,-0xe(%rdi) 0.00 : 83cc0: 89 57 fa mov %edx,-0x6(%rdi) 0.00 : 83cc3: 66 89 57 fe mov %dx,-0x2(%rdi) 0.00 : 83cc7: c3 retq 0.00 : 83cc8: 66 0f 7f 87 41 ff ff movdqa %xmm0,-0xbf(%rdi) 0.00 : 83ccf: ff 0.00 : 83cd0: 66 0f 7f 87 51 ff ff movdqa %xmm0,-0xaf(%rdi) 0.00 : 83cd7: ff 0.00 : 83cd8: 66 0f 7f 87 61 ff ff movdqa %xmm0,-0x9f(%rdi) 0.00 : 83cdf: ff 0.00 : 83ce0: 66 0f 7f 87 71 ff ff movdqa %xmm0,-0x8f(%rdi) 0.00 : 83ce7: ff 0.00 : 83ce8: 66 0f 7f 47 81 movdqa %xmm0,-0x7f(%rdi) 0.00 : 83ced: 66 0f 7f 47 91 movdqa %xmm0,-0x6f(%rdi) 0.00 : 83cf2: 66 0f 7f 47 a1 movdqa %xmm0,-0x5f(%rdi) 0.00 : 83cf7: 66 0f 7f 47 b1 movdqa %xmm0,-0x4f(%rdi) 0.00 : 83cfc: 66 0f 7f 47 c1 movdqa %xmm0,-0x3f(%rdi) 0.00 : 83d01: 66 0f 7f 47 d1 movdqa %xmm0,-0x2f(%rdi) 0.00 : 83d06: 66 0f 7f 47 e1 movdqa %xmm0,-0x1f(%rdi) 0.00 : 83d0b: 48 89 57 f1 mov %rdx,-0xf(%rdi) 0.00 : 83d0f: 89 57 f9 mov %edx,-0x7(%rdi) 0.00 : 83d12: 66 89 57 fd mov %dx,-0x3(%rdi) 0.00 : 83d16: 88 57 ff mov %dl,-0x1(%rdi) 0.00 : 83d19: c3 retq 0.00 : 83d1a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 83d20: 44 8b 0d 11 e4 2e 00 mov 0x2ee411(%rip),%r9d # 372138 <__x86_64_shared_cache_size> 0.00 : 83d27: 4d 39 c8 cmp %r9,%r8 0.00 : 83d2a: 77 64 ja 83d90 <__GI_memset+0x920> 0.00 : 83d2c: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 83d30: 4d 8d 40 80 lea -0x80(%r8),%r8 0.00 : 83d34: 49 81 f8 80 00 00 00 cmp $0x80,%r8 0.00 : 83d3b: 66 0f 7f 07 movdqa %xmm0,(%rdi) 0.00 : 83d3f: 66 0f 7f 47 10 movdqa %xmm0,0x10(%rdi) 0.00 : 83d44: 66 0f 7f 47 20 movdqa %xmm0,0x20(%rdi) 0.00 : 83d49: 66 0f 7f 47 30 movdqa %xmm0,0x30(%rdi) 0.00 : 83d4e: 66 0f 7f 47 40 movdqa %xmm0,0x40(%rdi) 0.00 : 83d53: 66 0f 7f 47 50 movdqa %xmm0,0x50(%rdi) 0.00 : 83d58: 66 0f 7f 47 60 movdqa %xmm0,0x60(%rdi) 0.00 : 83d5d: 66 0f 7f 47 70 movdqa %xmm0,0x70(%rdi) 0.00 : 83d62: 48 8d bf 80 00 00 00 lea 0x80(%rdi),%rdi 0.00 : 83d69: 73 c5 jae 83d30 <__GI_memset+0x8c0> 0.00 : 83d6b: 4c 01 c7 add %r8,%rdi 0.00 : 83d6e: 4c 8d 1d 38 fb ff ff lea -0x4c8(%rip),%r11 # 838ad <__GI_memset+0x43d> 0.00 : 83d75: 48 8d 0d e4 25 0b 00 lea 0xb25e4(%rip),%rcx # 136360 0.00 : 83d7c: 4a 0f bf 0c 41 movswq (%rcx,%r8,2),%rcx 0.00 : 83d81: 4e 8d 1c 19 lea (%rcx,%r11,1),%r11 0.00 : 83d85: 41 ff e3 jmpq *%r11 0.00 : 83d88: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 83d8f: 00 0.00 : 83d90: 49 83 f9 00 cmp $0x0,%r9 0.00 : 83d94: 74 9a je 83d30 <__GI_memset+0x8c0> 0.00 : 83d96: eb 08 jmp 83da0 <__GI_memset+0x930> 0.00 : 83d98: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 83d9f: 00 0.00 : 83da0: 4d 8d 40 80 lea -0x80(%r8),%r8 44.44 : 83da4: 49 81 f8 80 00 00 00 cmp $0x80,%r8 0.00 : 83dab: 66 0f e7 07 movntdq %xmm0,(%rdi) 0.00 : 83daf: 66 0f e7 47 10 movntdq %xmm0,0x10(%rdi) 0.00 : 83db4: 66 0f e7 47 20 movntdq %xmm0,0x20(%rdi) 0.00 : 83db9: 66 0f e7 47 30 movntdq %xmm0,0x30(%rdi) 11.11 : 83dbe: 66 0f e7 47 40 movntdq %xmm0,0x40(%rdi) 0.00 : 83dc3: 66 0f e7 47 50 movntdq %xmm0,0x50(%rdi) 0.00 : 83dc8: 66 0f e7 47 60 movntdq %xmm0,0x60(%rdi) 0.00 : 83dcd: 66 0f e7 47 70 movntdq %xmm0,0x70(%rdi) 0.00 : 83dd2: 48 8d bf 80 00 00 00 lea 0x80(%rdi),%rdi 0.00 : 83dd9: 73 c5 jae 83da0 <__GI_memset+0x930> 0.00 : 83ddb: 0f ae f8 sfence 0.00 : 83dde: 4c 01 c7 add %r8,%rdi 0.00 : 83de1: 4c 8d 1d c5 fa ff ff lea -0x53b(%rip),%r11 # 838ad <__GI_memset+0x43d> 0.00 : 83de8: 48 8d 0d 71 25 0b 00 lea 0xb2571(%rip),%rcx # 136360 0.00 : 83def: 4a 0f bf 0c 41 movswq (%rcx,%r8,2),%rcx 0.00 : 83df4: 4e 8d 1c 19 lea (%rcx,%r11,1),%r11 0.00 : 83df8: 41 ff e3 jmpq *%r11 0.00 : 83dfb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 83e00: 49 81 f8 00 20 00 00 cmp $0x2000,%r8 0.00 : 83e07: 0f 83 83 00 00 00 jae 83e90 <__GI_memset+0xa20> 0.00 : 83e0d: 0f 1f 00 nopl (%rax) 0.00 : 83e10: 4c 89 c1 mov %r8,%rcx 0.00 : 83e13: 48 c1 e9 07 shr $0x7,%rcx 0.00 : 83e17: 74 52 je 83e6b <__GI_memset+0x9fb> 0.00 : 83e19: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 83e20: 48 ff c9 dec %rcx 0.00 : 83e23: 48 89 17 mov %rdx,(%rdi) 0.00 : 83e26: 48 89 57 08 mov %rdx,0x8(%rdi) 0.00 : 83e2a: 48 89 57 10 mov %rdx,0x10(%rdi) 0.00 : 83e2e: 48 89 57 18 mov %rdx,0x18(%rdi) 0.00 : 83e32: 48 89 57 20 mov %rdx,0x20(%rdi) 0.00 : 83e36: 48 89 57 28 mov %rdx,0x28(%rdi) 0.00 : 83e3a: 48 89 57 30 mov %rdx,0x30(%rdi) 0.00 : 83e3e: 48 89 57 38 mov %rdx,0x38(%rdi) 0.00 : 83e42: 48 89 57 40 mov %rdx,0x40(%rdi) 0.00 : 83e46: 48 89 57 48 mov %rdx,0x48(%rdi) 0.00 : 83e4a: 48 89 57 50 mov %rdx,0x50(%rdi) 0.00 : 83e4e: 48 89 57 58 mov %rdx,0x58(%rdi) 0.00 : 83e52: 48 89 57 60 mov %rdx,0x60(%rdi) 0.00 : 83e56: 48 89 57 68 mov %rdx,0x68(%rdi) 0.00 : 83e5a: 48 89 57 70 mov %rdx,0x70(%rdi) 0.00 : 83e5e: 48 89 57 78 mov %rdx,0x78(%rdi) 0.00 : 83e62: 48 8d bf 80 00 00 00 lea 0x80(%rdi),%rdi 0.00 : 83e69: 75 b5 jne 83e20 <__GI_memset+0x9b0> 0.00 : 83e6b: 41 83 e0 7f and $0x7f,%r8d 0.00 : 83e6f: 4a 8d 3c 07 lea (%rdi,%r8,1),%rdi 0.00 : 83e73: 4c 8d 1d 42 f6 ff ff lea -0x9be(%rip),%r11 # 834bc <__GI_memset+0x4c> 0.00 : 83e7a: 48 8d 0d 8f 23 0b 00 lea 0xb238f(%rip),%rcx # 136210 0.00 : 83e81: 4a 0f bf 0c 41 movswq (%rcx,%r8,2),%rcx 0.00 : 83e86: 4e 8d 1c 19 lea (%rcx,%r11,1),%r11 0.00 : 83e8a: 41 ff e3 jmpq *%r11 0.00 : 83e8d: 0f 1f 00 nopl (%rax) 0.00 : 83e90: 44 8b 0d a1 e2 2e 00 mov 0x2ee2a1(%rip),%r9d # 372138 <__x86_64_shared_cache_size> 0.00 : 83e97: 4d 39 c1 cmp %r8,%r9 0.00 : 83e9a: 4d 0f 47 c8 cmova %r8,%r9 0.00 : 83e9e: 76 10 jbe 83eb0 <__GI_memset+0xa40> 0.00 : 83ea0: 49 81 f8 00 00 01 00 cmp $0x10000,%r8 0.00 : 83ea7: 0f 83 63 ff ff ff jae 83e10 <__GI_memset+0x9a0> 0.00 : 83ead: 0f 1f 00 nopl (%rax) 0.00 : 83eb0: 4c 89 c9 mov %r9,%rcx 0.00 : 83eb3: 49 83 e1 f8 and $0xfffffffffffffff8,%r9 0.00 : 83eb7: 48 c1 e9 03 shr $0x3,%rcx 0.00 : 83ebb: 74 07 je 83ec4 <__GI_memset+0xa54> 0.00 : 83ebd: 48 92 xchg %rax,%rdx 0.00 : 83ebf: f3 48 ab rep stos %rax,%es:(%rdi) 0.00 : 83ec2: 48 92 xchg %rax,%rdx 0.00 : 83ec4: 4d 29 c8 sub %r9,%r8 0.00 : 83ec7: 77 27 ja 83ef0 <__GI_memset+0xa80> 0.00 : 83ec9: 41 83 e0 07 and $0x7,%r8d 0.00 : 83ecd: 4a 8d 3c 07 lea (%rdi,%r8,1),%rdi 0.00 : 83ed1: 4c 8d 1d e4 f5 ff ff lea -0xa1c(%rip),%r11 # 834bc <__GI_memset+0x4c> 0.00 : 83ed8: 48 8d 0d 31 23 0b 00 lea 0xb2331(%rip),%rcx # 136210 0.00 : 83edf: 4a 0f bf 0c 41 movswq (%rcx,%r8,2),%rcx 0.00 : 83ee4: 4e 8d 1c 19 lea (%rcx,%r11,1),%r11 0.00 : 83ee8: 41 ff e3 jmpq *%r11 0.00 : 83eeb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 83ef0: 4c 89 c1 mov %r8,%rcx 0.00 : 83ef3: 48 c1 e9 07 shr $0x7,%rcx 0.00 : 83ef7: 74 65 je 83f5e <__GI_memset+0xaee> 0.00 : 83ef9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 83f00: 48 ff c9 dec %rcx 0.00 : 83f03: 48 0f c3 17 movnti %rdx,(%rdi) 0.00 : 83f07: 48 0f c3 57 08 movnti %rdx,0x8(%rdi) 0.00 : 83f0c: 48 0f c3 57 10 movnti %rdx,0x10(%rdi) 0.00 : 83f11: 48 0f c3 57 18 movnti %rdx,0x18(%rdi) 0.00 : 83f16: 48 0f c3 57 20 movnti %rdx,0x20(%rdi) 0.00 : 83f1b: 48 0f c3 57 28 movnti %rdx,0x28(%rdi) 0.00 : 83f20: 48 0f c3 57 30 movnti %rdx,0x30(%rdi) 0.00 : 83f25: 48 0f c3 57 38 movnti %rdx,0x38(%rdi) 0.00 : 83f2a: 48 0f c3 57 40 movnti %rdx,0x40(%rdi) 0.00 : 83f2f: 48 0f c3 57 48 movnti %rdx,0x48(%rdi) 0.00 : 83f34: 48 0f c3 57 50 movnti %rdx,0x50(%rdi) 0.00 : 83f39: 48 0f c3 57 58 movnti %rdx,0x58(%rdi) 0.00 : 83f3e: 48 0f c3 57 60 movnti %rdx,0x60(%rdi) 0.00 : 83f43: 48 0f c3 57 68 movnti %rdx,0x68(%rdi) 0.00 : 83f48: 48 0f c3 57 70 movnti %rdx,0x70(%rdi) 0.00 : 83f4d: 48 0f c3 57 78 movnti %rdx,0x78(%rdi) 0.00 : 83f52: 48 8d bf 80 00 00 00 lea 0x80(%rdi),%rdi 0.00 : 83f59: 75 a5 jne 83f00 <__GI_memset+0xa90> 0.00 : 83f5b: 0f ae f8 sfence 0.00 : 83f5e: 41 83 e0 7f and $0x7f,%r8d 0.00 : 83f62: 4a 8d 3c 07 lea (%rdi,%r8,1),%rdi 0.00 : 83f66: 4c 8d 1d 4f f5 ff ff lea -0xab1(%rip),%r11 # 834bc <__GI_memset+0x4c> 0.00 : 83f6d: 48 8d 0d 9c 22 0b 00 lea 0xb229c(%rip),%rcx # 136210 0.00 : 83f74: 4a 0f bf 0c 41 movswq (%rcx,%r8,2),%rcx 0.00 : 83f79: 4e 8d 1c 19 lea (%rcx,%r11,1),%r11 0.00 : 83f7d: 41 ff e3 jmpq *%r11 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:57 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:63 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:65 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b7f00 : : } : : /* Entry to a plan node */ : void : InstrStartNode(Instrumentation *instr) : { 0.00 : 5b7f00: 55 push %rbp 0.00 : 5b7f01: 48 89 e5 mov %rsp,%rbp 0.00 : 5b7f04: 53 push %rbx 0.00 : 5b7f05: 48 89 fb mov %rdi,%rbx 0.00 : 5b7f08: 48 83 ec 08 sub $0x8,%rsp : if (instr->need_timer) 0.00 : 5b7f0c: 80 3f 00 cmpb $0x0,(%rdi) 0.00 : 5b7f0f: 74 4a je 5b7f5b : { : if (INSTR_TIME_IS_ZERO(instr->starttime)) 0.00 : 5b7f11: 48 83 7f 10 00 cmpq $0x0,0x10(%rdi) 0.00 : 5b7f16: 75 07 jne 5b7f1f 0.00 : 5b7f18: 48 83 7f 08 00 cmpq $0x0,0x8(%rdi) 0.00 : 5b7f1d: 74 31 je 5b7f50 : INSTR_TIME_SET_CURRENT(instr->starttime); : else : elog(ERROR, "InstrStartNode called twice in a row"); 0.00 : 5b7f1f: ba 98 b6 88 00 mov $0x88b698,%edx 0.00 : 5b7f24: be 3b 00 00 00 mov $0x3b,%esi 0.00 : 5b7f29: bf fa b5 88 00 mov $0x88b5fa,%edi 0.00 : 5b7f2e: e8 ed 34 1c 00 callq 77b420 0.00 : 5b7f33: be 58 b6 88 00 mov $0x88b658,%esi 0.00 : 5b7f38: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5b7f3d: 31 c0 xor %eax,%eax 0.00 : 5b7f3f: e8 ec 32 1c 00 callq 77b230 0.00 : 5b7f44: e8 87 15 eb ff callq 4694d0 0.00 : 5b7f49: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : InstrStartNode(Instrumentation *instr) : { : if (instr->need_timer) : { : if (INSTR_TIME_IS_ZERO(instr->starttime)) : INSTR_TIME_SET_CURRENT(instr->starttime); 12.50 : 5b7f50: 48 8d 7f 08 lea 0x8(%rdi),%rdi 0.00 : 5b7f54: 31 f6 xor %esi,%esi 0.00 : 5b7f56: e8 65 16 eb ff callq 4695c0 : else : elog(ERROR, "InstrStartNode called twice in a row"); : } : : /* save buffer usage totals at node entry, if needed */ : if (instr->need_bufusage) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:63 12.50 : 5b7f5b: 80 7b 01 00 cmpb $0x0,0x1(%rbx) 0.00 : 5b7f5f: 0f 84 a9 00 00 00 je 5b800e : instr->bufusage_start = pgBufferUsage; 0.00 : 5b7f65: 48 8b 05 f4 77 60 00 mov 0x6077f4(%rip),%rax # bbf760 0.00 : 5b7f6c: 48 89 43 38 mov %rax,0x38(%rbx) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 12.50 : 5b7f70: 48 8b 05 f1 77 60 00 mov 0x6077f1(%rip),%rax # bbf768 0.00 : 5b7f77: 48 89 43 40 mov %rax,0x40(%rbx) 0.00 : 5b7f7b: 48 8b 05 ee 77 60 00 mov 0x6077ee(%rip),%rax # bbf770 0.00 : 5b7f82: 48 89 43 48 mov %rax,0x48(%rbx) 12.50 : 5b7f86: 48 8b 05 eb 77 60 00 mov 0x6077eb(%rip),%rax # bbf778 0.00 : 5b7f8d: 48 89 43 50 mov %rax,0x50(%rbx) 0.00 : 5b7f91: 48 8b 05 e8 77 60 00 mov 0x6077e8(%rip),%rax # bbf780 0.00 : 5b7f98: 48 89 43 58 mov %rax,0x58(%rbx) 12.50 : 5b7f9c: 48 8b 05 e5 77 60 00 mov 0x6077e5(%rip),%rax # bbf788 0.00 : 5b7fa3: 48 89 43 60 mov %rax,0x60(%rbx) 0.00 : 5b7fa7: 48 8b 05 e2 77 60 00 mov 0x6077e2(%rip),%rax # bbf790 0.00 : 5b7fae: 48 89 43 68 mov %rax,0x68(%rbx) 0.00 : 5b7fb2: 48 8b 05 df 77 60 00 mov 0x6077df(%rip),%rax # bbf798 0.00 : 5b7fb9: 48 89 43 70 mov %rax,0x70(%rbx) 0.00 : 5b7fbd: 48 8b 05 dc 77 60 00 mov 0x6077dc(%rip),%rax # bbf7a0 0.00 : 5b7fc4: 48 89 43 78 mov %rax,0x78(%rbx) 12.50 : 5b7fc8: 48 8b 05 d9 77 60 00 mov 0x6077d9(%rip),%rax # bbf7a8 0.00 : 5b7fcf: 48 89 83 80 00 00 00 mov %rax,0x80(%rbx) 0.00 : 5b7fd6: 48 8b 05 d3 77 60 00 mov 0x6077d3(%rip),%rax # bbf7b0 0.00 : 5b7fdd: 48 89 83 88 00 00 00 mov %rax,0x88(%rbx) 12.50 : 5b7fe4: 48 8b 05 cd 77 60 00 mov 0x6077cd(%rip),%rax # bbf7b8 0.00 : 5b7feb: 48 89 83 90 00 00 00 mov %rax,0x90(%rbx) 0.00 : 5b7ff2: 48 8b 05 c7 77 60 00 mov 0x6077c7(%rip),%rax # bbf7c0 0.00 : 5b7ff9: 48 89 83 98 00 00 00 mov %rax,0x98(%rbx) 0.00 : 5b8000: 48 8b 05 c1 77 60 00 mov 0x6077c1(%rip),%rax # bbf7c8 0.00 : 5b8007: 48 89 83 a0 00 00 00 mov %rax,0xa0(%rbx) : } 0.00 : 5b800e: 48 83 c4 08 add $0x8,%rsp 0.00 : 5b8012: 5b pop %rbx /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:65 12.50 : 5b8013: c9 leaveq Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 14.29 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 14.29 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 14.29 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1176 14.29 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1179 14.29 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 14.29 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 14.29 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000046f400 : : * slot's tupdesc's last attribute will be considered NULL even : * when the physical tuple is longer than the tupdesc. : */ : Datum : slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull) : { /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 14.29 : 46f400: 55 push %rbp 0.00 : 46f401: 48 89 e5 mov %rsp,%rbp 14.29 : 46f404: 48 89 5d e0 mov %rbx,-0x20(%rbp) 0.00 : 46f408: 4c 89 65 e8 mov %r12,-0x18(%rbp) 0.00 : 46f40c: 48 89 fb mov %rdi,%rbx 0.00 : 46f40f: 4c 89 6d f0 mov %r13,-0x10(%rbp) 0.00 : 46f413: 4c 89 75 f8 mov %r14,-0x8(%rbp) 0.00 : 46f417: 48 83 ec 20 sub $0x20,%rsp : HeapTupleHeader tup; : : /* : * system attributes are handled by heap_getsysattr : */ : if (attnum <= 0) 0.00 : 46f41b: 85 f6 test %esi,%esi : * slot's tupdesc's last attribute will be considered NULL even : * when the physical tuple is longer than the tupdesc. : */ : Datum : slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull) : { 0.00 : 46f41d: 49 89 d4 mov %rdx,%r12 : HeapTuple tuple = slot->tts_tuple; 0.00 : 46f420: 48 8b 7f 08 mov 0x8(%rdi),%rdi : TupleDesc tupleDesc = slot->tts_tupleDescriptor; 0.00 : 46f424: 48 8b 53 10 mov 0x10(%rbx),%rdx : HeapTupleHeader tup; : : /* : * system attributes are handled by heap_getsysattr : */ : if (attnum <= 0) 0.00 : 46f428: 0f 8e a2 00 00 00 jle 46f4d0 : } : : /* : * fast path if desired attribute already cached : */ : if (attnum <= slot->tts_nvalid) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1176 14.29 : 46f42e: 3b 73 24 cmp 0x24(%rbx),%esi 0.00 : 46f431: 7e 65 jle 46f498 : } : : /* : * return NULL if attnum is out of range according to the tupdesc : */ : if (attnum > tupleDesc->natts) 0.00 : 46f433: 3b 32 cmp (%rdx),%esi 0.00 : 46f435: 7f 51 jg 46f488 : : /* : * otherwise we had better have a physical tuple (tts_nvalid should equal : * natts in all virtual-tuple cases) : */ : if (tuple == NULL) /* internal error */ 0.00 : 46f437: 48 85 ff test %rdi,%rdi 0.00 : 46f43a: 0f 84 34 01 00 00 je 46f574 : * : * (We have to check this separately because of various inheritance and : * table-alteration scenarios: the tuple could be either longer or shorter : * than the tupdesc.) : */ : tup = tuple->t_data; 0.00 : 46f440: 48 8b 7f 10 mov 0x10(%rdi),%rdi : if (attnum > HeapTupleHeaderGetNatts(tup)) 0.00 : 46f444: 0f b7 47 12 movzwl 0x12(%rdi),%eax 0.00 : 46f448: 25 ff 07 00 00 and $0x7ff,%eax 0.00 : 46f44d: 39 c6 cmp %eax,%esi 0.00 : 46f44f: 7f 37 jg 46f488 : } : : /* : * check if target attribute is null: no point in groveling through tuple : */ : if (HeapTupleHasNulls(tuple) && att_isnull(attnum - 1, tup->t_bits)) 0.00 : 46f451: f6 47 14 01 testb $0x1,0x14(%rdi) 0.00 : 46f455: 74 18 je 46f46f 0.00 : 46f457: 8d 4e ff lea -0x1(%rsi),%ecx 0.00 : 46f45a: 89 c8 mov %ecx,%eax 0.00 : 46f45c: 83 e1 07 and $0x7,%ecx 0.00 : 46f45f: c1 f8 03 sar $0x3,%eax 0.00 : 46f462: 48 98 cltq 0.00 : 46f464: 0f b6 44 07 17 movzbl 0x17(%rdi,%rax,1),%eax 0.00 : 46f469: d3 f8 sar %cl,%eax 0.00 : 46f46b: a8 01 test $0x1,%al 0.00 : 46f46d: 74 19 je 46f488 : /* : * If the attribute's column has been dropped, we force a NULL result. : * This case should not happen in normal use, but it could happen if we : * are executing a plan cached before the column was dropped. : */ : if (tupleDesc->attrs[attnum - 1]->attisdropped) 0.00 : 46f46f: 4c 63 ee movslq %esi,%r13 0.00 : 46f472: 48 8b 42 08 mov 0x8(%rdx),%rax 0.00 : 46f476: 4d 8d 75 ff lea -0x1(%r13),%r14 0.00 : 46f47a: 4a 8b 04 f0 mov (%rax,%r14,8),%rax 0.00 : 46f47e: 80 78 61 00 cmpb $0x0,0x61(%rax) 0.00 : 46f482: 74 7c je 46f500 0.00 : 46f484: 0f 1f 40 00 nopl 0x0(%rax) : { : *isnull = true; 0.00 : 46f488: 41 c6 04 24 01 movb $0x1,(%r12) 0.00 : 46f48d: 31 c0 xor %eax,%eax : /* : * The result is acquired from tts_values array. : */ : *isnull = slot->tts_isnull[attnum - 1]; : return slot->tts_values[attnum - 1]; : } 0.00 : 46f48f: eb 20 jmp 46f4b1 0.00 : 46f491: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : /* : * fast path if desired attribute already cached : */ : if (attnum <= slot->tts_nvalid) : { : *isnull = slot->tts_isnull[attnum - 1]; 0.00 : 46f498: 48 8b 43 30 mov 0x30(%rbx),%rax 0.00 : 46f49c: 48 63 d6 movslq %esi,%rdx 0.00 : 46f49f: 0f b6 44 10 ff movzbl -0x1(%rax,%rdx,1),%eax 0.00 : 46f4a4: 41 88 04 24 mov %al,(%r12) : return slot->tts_values[attnum - 1]; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1179 14.29 : 46f4a8: 48 8b 43 28 mov 0x28(%rbx),%rax 0.00 : 46f4ac: 48 8b 44 d0 f8 mov -0x8(%rax,%rdx,8),%rax : /* : * The result is acquired from tts_values array. : */ : *isnull = slot->tts_isnull[attnum - 1]; : return slot->tts_values[attnum - 1]; : } 0.00 : 46f4b1: 48 8b 1c 24 mov (%rsp),%rbx /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 14.29 : 46f4b5: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 46f4ba: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 46f4bf: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 14.29 : 46f4c4: c9 leaveq 14.29 : 46f4c5: c3 retq 0.00 : 46f4c6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 46f4cd: 00 00 00 : /* : * system attributes are handled by heap_getsysattr : */ : if (attnum <= 0) : { : if (tuple == NULL) /* internal error */ 0.00 : 46f4d0: 48 85 ff test %rdi,%rdi 0.00 : 46f4d3: 74 4b je 46f520 : elog(ERROR, "cannot extract system attribute from virtual tuple"); : if (tuple == &(slot->tts_minhdr)) /* internal error */ 0.00 : 46f4d5: 48 8d 43 40 lea 0x40(%rbx),%rax 0.00 : 46f4d9: 48 39 c7 cmp %rax,%rdi 0.00 : 46f4dc: 74 6c je 46f54a : elog(ERROR, "cannot extract system attribute from minimal tuple"); : return heap_getsysattr(tuple, attnum, tupleDesc, isnull); 0.00 : 46f4de: 4c 89 e1 mov %r12,%rcx : /* : * The result is acquired from tts_values array. : */ : *isnull = slot->tts_isnull[attnum - 1]; : return slot->tts_values[attnum - 1]; : } 0.00 : 46f4e1: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 46f4e5: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 46f4ea: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 46f4ef: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 0.00 : 46f4f4: c9 leaveq : { : if (tuple == NULL) /* internal error */ : elog(ERROR, "cannot extract system attribute from virtual tuple"); : if (tuple == &(slot->tts_minhdr)) /* internal error */ : elog(ERROR, "cannot extract system attribute from minimal tuple"); : return heap_getsysattr(tuple, attnum, tupleDesc, isnull); 0.00 : 46f4f5: e9 d6 f7 ff ff jmpq 46ecd0 0.00 : 46f4fa: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : } : : /* : * Extract the attribute, along with any preceding attributes. : */ : slot_deform_tuple(slot, attnum); 0.00 : 46f500: 48 89 df mov %rbx,%rdi 0.00 : 46f503: e8 08 fa ff ff callq 46ef10 : : /* : * The result is acquired from tts_values array. : */ : *isnull = slot->tts_isnull[attnum - 1]; 0.00 : 46f508: 48 8b 43 30 mov 0x30(%rbx),%rax 0.00 : 46f50c: 42 0f b6 44 28 ff movzbl -0x1(%rax,%r13,1),%eax 0.00 : 46f512: 41 88 04 24 mov %al,(%r12) : return slot->tts_values[attnum - 1]; 0.00 : 46f516: 48 8b 43 28 mov 0x28(%rbx),%rax 0.00 : 46f51a: 4a 8b 04 f0 mov (%rax,%r14,8),%rax : } 0.00 : 46f51e: eb 91 jmp 46f4b1 : * system attributes are handled by heap_getsysattr : */ : if (attnum <= 0) : { : if (tuple == NULL) /* internal error */ : elog(ERROR, "cannot extract system attribute from virtual tuple"); 0.00 : 46f520: ba f1 f6 7a 00 mov $0x7af6f1,%edx 0.00 : 46f525: be 8f 04 00 00 mov $0x48f,%esi 0.00 : 46f52a: bf f4 f5 7a 00 mov $0x7af5f4,%edi 0.00 : 46f52f: e8 ec be 30 00 callq 77b420 0.00 : 46f534: be 40 f7 7a 00 mov $0x7af740,%esi 0.00 : 46f539: bf 14 00 00 00 mov $0x14,%edi 0.00 : 46f53e: 31 c0 xor %eax,%eax 0.00 : 46f540: e8 eb bc 30 00 callq 77b230 0.00 : 46f545: e8 86 9f ff ff callq 4694d0 : if (tuple == &(slot->tts_minhdr)) /* internal error */ : elog(ERROR, "cannot extract system attribute from minimal tuple"); 0.00 : 46f54a: ba f1 f6 7a 00 mov $0x7af6f1,%edx 0.00 : 46f54f: be 91 04 00 00 mov $0x491,%esi 0.00 : 46f554: bf f4 f5 7a 00 mov $0x7af5f4,%edi 0.00 : 46f559: e8 c2 be 30 00 callq 77b420 0.00 : 46f55e: be 78 f7 7a 00 mov $0x7af778,%esi 0.00 : 46f563: bf 14 00 00 00 mov $0x14,%edi 0.00 : 46f568: 31 c0 xor %eax,%eax 0.00 : 46f56a: e8 c1 bc 30 00 callq 77b230 0.00 : 46f56f: e8 5c 9f ff ff callq 4694d0 : /* : * otherwise we had better have a physical tuple (tts_nvalid should equal : * natts in all virtual-tuple cases) : */ : if (tuple == NULL) /* internal error */ : elog(ERROR, "cannot extract attribute from empty tuple slot"); 0.00 : 46f574: ba f1 f6 7a 00 mov $0x7af6f1,%edx 0.00 : 46f579: be ac 04 00 00 mov $0x4ac,%esi 0.00 : 46f57e: bf f4 f5 7a 00 mov $0x7af5f4,%edi 0.00 : 46f583: e8 98 be 30 00 callq 77b420 0.00 : 46f588: be b0 f7 7a 00 mov $0x7af7b0,%esi 0.00 : 46f58d: bf 14 00 00 00 mov $0x14,%edi 0.00 : 46f592: 31 c0 xor %eax,%eax 0.00 : 46f594: e8 97 bc 30 00 callq 77b230 0.00 : 46f599: e8 32 9f ff ff callq 4694d0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 28.57 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:347 28.57 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:383 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:334 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:359 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:383 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b4480 : : TupleTableSlot * : ExecStoreTuple(HeapTuple tuple, : TupleTableSlot *slot, : Buffer buffer, : bool shouldFree) : { 0.00 : 5b4480: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:334 14.29 : 5b4481: 48 89 e5 mov %rsp,%rbp 0.00 : 5b4484: 48 89 5d e0 mov %rbx,-0x20(%rbp) 0.00 : 5b4488: 4c 89 65 e8 mov %r12,-0x18(%rbp) 0.00 : 5b448c: 48 89 f3 mov %rsi,%rbx 0.00 : 5b448f: 4c 89 6d f0 mov %r13,-0x10(%rbp) 0.00 : 5b4493: 4c 89 75 f8 mov %r14,-0x8(%rbp) 0.00 : 5b4497: 48 83 ec 20 sub $0x20,%rsp : Assert(BufferIsValid(buffer) ? (!shouldFree) : true); : : /* : * Free any old physical tuple belonging to the slot. : */ : if (slot->tts_shouldFree) /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:347 28.57 : 5b449b: 80 7e 05 00 cmpb $0x0,0x5(%rsi) : TupleTableSlot * : ExecStoreTuple(HeapTuple tuple, : TupleTableSlot *slot, : Buffer buffer, : bool shouldFree) : { 0.00 : 5b449f: 49 89 fe mov %rdi,%r14 0.00 : 5b44a2: 41 89 d4 mov %edx,%r12d 0.00 : 5b44a5: 41 89 cd mov %ecx,%r13d : Assert(BufferIsValid(buffer) ? (!shouldFree) : true); : : /* : * Free any old physical tuple belonging to the slot. : */ : if (slot->tts_shouldFree) 0.00 : 5b44a8: 0f 85 92 00 00 00 jne 5b4540 : heap_freetuple(slot->tts_tuple); : if (slot->tts_shouldFreeMin) 0.00 : 5b44ae: 80 7b 06 00 cmpb $0x0,0x6(%rbx) 0.00 : 5b44b2: 75 74 jne 5b4528 : * This is coded to optimize the case where the slot previously held a : * tuple on the same disk page: in that case releasing and re-acquiring : * the pin is a waste of cycles. This is a common situation during : * seqscans, so it's worth troubling over. : */ : if (slot->tts_buffer != buffer) 0.00 : 5b44b4: 8b 7b 20 mov 0x20(%rbx),%edi : heap_free_minimal_tuple(slot->tts_mintuple); : : /* : * Store the new tuple into the specified slot. : */ : slot->tts_isempty = false; 0.00 : 5b44b7: c6 43 04 00 movb $0x0,0x4(%rbx) : slot->tts_shouldFree = shouldFree; 0.00 : 5b44bb: 44 88 6b 05 mov %r13b,0x5(%rbx) : slot->tts_shouldFreeMin = false; 0.00 : 5b44bf: c6 43 06 00 movb $0x0,0x6(%rbx) : slot->tts_tuple = tuple; 0.00 : 5b44c3: 4c 89 73 08 mov %r14,0x8(%rbx) : slot->tts_mintuple = NULL; /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:359 14.29 : 5b44c7: 48 c7 43 38 00 00 00 movq $0x0,0x38(%rbx) 0.00 : 5b44ce: 00 : * This is coded to optimize the case where the slot previously held a : * tuple on the same disk page: in that case releasing and re-acquiring : * the pin is a waste of cycles. This is a common situation during : * seqscans, so it's worth troubling over. : */ : if (slot->tts_buffer != buffer) 0.00 : 5b44cf: 44 39 e7 cmp %r12d,%edi : slot->tts_shouldFreeMin = false; : slot->tts_tuple = tuple; : slot->tts_mintuple = NULL; : : /* Mark extracted state invalid */ : slot->tts_nvalid = 0; 0.00 : 5b44d2: c7 43 24 00 00 00 00 movl $0x0,0x24(%rbx) : * This is coded to optimize the case where the slot previously held a : * tuple on the same disk page: in that case releasing and re-acquiring : * the pin is a waste of cycles. This is a common situation during : * seqscans, so it's worth troubling over. : */ : if (slot->tts_buffer != buffer) 0.00 : 5b44d9: 74 0d je 5b44e8 : { : if (BufferIsValid(slot->tts_buffer)) 0.00 : 5b44db: 85 ff test %edi,%edi 0.00 : 5b44dd: 75 31 jne 5b4510 : ReleaseBuffer(slot->tts_buffer); : slot->tts_buffer = buffer; : if (BufferIsValid(buffer)) 0.00 : 5b44df: 45 85 e4 test %r12d,%r12d : */ : if (slot->tts_buffer != buffer) : { : if (BufferIsValid(slot->tts_buffer)) : ReleaseBuffer(slot->tts_buffer); : slot->tts_buffer = buffer; 0.00 : 5b44e2: 44 89 63 20 mov %r12d,0x20(%rbx) : if (BufferIsValid(buffer)) 0.00 : 5b44e6: 75 18 jne 5b4500 : IncrBufferRefCount(buffer); : } : : return slot; : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:383 14.29 : 5b44e8: 48 89 d8 mov %rbx,%rax 0.00 : 5b44eb: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 5b44f0: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 5b44f4: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 5b44f9: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 0.00 : 5b44fe: c9 leaveq 28.57 : 5b44ff: c3 retq : { : if (BufferIsValid(slot->tts_buffer)) : ReleaseBuffer(slot->tts_buffer); : slot->tts_buffer = buffer; : if (BufferIsValid(buffer)) : IncrBufferRefCount(buffer); 0.00 : 5b4500: 44 89 e7 mov %r12d,%edi 0.00 : 5b4503: e8 58 06 0c 00 callq 674b60 0.00 : 5b4508: eb de jmp 5b44e8 0.00 : 5b450a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * seqscans, so it's worth troubling over. : */ : if (slot->tts_buffer != buffer) : { : if (BufferIsValid(slot->tts_buffer)) : ReleaseBuffer(slot->tts_buffer); 0.00 : 5b4510: e8 4b 09 0c 00 callq 674e60 : slot->tts_buffer = buffer; : if (BufferIsValid(buffer)) 0.00 : 5b4515: 45 85 e4 test %r12d,%r12d : */ : if (slot->tts_buffer != buffer) : { : if (BufferIsValid(slot->tts_buffer)) : ReleaseBuffer(slot->tts_buffer); : slot->tts_buffer = buffer; 0.00 : 5b4518: 44 89 63 20 mov %r12d,0x20(%rbx) 0.00 : 5b451c: 0f 1f 40 00 nopl 0x0(%rax) : if (BufferIsValid(buffer)) 0.00 : 5b4520: 74 c6 je 5b44e8 0.00 : 5b4522: eb dc jmp 5b4500 0.00 : 5b4524: 0f 1f 40 00 nopl 0x0(%rax) : * Free any old physical tuple belonging to the slot. : */ : if (slot->tts_shouldFree) : heap_freetuple(slot->tts_tuple); : if (slot->tts_shouldFreeMin) : heap_free_minimal_tuple(slot->tts_mintuple); 0.00 : 5b4528: 48 8b 7b 38 mov 0x38(%rbx),%rdi 0.00 : 5b452c: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 5b4530: e8 7b a7 eb ff callq 46ecb0 0.00 : 5b4535: e9 7a ff ff ff jmpq 5b44b4 0.00 : 5b453a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : : /* : * Free any old physical tuple belonging to the slot. : */ : if (slot->tts_shouldFree) : heap_freetuple(slot->tts_tuple); 0.00 : 5b4540: 48 8b 7e 08 mov 0x8(%rsi),%rdi 0.00 : 5b4544: e8 77 a7 eb ff callq 46ecc0 0.00 : 5b4549: e9 60 ff ff ff jmpq 5b44ae Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 42.86 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1298 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1293 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1295 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1305 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1305 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000077e0d0 : : * directly-computed parameter list. Note that neither arguments nor result : * are allowed to be NULL. : */ : Datum : FunctionCall1Coll(FmgrInfo *flinfo, Oid collation, Datum arg1) : { 0.00 : 77e0d0: 55 push %rbp 0.00 : 77e0d1: 48 89 f8 mov %rdi,%rax 0.00 : 77e0d4: 48 89 e5 mov %rsp,%rbp 0.00 : 77e0d7: 48 81 ec b0 03 00 00 sub $0x3b0,%rsp : FunctionCallInfoData fcinfo; : Datum result; : : InitFunctionCallInfoData(fcinfo, flinfo, 1, collation, NULL, NULL); 0.00 : 77e0de: 48 89 bd 50 fc ff ff mov %rdi,-0x3b0(%rbp) 0.00 : 77e0e5: 48 c7 85 58 fc ff ff movq $0x0,-0x3a8(%rbp) 0.00 : 77e0ec: 00 00 00 00 : : fcinfo.arg[0] = arg1; : fcinfo.argnull[0] = false; : : result = FunctionCallInvoke(&fcinfo); /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1298 42.86 : 77e0f0: 48 8d bd 50 fc ff ff lea -0x3b0(%rbp),%rdi : FunctionCall1Coll(FmgrInfo *flinfo, Oid collation, Datum arg1) : { : FunctionCallInfoData fcinfo; : Datum result; : : InitFunctionCallInfoData(fcinfo, flinfo, 1, collation, NULL, NULL); 0.00 : 77e0f7: 48 c7 85 60 fc ff ff movq $0x0,-0x3a0(%rbp) 0.00 : 77e0fe: 00 00 00 00 0.00 : 77e102: 89 b5 68 fc ff ff mov %esi,-0x398(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1293 14.29 : 77e108: c6 85 6c fc ff ff 00 movb $0x0,-0x394(%rbp) 0.00 : 77e10f: 66 c7 85 6e fc ff ff movw $0x1,-0x392(%rbp) 0.00 : 77e116: 01 00 : : fcinfo.arg[0] = arg1; /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1295 14.29 : 77e118: 48 89 95 70 fc ff ff mov %rdx,-0x390(%rbp) : fcinfo.argnull[0] = false; 0.00 : 77e11f: c6 45 90 00 movb $0x0,-0x70(%rbp) : : result = FunctionCallInvoke(&fcinfo); 0.00 : 77e123: ff 10 callq *(%rax) : : /* Check for null result, since caller is clearly not expecting one */ : if (unlikely(fcinfo.isnull)) 0.00 : 77e125: 80 bd 6c fc ff ff 00 cmpb $0x0,-0x394(%rbp) 0.00 : 77e12c: 75 02 jne 77e130 : elog(ERROR, "function %u returned NULL", fcinfo.flinfo->fn_oid); : : return result; : } /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1305 14.29 : 77e12e: c9 leaveq 14.29 : 77e12f: c3 retq : : result = FunctionCallInvoke(&fcinfo); : : /* Check for null result, since caller is clearly not expecting one */ : if (unlikely(fcinfo.isnull)) : elog(ERROR, "function %u returned NULL", fcinfo.flinfo->fn_oid); 0.00 : 77e130: ba 60 52 8d 00 mov $0x8d5260,%edx 0.00 : 77e135: be 16 05 00 00 mov $0x516,%esi 0.00 : 77e13a: bf b3 47 8d 00 mov $0x8d47b3,%edi 0.00 : 77e13f: e8 dc d2 ff ff callq 77b420 0.00 : 77e144: 48 8b 85 50 fc ff ff mov -0x3b0(%rbp),%rax 0.00 : 77e14b: be 97 4c 8d 00 mov $0x8d4c97,%esi 0.00 : 77e150: bf 14 00 00 00 mov $0x14,%edi 0.00 : 77e155: 8b 50 08 mov 0x8(%rax),%edx 0.00 : 77e158: 31 c0 xor %eax,%eax 0.00 : 77e15a: e8 d1 d0 ff ff callq 77b230 0.00 : 77e15f: e8 6c b3 ce ff callq 4694d0 Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:121 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:87 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:87 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:90 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:115 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000470370 : : */ : Size : heap_compute_data_size(TupleDesc tupleDesc, : Datum *values, : bool *isnull) : { 0.00 : 470370: 55 push %rbp 0.00 : 470371: 49 89 f0 mov %rsi,%r8 0.00 : 470374: 48 89 e5 mov %rsp,%rbp 0.00 : 470377: 41 57 push %r15 0.00 : 470379: 41 56 push %r14 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:87 16.67 : 47037b: 49 89 d6 mov %rdx,%r14 0.00 : 47037e: 41 55 push %r13 0.00 : 470380: 41 54 push %r12 : Size data_length = 0; : int i; : int numberOfAttributes = tupleDesc->natts; : Form_pg_attribute *att = tupleDesc->attrs; : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 470382: 45 31 e4 xor %r12d,%r12d : */ : Size : heap_compute_data_size(TupleDesc tupleDesc, : Datum *values, : bool *isnull) : { 0.00 : 470385: 53 push %rbx : Size data_length = 0; : int i; : int numberOfAttributes = tupleDesc->natts; : Form_pg_attribute *att = tupleDesc->attrs; : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 470386: 31 db xor %ebx,%ebx : */ : Size : heap_compute_data_size(TupleDesc tupleDesc, : Datum *values, : bool *isnull) : { 16.67 : 470388: 48 83 ec 08 sub $0x8,%rsp : Size data_length = 0; : int i; : int numberOfAttributes = tupleDesc->natts; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:90 16.67 : 47038c: 44 8b 2f mov (%rdi),%r13d : Form_pg_attribute *att = tupleDesc->attrs; 0.00 : 47038f: 4c 8b 7f 08 mov 0x8(%rdi),%r15 : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 470393: 45 85 ed test %r13d,%r13d 0.00 : 470396: 7f 43 jg 4703db 0.00 : 470398: e9 c3 00 00 00 jmpq 470460 0.00 : 47039d: 0f 1f 00 nopl (%rax) : */ : data_length += VARATT_CONVERTED_SHORT_SIZE(DatumGetPointer(val)); : } : else : { : data_length = att_align_datum(data_length, att[i]->attalign, 0.00 : 4703a0: 0f b6 42 5e movzbl 0x5e(%rdx),%eax 0.00 : 4703a4: 3c 69 cmp $0x69,%al 0.00 : 4703a6: 0f 84 cc 00 00 00 je 470478 0.00 : 4703ac: 3c 63 cmp $0x63,%al 0.00 : 4703ae: 66 90 xchg %ax,%ax 0.00 : 4703b0: 74 10 je 4703c2 0.00 : 4703b2: 3c 64 cmp $0x64,%al 0.00 : 4703b4: 0f 84 ce 00 00 00 je 470488 0.00 : 4703ba: 49 83 c4 01 add $0x1,%r12 0.00 : 4703be: 49 83 e4 fe and $0xfffffffffffffffe,%r12 : att[i]->attlen, val); : data_length = att_addlength_datum(data_length, att[i]->attlen, 0.00 : 4703c2: 66 85 c9 test %cx,%cx 0.00 : 4703c5: 7e 71 jle 470438 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:115 16.67 : 4703c7: 48 0f bf c1 movswq %cx,%rax 0.00 : 4703cb: 49 01 c4 add %rax,%r12 0.00 : 4703ce: 48 83 c3 01 add $0x1,%rbx : Size data_length = 0; : int i; : int numberOfAttributes = tupleDesc->natts; : Form_pg_attribute *att = tupleDesc->attrs; : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 4703d2: 41 39 dd cmp %ebx,%r13d 0.00 : 4703d5: 0f 8e 85 00 00 00 jle 470460 : { : Datum val; : : if (isnull[i]) 0.00 : 4703db: 41 80 3c 1e 00 cmpb $0x0,(%r14,%rbx,1) 0.00 : 4703e0: 75 ec jne 4703ce : continue; : : val = values[i]; : : if (ATT_IS_PACKABLE(att[i]) && 0.00 : 4703e2: 49 8b 14 df mov (%r15,%rbx,8),%rdx : Datum val; : : if (isnull[i]) : continue; : : val = values[i]; 0.00 : 4703e6: 49 8b 3c d8 mov (%r8,%rbx,8),%rdi : : if (ATT_IS_PACKABLE(att[i]) && 0.00 : 4703ea: 0f b7 4a 4c movzwl 0x4c(%rdx),%ecx 0.00 : 4703ee: 66 83 f9 ff cmp $0xffff,%cx 0.00 : 4703f2: 75 ac jne 4703a0 0.00 : 4703f4: 80 7a 5d 70 cmpb $0x70,0x5d(%rdx) 0.00 : 4703f8: 0f 84 c2 00 00 00 je 4704c0 0.00 : 4703fe: 0f b6 37 movzbl (%rdi),%esi 0.00 : 470401: 40 f6 c6 03 test $0x3,%sil 0.00 : 470405: 75 12 jne 470419 0.00 : 470407: 8b 07 mov (%rdi),%eax 0.00 : 470409: c1 e8 02 shr $0x2,%eax 0.00 : 47040c: 83 e8 04 sub $0x4,%eax 0.00 : 47040f: 48 83 c0 01 add $0x1,%rax 0.00 : 470413: 48 83 f8 7f cmp $0x7f,%rax 0.00 : 470417: 76 b2 jbe 4703cb : */ : data_length += VARATT_CONVERTED_SHORT_SIZE(DatumGetPointer(val)); : } : else : { : data_length = att_align_datum(data_length, att[i]->attalign, 0.00 : 470419: 83 e6 01 and $0x1,%esi 0.00 : 47041c: 74 82 je 4703a0 : att[i]->attlen, val); : data_length = att_addlength_datum(data_length, att[i]->attlen, 0.00 : 47041e: 0f b6 07 movzbl (%rdi),%eax 0.00 : 470421: 3c 01 cmp $0x1,%al 0.00 : 470423: 74 73 je 470498 0.00 : 470425: a8 01 test $0x1,%al 0.00 : 470427: 0f 84 a3 00 00 00 je 4704d0 0.00 : 47042d: d0 e8 shr %al 0.00 : 47042f: 0f b6 c0 movzbl %al,%eax 0.00 : 470432: eb 97 jmp 4703cb 0.00 : 470434: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 470438: 66 83 c1 01 add $0x1,%cx 0.00 : 47043c: 74 e0 je 47041e 0.00 : 47043e: 4c 89 45 d0 mov %r8,-0x30(%rbp) 0.00 : 470442: 48 83 c3 01 add $0x1,%rbx 0.00 : 470446: e8 05 94 ff ff callq 469850 : Size data_length = 0; : int i; : int numberOfAttributes = tupleDesc->natts; : Form_pg_attribute *att = tupleDesc->attrs; : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 47044b: 41 39 dd cmp %ebx,%r13d : } : else : { : data_length = att_align_datum(data_length, att[i]->attalign, : att[i]->attlen, val); : data_length = att_addlength_datum(data_length, att[i]->attlen, 0.00 : 47044e: 4d 8d 64 04 01 lea 0x1(%r12,%rax,1),%r12 0.00 : 470453: 4c 8b 45 d0 mov -0x30(%rbp),%r8 : Size data_length = 0; : int i; : int numberOfAttributes = tupleDesc->natts; : Form_pg_attribute *att = tupleDesc->attrs; : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 470457: 7f 82 jg 4703db 0.00 : 470459: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : val); : } : } : : return data_length; : } 0.00 : 470460: 48 83 c4 08 add $0x8,%rsp 0.00 : 470464: 4c 89 e0 mov %r12,%rax 0.00 : 470467: 5b pop %rbx 0.00 : 470468: 41 5c pop %r12 0.00 : 47046a: 41 5d pop %r13 0.00 : 47046c: 41 5e pop %r14 0.00 : 47046e: 41 5f pop %r15 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:121 33.33 : 470470: c9 leaveq 0.00 : 470471: c3 retq 0.00 : 470472: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : */ : data_length += VARATT_CONVERTED_SHORT_SIZE(DatumGetPointer(val)); : } : else : { : data_length = att_align_datum(data_length, att[i]->attalign, 0.00 : 470478: 49 83 c4 03 add $0x3,%r12 0.00 : 47047c: 49 83 e4 fc and $0xfffffffffffffffc,%r12 0.00 : 470480: e9 3d ff ff ff jmpq 4703c2 0.00 : 470485: 0f 1f 00 nopl (%rax) 0.00 : 470488: 49 83 c4 07 add $0x7,%r12 0.00 : 47048c: 49 83 e4 f8 and $0xfffffffffffffff8,%r12 0.00 : 470490: e9 2d ff ff ff jmpq 4703c2 0.00 : 470495: 0f 1f 00 nopl (%rax) : att[i]->attlen, val); : data_length = att_addlength_datum(data_length, att[i]->attlen, 0.00 : 470498: 0f b6 57 01 movzbl 0x1(%rdi),%edx 0.00 : 47049c: b8 0a 00 00 00 mov $0xa,%eax 0.00 : 4704a1: 80 fa 01 cmp $0x1,%dl 0.00 : 4704a4: 0f 84 21 ff ff ff je 4703cb 0.00 : 4704aa: 80 fa 12 cmp $0x12,%dl 0.00 : 4704ad: b8 03 00 00 00 mov $0x3,%eax 0.00 : 4704b2: ba 12 00 00 00 mov $0x12,%edx 0.00 : 4704b7: 48 0f 44 c2 cmove %rdx,%rax 0.00 : 4704bb: e9 0b ff ff ff jmpq 4703cb : if (isnull[i]) : continue; : : val = values[i]; : : if (ATT_IS_PACKABLE(att[i]) && 0.00 : 4704c0: 0f b6 37 movzbl (%rdi),%esi 0.00 : 4704c3: e9 51 ff ff ff jmpq 470419 0.00 : 4704c8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 4704cf: 00 : } : else : { : data_length = att_align_datum(data_length, att[i]->attalign, : att[i]->attlen, val); : data_length = att_addlength_datum(data_length, att[i]->attlen, 0.00 : 4704d0: 8b 07 mov (%rdi),%eax 0.00 : 4704d2: c1 e8 02 shr $0x2,%eax 0.00 : 4704d5: 89 c0 mov %eax,%eax 0.00 : 4704d7: e9 ef fe ff ff jmpq 4703cb Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1494 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1483 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1488 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1508 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1509 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000496e90 : : #endif /* !defined(HEAPDEBUGALL) */ : : : HeapTuple : heap_getnext(HeapScanDesc scan, ScanDirection direction) : { 0.00 : 496e90: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1483 16.67 : 496e91: 48 89 e5 mov %rsp,%rbp 0.00 : 496e94: 53 push %rbx 0.00 : 496e95: 48 89 fb mov %rdi,%rbx 0.00 : 496e98: 48 83 ec 08 sub $0x8,%rsp : /* Note: no locking manipulations needed */ : : HEAPDEBUG_1; /* heap_getnext( info ) */ : : if (scan->rs_pageatatime) 0.00 : 496e9c: 80 7f 21 00 cmpb $0x0,0x21(%rdi) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1488 16.67 : 496ea0: 74 3e je 496ee0 : heapgettup_pagemode(scan, direction, 0.00 : 496ea2: 48 8b 4f 18 mov 0x18(%rdi),%rcx 0.00 : 496ea6: 8b 57 10 mov 0x10(%rdi),%edx 0.00 : 496ea9: e8 42 f2 ff ff callq 4960f0 : scan->rs_nkeys, scan->rs_key); : else : heapgettup(scan, direction, scan->rs_nkeys, scan->rs_key); : : if (scan->rs_ctup.t_data == NULL) 0.00 : 496eae: 31 c0 xor %eax,%eax /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1494 33.33 : 496eb0: 48 83 7b 58 00 cmpq $0x0,0x58(%rbx) 0.00 : 496eb5: 74 18 je 496ecf : * if we get here it means we have a new current scan tuple, so point to : * the proper return buffer and return the tuple. : */ : HEAPDEBUG_3; /* heap_getnext returning tuple */ : : pgstat_count_heap_getnext(scan->rs_rd); 0.00 : 496eb7: 48 8b 03 mov (%rbx),%rax 0.00 : 496eba: 48 8b 80 38 01 00 00 mov 0x138(%rax),%rax 0.00 : 496ec1: 48 85 c0 test %rax,%rax 0.00 : 496ec4: 74 05 je 496ecb 0.00 : 496ec6: 48 83 40 18 01 addq $0x1,0x18(%rax) : : return &(scan->rs_ctup); /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1508 16.67 : 496ecb: 48 8d 43 48 lea 0x48(%rbx),%rax : } 0.00 : 496ecf: 48 83 c4 08 add $0x8,%rsp 0.00 : 496ed3: 5b pop %rbx 0.00 : 496ed4: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1509 16.67 : 496ed5: c3 retq 0.00 : 496ed6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 496edd: 00 00 00 : : if (scan->rs_pageatatime) : heapgettup_pagemode(scan, direction, : scan->rs_nkeys, scan->rs_key); : else : heapgettup(scan, direction, scan->rs_nkeys, scan->rs_key); 0.00 : 496ee0: 48 8b 4f 18 mov 0x18(%rdi),%rcx 0.00 : 496ee4: 8b 57 10 mov 0x10(%rdi),%edx 0.00 : 496ee7: e8 c4 f7 ff ff callq 4966b0 0.00 : 496eec: eb c0 jmp 496eae Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/pruneheap.c:109 50.00 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/pruneheap.c:109 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000049f650 : : * OldestXmin is the cutoff XID used to distinguish whether tuples are DEAD : * or RECENTLY_DEAD (see HeapTupleSatisfiesVacuum). : */ : void : heap_page_prune_opt(Relation relation, Buffer buffer) : { 0.00 : 49f650: 55 push %rbp 0.00 : 49f651: 48 89 e5 mov %rsp,%rbp 0.00 : 49f654: 4c 89 65 e0 mov %r12,-0x20(%rbp) 0.00 : 49f658: 4c 89 75 f0 mov %r14,-0x10(%rbp) 0.00 : 49f65c: 41 89 f4 mov %esi,%r12d 0.00 : 49f65f: 48 89 5d d8 mov %rbx,-0x28(%rbp) 0.00 : 49f663: 4c 89 6d e8 mov %r13,-0x18(%rbp) 0.00 : 49f667: 49 89 fe mov %rdi,%r14 0.00 : 49f66a: 4c 89 7d f8 mov %r15,-0x8(%rbp) 0.00 : 49f66e: 48 83 ec 40 sub $0x40,%rsp : Page page = BufferGetPage(buffer); 0.00 : 49f672: 85 f6 test %esi,%esi 0.00 : 49f674: 0f 88 fe 00 00 00 js 49f778 0.00 : 49f67a: 41 8d 44 24 ff lea -0x1(%r12),%eax 0.00 : 49f67f: 48 63 d8 movslq %eax,%rbx 0.00 : 49f682: 48 c1 e3 0d shl $0xd,%rbx 0.00 : 49f686: 48 03 1d 6b 04 72 00 add 0x72046b(%rip),%rbx # bbfaf8 : /* : * We can't write WAL in recovery mode, so there's no point trying to : * clean the page. The master will likely issue a cleaning WAL record soon : * anyway, so this is no particular loss. : */ : if (RecoveryInProgress()) 0.00 : 49f68d: e8 2e de 02 00 callq 4cd4c0 0.00 : 49f692: 84 c0 test %al,%al 0.00 : 49f694: 74 1a je 49f6b0 : } : : /* And release buffer lock */ : LockBuffer(buffer, BUFFER_LOCK_UNLOCK); : } : } 0.00 : 49f696: 48 8b 5d d8 mov -0x28(%rbp),%rbx 0.00 : 49f69a: 4c 8b 65 e0 mov -0x20(%rbp),%r12 0.00 : 49f69e: 4c 8b 6d e8 mov -0x18(%rbp),%r13 0.00 : 49f6a2: 4c 8b 75 f0 mov -0x10(%rbp),%r14 0.00 : 49f6a6: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 49f6aa: c9 leaveq 0.00 : 49f6ab: c3 retq 0.00 : 49f6ac: 0f 1f 40 00 nopl 0x0(%rax) : * catalog relation or a user defined, additional, catalog relation, we : * need to use the horizon that includes slots, otherwise the data-only : * horizon can be used. Note that the toast relation of user defined : * relations are *not* considered catalog relations. : */ : if (IsCatalogRelation(relation) || 0.00 : 49f6b0: 4c 89 f7 mov %r14,%rdi 0.00 : 49f6b3: e8 28 37 04 00 callq 4e2de0 0.00 : 49f6b8: 84 c0 test %al,%al 0.00 : 49f6ba: 0f 84 d0 00 00 00 je 49f790 : RelationIsAccessibleInLogicalDecoding(relation)) : OldestXmin = RecentGlobalXmin; 0.00 : 49f6c0: 44 8b 3d 39 b2 71 00 mov 0x71b239(%rip),%r15d # bba900 : * Let's see if we really need pruning. : * : * Forget it if page is not hinted to contain something prunable that's : * older than OldestXmin. : */ : if (!PageIsPrunable(page, OldestXmin)) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/pruneheap.c:109 50.00 : 49f6c7: 8b 7b 14 mov 0x14(%rbx),%edi 50.00 : 49f6ca: 85 ff test %edi,%edi 0.00 : 49f6cc: 74 c8 je 49f696 0.00 : 49f6ce: 44 89 fe mov %r15d,%esi 0.00 : 49f6d1: e8 0a 09 02 00 callq 4bffe0 0.00 : 49f6d6: 84 c0 test %al,%al 0.00 : 49f6d8: 74 bc je 49f696 : * unlikely to be *seriously* wrong, though, since reading either pd_lower : * or pd_upper is probably atomic. Avoiding taking a lock seems more : * important than sometimes getting a wrong answer in what is after all : * just a heuristic estimate. : */ : minfree = RelationGetTargetPageFreeSpace(relation, 0.00 : 49f6da: 49 8b 96 98 00 00 00 mov 0x98(%r14),%rdx 0.00 : 49f6e1: 41 bd 33 03 00 00 mov $0x333,%r13d 0.00 : 49f6e7: 48 85 d2 test %rdx,%rdx 0.00 : 49f6ea: 74 2f je 49f71b 0.00 : 49f6ec: b9 64 00 00 00 mov $0x64,%ecx 0.00 : 49f6f1: 2b 4a 04 sub 0x4(%rdx),%ecx 0.00 : 49f6f4: ba 1f 85 eb 51 mov $0x51eb851f,%edx 0.00 : 49f6f9: c1 e1 0d shl $0xd,%ecx 0.00 : 49f6fc: 89 c8 mov %ecx,%eax 0.00 : 49f6fe: c1 f9 1f sar $0x1f,%ecx 0.00 : 49f701: f7 ea imul %edx 0.00 : 49f703: b8 33 03 00 00 mov $0x333,%eax 0.00 : 49f708: c1 fa 05 sar $0x5,%edx 0.00 : 49f70b: 29 ca sub %ecx,%edx 0.00 : 49f70d: 4c 63 ea movslq %edx,%r13 0.00 : 49f710: 49 81 fd 33 03 00 00 cmp $0x333,%r13 0.00 : 49f717: 4c 0f 42 e8 cmovb %rax,%r13 : HEAP_DEFAULT_FILLFACTOR); : minfree = Max(minfree, BLCKSZ / 10); : : if (PageIsFull(page) || PageGetHeapFreeSpace(page) < minfree) 0.00 : 49f71b: f6 43 0a 02 testb $0x2,0xa(%rbx) 0.00 : 49f71f: 75 11 jne 49f732 0.00 : 49f721: 48 89 df mov %rbx,%rdi 0.00 : 49f724: e8 37 56 1f 00 callq 694d60 0.00 : 49f729: 4c 39 e8 cmp %r13,%rax 0.00 : 49f72c: 0f 83 64 ff ff ff jae 49f696 : { : /* OK, try to get exclusive buffer lock */ : if (!ConditionalLockBufferForCleanup(buffer)) 0.00 : 49f732: 44 89 e7 mov %r12d,%edi 0.00 : 49f735: e8 26 78 1d 00 callq 676f60 0.00 : 49f73a: 84 c0 test %al,%al 0.00 : 49f73c: 0f 84 54 ff ff ff je 49f696 : * Now that we have buffer lock, get accurate information about the : * page's free space, and recheck the heuristic about whether to : * prune. (We needn't recheck PageIsPrunable, since no one else could : * have pruned while we hold pin.) : */ : if (PageIsFull(page) || PageGetHeapFreeSpace(page) < minfree) 0.00 : 49f742: f6 43 0a 02 testb $0x2,0xa(%rbx) 0.00 : 49f746: 74 68 je 49f7b0 : { : TransactionId ignore = InvalidTransactionId; /* return value not : * needed */ : : /* OK to prune */ : (void) heap_page_prune(relation, buffer, OldestXmin, true, &ignore); 0.00 : 49f748: 4c 8d 45 d4 lea -0x2c(%rbp),%r8 0.00 : 49f74c: b9 01 00 00 00 mov $0x1,%ecx 0.00 : 49f751: 44 89 fa mov %r15d,%edx 0.00 : 49f754: 44 89 e6 mov %r12d,%esi 0.00 : 49f757: 4c 89 f7 mov %r14,%rdi : * prune. (We needn't recheck PageIsPrunable, since no one else could : * have pruned while we hold pin.) : */ : if (PageIsFull(page) || PageGetHeapFreeSpace(page) < minfree) : { : TransactionId ignore = InvalidTransactionId; /* return value not 0.00 : 49f75a: c7 45 d4 00 00 00 00 movl $0x0,-0x2c(%rbp) : * needed */ : : /* OK to prune */ : (void) heap_page_prune(relation, buffer, OldestXmin, true, &ignore); 0.00 : 49f761: e8 5a f4 ff ff callq 49ebc0 : } : : /* And release buffer lock */ : LockBuffer(buffer, BUFFER_LOCK_UNLOCK); 0.00 : 49f766: 31 f6 xor %esi,%esi 0.00 : 49f768: 44 89 e7 mov %r12d,%edi 0.00 : 49f76b: e8 a0 4f 1d 00 callq 674710 0.00 : 49f770: e9 21 ff ff ff jmpq 49f696 0.00 : 49f775: 0f 1f 00 nopl (%rax) : * or RECENTLY_DEAD (see HeapTupleSatisfiesVacuum). : */ : void : heap_page_prune_opt(Relation relation, Buffer buffer) : { : Page page = BufferGetPage(buffer); 0.00 : 49f778: 89 f0 mov %esi,%eax 0.00 : 49f77a: 48 8b 15 97 d9 6d 00 mov 0x6dd997(%rip),%rdx # b7d118 0.00 : 49f781: f7 d0 not %eax 0.00 : 49f783: 48 98 cltq 0.00 : 49f785: 48 8b 1c c2 mov (%rdx,%rax,8),%rbx 0.00 : 49f789: e9 ff fe ff ff jmpq 49f68d 0.00 : 49f78e: 66 90 xchg %ax,%ax : * catalog relation or a user defined, additional, catalog relation, we : * need to use the horizon that includes slots, otherwise the data-only : * horizon can be used. Note that the toast relation of user defined : * relations are *not* considered catalog relations. : */ : if (IsCatalogRelation(relation) || 0.00 : 49f790: 83 3d c5 99 6d 00 02 cmpl $0x2,0x6d99c5(%rip) # b7915c 0.00 : 49f797: 7e 0a jle 49f7a3 0.00 : 49f799: 49 8b 46 30 mov 0x30(%r14),%rax 0.00 : 49f79d: 80 78 6e 70 cmpb $0x70,0x6e(%rax) 0.00 : 49f7a1: 74 25 je 49f7c8 : RelationIsAccessibleInLogicalDecoding(relation)) : OldestXmin = RecentGlobalXmin; : else : OldestXmin = RecentGlobalDataXmin; 0.00 : 49f7a3: 44 8b 3d 5a b1 71 00 mov 0x71b15a(%rip),%r15d # bba904 0.00 : 49f7aa: e9 18 ff ff ff jmpq 49f6c7 0.00 : 49f7af: 90 nop : * Now that we have buffer lock, get accurate information about the : * page's free space, and recheck the heuristic about whether to : * prune. (We needn't recheck PageIsPrunable, since no one else could : * have pruned while we hold pin.) : */ : if (PageIsFull(page) || PageGetHeapFreeSpace(page) < minfree) 0.00 : 49f7b0: 48 89 df mov %rbx,%rdi 0.00 : 49f7b3: e8 a8 55 1f 00 callq 694d60 0.00 : 49f7b8: 4c 39 e8 cmp %r13,%rax 0.00 : 49f7bb: 73 a9 jae 49f766 0.00 : 49f7bd: 0f 1f 00 nopl (%rax) 0.00 : 49f7c0: eb 86 jmp 49f748 0.00 : 49f7c2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * catalog relation or a user defined, additional, catalog relation, we : * need to use the horizon that includes slots, otherwise the data-only : * horizon can be used. Note that the toast relation of user defined : * relations are *not* considered catalog relations. : */ : if (IsCatalogRelation(relation) || 0.00 : 49f7c8: 4c 89 f7 mov %r14,%rdi 0.00 : 49f7cb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 49f7d0: e8 0b 36 04 00 callq 4e2de0 0.00 : 49f7d5: 84 c0 test %al,%al 0.00 : 49f7d7: 0f 85 e3 fe ff ff jne 49f6c0 0.00 : 49f7dd: 49 8b 86 98 00 00 00 mov 0x98(%r14),%rax 0.00 : 49f7e4: 48 85 c0 test %rax,%rax 0.00 : 49f7e7: 74 ba je 49f7a3 0.00 : 49f7e9: 80 78 48 00 cmpb $0x0,0x48(%rax) 0.00 : 49f7ed: 74 b4 je 49f7a3 0.00 : 49f7ef: 90 nop 0.00 : 49f7f0: e9 cb fe ff ff jmpq 49f6c0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:450 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:450 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:459 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:472 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:484 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:462 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b4110 : : * NB: only the tuple is cleared, not the tuple descriptor (if any). : * -------------------------------- : */ : TupleTableSlot * /* return: slot passed */ : ExecClearTuple(TupleTableSlot *slot) /* slot in which to store tuple */ : { 0.00 : 5b4110: 55 push %rbp 16.67 : 5b4111: 48 89 e5 mov %rsp,%rbp 0.00 : 5b4114: 53 push %rbx 16.67 : 5b4115: 48 89 fb mov %rdi,%rbx 0.00 : 5b4118: 48 83 ec 08 sub $0x8,%rsp : Assert(slot != NULL); : : /* : * Free the old physical tuple if necessary. : */ : if (slot->tts_shouldFree) 0.00 : 5b411c: 80 7f 05 00 cmpb $0x0,0x5(%rdi) /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:459 16.67 : 5b4120: 75 5e jne 5b4180 : heap_freetuple(slot->tts_tuple); : if (slot->tts_shouldFreeMin) 0.00 : 5b4122: 80 7b 06 00 cmpb $0x0,0x6(%rbx) 0.00 : 5b4126: 75 48 jne 5b4170 : slot->tts_shouldFreeMin = false; : : /* : * Drop the pin on the referenced buffer, if there is one. : */ : if (BufferIsValid(slot->tts_buffer)) /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:472 16.67 : 5b4128: 8b 7b 20 mov 0x20(%rbx),%edi : if (slot->tts_shouldFree) : heap_freetuple(slot->tts_tuple); : if (slot->tts_shouldFreeMin) : heap_free_minimal_tuple(slot->tts_mintuple); : : slot->tts_tuple = NULL; 0.00 : 5b412b: 48 c7 43 08 00 00 00 movq $0x0,0x8(%rbx) 0.00 : 5b4132: 00 : slot->tts_mintuple = NULL; 0.00 : 5b4133: 48 c7 43 38 00 00 00 movq $0x0,0x38(%rbx) 0.00 : 5b413a: 00 : slot->tts_shouldFree = false; 0.00 : 5b413b: c6 43 05 00 movb $0x0,0x5(%rbx) : slot->tts_shouldFreeMin = false; 0.00 : 5b413f: c6 43 06 00 movb $0x0,0x6(%rbx) : : /* : * Drop the pin on the referenced buffer, if there is one. : */ : if (BufferIsValid(slot->tts_buffer)) 0.00 : 5b4143: 85 ff test %edi,%edi 0.00 : 5b4145: 74 05 je 5b414c : ReleaseBuffer(slot->tts_buffer); 0.00 : 5b4147: e8 14 0d 0c 00 callq 674e60 : : slot->tts_buffer = InvalidBuffer; 0.00 : 5b414c: c7 43 20 00 00 00 00 movl $0x0,0x20(%rbx) : : /* : * Mark it empty. : */ : slot->tts_isempty = true; 0.00 : 5b4153: c6 43 04 01 movb $0x1,0x4(%rbx) : slot->tts_nvalid = 0; : : return slot; : } 0.00 : 5b4157: 48 89 d8 mov %rbx,%rax : : /* : * Mark it empty. : */ : slot->tts_isempty = true; : slot->tts_nvalid = 0; 0.00 : 5b415a: c7 43 24 00 00 00 00 movl $0x0,0x24(%rbx) : : return slot; : } 0.00 : 5b4161: 48 83 c4 08 add $0x8,%rsp 0.00 : 5b4165: 5b pop %rbx 0.00 : 5b4166: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:484 16.67 : 5b4167: c3 retq 0.00 : 5b4168: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5b416f: 00 : * Free the old physical tuple if necessary. : */ : if (slot->tts_shouldFree) : heap_freetuple(slot->tts_tuple); : if (slot->tts_shouldFreeMin) : heap_free_minimal_tuple(slot->tts_mintuple); 0.00 : 5b4170: 48 8b 7b 38 mov 0x38(%rbx),%rdi 0.00 : 5b4174: e8 37 ab eb ff callq 46ecb0 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:462 16.67 : 5b4179: eb ad jmp 5b4128 0.00 : 5b417b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : : /* : * Free the old physical tuple if necessary. : */ : if (slot->tts_shouldFree) : heap_freetuple(slot->tts_tuple); 0.00 : 5b4180: 48 8b 7f 08 mov 0x8(%rdi),%rdi 0.00 : 5b4184: e8 37 ab eb ff callq 46ecc0 0.00 : 5b4189: eb 97 jmp 5b4122 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:48 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:76 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:77 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:86 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005c5930 : : * This is a workhorse for ExecSeqScan : * ---------------------------------------------------------------- : */ : static TupleTableSlot * : SeqNext(SeqScanState *node) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:48 50.00 : 5c5930: 55 push %rbp 0.00 : 5c5931: 48 89 e5 mov %rsp,%rbp 0.00 : 5c5934: 48 89 5d f0 mov %rbx,-0x10(%rbp) 0.00 : 5c5938: 4c 89 65 f8 mov %r12,-0x8(%rbp) 0.00 : 5c593c: 48 83 ec 10 sub $0x10,%rsp : slot = node->ss_ScanTupleSlot; : : /* : * get the next tuple from the table : */ : tuple = heap_getnext(scandesc, direction); 0.00 : 5c5940: 48 8b 47 10 mov 0x10(%rdi),%rax : TupleTableSlot *slot; : : /* : * get information from the estate and scan state : */ : scandesc = node->ss_currentScanDesc; 0.00 : 5c5944: 4c 8b a7 80 00 00 00 mov 0x80(%rdi),%r12 : estate = node->ps.state; : direction = estate->es_direction; : slot = node->ss_ScanTupleSlot; 0.00 : 5c594b: 48 8b 9f 88 00 00 00 mov 0x88(%rdi),%rbx : : /* : * get the next tuple from the table : */ : tuple = heap_getnext(scandesc, direction); 0.00 : 5c5952: 8b 70 04 mov 0x4(%rax),%esi 0.00 : 5c5955: 4c 89 e7 mov %r12,%rdi 0.00 : 5c5958: e8 33 15 ed ff callq 496e90 : * tuples returned by heap_getnext() are pointers onto disk pages and were : * not created with palloc() and so should not be pfree()'d. Note also : * that ExecStoreTuple will increment the refcount of the buffer; the : * refcount will not be dropped until the tuple table slot is cleared. : */ : if (tuple) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:76 16.67 : 5c595d: 48 85 c0 test %rax,%rax 0.00 : 5c5960: 74 26 je 5c5988 : ExecStoreTuple(tuple, /* tuple to store */ 0.00 : 5c5962: 41 8b 54 24 64 mov 0x64(%r12),%edx 0.00 : 5c5967: 31 c9 xor %ecx,%ecx 0.00 : 5c5969: 48 89 de mov %rbx,%rsi /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:77 16.67 : 5c596c: 48 89 c7 mov %rax,%rdi 0.00 : 5c596f: e8 0c eb fe ff callq 5b4480 : false); /* don't pfree this pointer */ : else : ExecClearTuple(slot); : : return slot; : } 0.00 : 5c5974: 48 89 d8 mov %rbx,%rax 0.00 : 5c5977: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:86 16.67 : 5c597c: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 5c5980: c9 leaveq 0.00 : 5c5981: c3 retq 0.00 : 5c5982: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : slot, /* slot to store in */ : scandesc->rs_cbuf, /* buffer associated with this : * tuple */ : false); /* don't pfree this pointer */ : else : ExecClearTuple(slot); 0.00 : 5c5988: 48 89 df mov %rbx,%rdi 0.00 : 5c598b: e8 80 e7 fe ff callq 5b4110 0.00 : 5c5990: eb e2 jmp 5c5974 Sorted summary for file /lib64/libc-2.11.3.so ---------------------------------------------- 33.33 ??:0 16.67 ??:0 16.67 ??:0 16.67 ??:0 16.67 ??:0 Percent | Source code & Disassembly of /lib64/libc-2.11.3.so ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000084750 : ??:0 16.67 : 84750: 48 83 fa 20 cmp $0x20,%rdx 0.00 : 84754: 48 89 f8 mov %rdi,%rax 0.00 : 84757: 73 77 jae 847d0 16.67 : 84759: f6 c2 01 test $0x1,%dl 0.00 : 8475c: 74 0b je 84769 0.00 : 8475e: 0f b6 0e movzbl (%rsi),%ecx 0.00 : 84761: 88 0f mov %cl,(%rdi) 0.00 : 84763: 48 ff c6 inc %rsi 0.00 : 84766: 48 ff c7 inc %rdi 0.00 : 84769: f6 c2 02 test $0x2,%dl 0.00 : 8476c: 74 12 je 84780 0.00 : 8476e: 0f b7 0e movzwl (%rsi),%ecx 0.00 : 84771: 66 89 0f mov %cx,(%rdi) 0.00 : 84774: 48 83 c6 02 add $0x2,%rsi 0.00 : 84778: 48 83 c7 02 add $0x2,%rdi 0.00 : 8477c: 0f 1f 40 00 nopl 0x0(%rax) 16.67 : 84780: f6 c2 04 test $0x4,%dl 0.00 : 84783: 74 0c je 84791 0.00 : 84785: 8b 0e mov (%rsi),%ecx 0.00 : 84787: 89 0f mov %ecx,(%rdi) 0.00 : 84789: 48 83 c6 04 add $0x4,%rsi 0.00 : 8478d: 48 83 c7 04 add $0x4,%rdi 0.00 : 84791: f6 c2 08 test $0x8,%dl 0.00 : 84794: 74 0e je 847a4 0.00 : 84796: 48 8b 0e mov (%rsi),%rcx 0.00 : 84799: 48 89 0f mov %rcx,(%rdi) 0.00 : 8479c: 48 83 c6 08 add $0x8,%rsi 0.00 : 847a0: 48 83 c7 08 add $0x8,%rdi 0.00 : 847a4: 81 e2 f0 00 00 00 and $0xf0,%edx 0.00 : 847aa: 74 1f je 847cb 0.00 : 847ac: 0f 1f 40 00 nopl 0x0(%rax) 33.33 : 847b0: 48 8b 0e mov (%rsi),%rcx 0.00 : 847b3: 4c 8b 46 08 mov 0x8(%rsi),%r8 0.00 : 847b7: 48 89 0f mov %rcx,(%rdi) 0.00 : 847ba: 4c 89 47 08 mov %r8,0x8(%rdi) 0.00 : 847be: 83 ea 10 sub $0x10,%edx 0.00 : 847c1: 48 8d 76 10 lea 0x10(%rsi),%rsi 0.00 : 847c5: 48 8d 7f 10 lea 0x10(%rdi),%rdi 0.00 : 847c9: 75 e5 jne 847b0 16.67 : 847cb: f3 c3 repz retq 0.00 : 847cd: 0f 1f 00 nopl (%rax) 0.00 : 847d0: 48 89 44 24 f8 mov %rax,-0x8(%rsp) 0.00 : 847d5: 89 f1 mov %esi,%ecx 0.00 : 847d7: 83 e1 07 and $0x7,%ecx 0.00 : 847da: 74 34 je 84810 0.00 : 847dc: 48 8d 54 11 f8 lea -0x8(%rcx,%rdx,1),%rdx 0.00 : 847e1: 83 e9 08 sub $0x8,%ecx 0.00 : 847e4: 66 66 66 2e 0f 1f 84 data32 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 847eb: 00 00 00 00 00 0.00 : 847f0: 0f b6 06 movzbl (%rsi),%eax 0.00 : 847f3: 88 07 mov %al,(%rdi) 0.00 : 847f5: ff c1 inc %ecx 0.00 : 847f7: 48 8d 76 01 lea 0x1(%rsi),%rsi 0.00 : 847fb: 48 8d 7f 01 lea 0x1(%rdi),%rdi 0.00 : 847ff: 75 ef jne 847f0 0.00 : 84801: 66 66 66 66 66 66 2e data32 data32 data32 data32 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 84808: 0f 1f 84 00 00 00 00 0.00 : 8480f: 00 0.00 : 84810: 48 81 fa 00 04 00 00 cmp $0x400,%rdx 0.00 : 84817: 77 77 ja 84890 0.00 : 84819: 89 d1 mov %edx,%ecx 0.00 : 8481b: c1 e9 05 shr $0x5,%ecx 0.00 : 8481e: 74 60 je 84880 0.00 : 84820: ff c9 dec %ecx 0.00 : 84822: 48 8b 06 mov (%rsi),%rax 0.00 : 84825: 4c 8b 46 08 mov 0x8(%rsi),%r8 0.00 : 84829: 4c 8b 4e 10 mov 0x10(%rsi),%r9 0.00 : 8482d: 4c 8b 56 18 mov 0x18(%rsi),%r10 0.00 : 84831: 48 89 07 mov %rax,(%rdi) 0.00 : 84834: 4c 89 47 08 mov %r8,0x8(%rdi) 0.00 : 84838: 4c 89 4f 10 mov %r9,0x10(%rdi) 0.00 : 8483c: 4c 89 57 18 mov %r10,0x18(%rdi) 0.00 : 84840: 48 8d 76 20 lea 0x20(%rsi),%rsi 0.00 : 84844: 48 8d 7f 20 lea 0x20(%rdi),%rdi 0.00 : 84848: 74 36 je 84880 0.00 : 8484a: ff c9 dec %ecx 0.00 : 8484c: 48 8b 06 mov (%rsi),%rax 0.00 : 8484f: 4c 8b 46 08 mov 0x8(%rsi),%r8 0.00 : 84853: 4c 8b 4e 10 mov 0x10(%rsi),%r9 0.00 : 84857: 4c 8b 56 18 mov 0x18(%rsi),%r10 0.00 : 8485b: 48 89 07 mov %rax,(%rdi) 0.00 : 8485e: 4c 89 47 08 mov %r8,0x8(%rdi) 0.00 : 84862: 4c 89 4f 10 mov %r9,0x10(%rdi) 0.00 : 84866: 4c 89 57 18 mov %r10,0x18(%rdi) 0.00 : 8486a: 48 8d 76 20 lea 0x20(%rsi),%rsi 0.00 : 8486e: 48 8d 7f 20 lea 0x20(%rdi),%rdi 0.00 : 84872: 75 ac jne 84820 0.00 : 84874: 66 66 66 2e 0f 1f 84 data32 data32 nopw %cs:0x0(%rax,%rax,1) 0.00 : 8487b: 00 00 00 00 00 0.00 : 84880: 83 e2 1f and $0x1f,%edx 0.00 : 84883: 48 8b 44 24 f8 mov -0x8(%rsp),%rax 0.00 : 84888: 0f 85 cb fe ff ff jne 84759 0.00 : 8488e: f3 c3 repz retq 0.00 : 84890: 4c 8b 1d 79 d8 2e 00 mov 0x2ed879(%rip),%r11 # 372110 <__x86_64_data_cache_size_half> 0.00 : 84897: 49 39 d3 cmp %rdx,%r11 0.00 : 8489a: 4c 0f 47 da cmova %rdx,%r11 0.00 : 8489e: 4c 89 d9 mov %r11,%rcx 0.00 : 848a1: 49 83 e3 f8 and $0xfffffffffffffff8,%r11 0.00 : 848a5: 48 c1 e9 03 shr $0x3,%rcx 0.00 : 848a9: 74 05 je 848b0 0.00 : 848ab: f3 48 a5 rep movsq %ds:(%rsi),%es:(%rdi) 0.00 : 848ae: 66 90 xchg %ax,%ax 0.00 : 848b0: 4c 29 da sub %r11,%rdx 0.00 : 848b3: 48 f7 c2 f8 ff ff ff test $0xfffffffffffffff8,%rdx 0.00 : 848ba: 75 14 jne 848d0 0.00 : 848bc: 83 e2 07 and $0x7,%edx 0.00 : 848bf: 48 8b 44 24 f8 mov -0x8(%rsp),%rax 0.00 : 848c4: 0f 85 8f fe ff ff jne 84759 0.00 : 848ca: f3 c3 repz retq 0.00 : 848cc: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 848d0: 4c 8b 05 59 d8 2e 00 mov 0x2ed859(%rip),%r8 # 372130 <__x86_64_shared_cache_size_half> 0.00 : 848d7: 49 39 d0 cmp %rdx,%r8 0.00 : 848da: 4c 0f 47 c2 cmova %rdx,%r8 0.00 : 848de: 4c 89 c1 mov %r8,%rcx 0.00 : 848e1: 49 83 e0 c0 and $0xffffffffffffffc0,%r8 0.00 : 848e5: 48 c1 e9 06 shr $0x6,%rcx 0.00 : 848e9: 0f 84 ab 01 00 00 je 84a9a 0.00 : 848ef: 4c 89 74 24 f0 mov %r14,-0x10(%rsp) 0.00 : 848f4: 4c 89 6c 24 e8 mov %r13,-0x18(%rsp) 0.00 : 848f9: 4c 89 64 24 e0 mov %r12,-0x20(%rsp) 0.00 : 848fe: 48 89 5c 24 d8 mov %rbx,-0x28(%rsp) 0.00 : 84903: 83 3d 06 2b 2f 00 00 cmpl $0x0,0x2f2b06(%rip) # 377410 <__x86_64_prefetchw> 0.00 : 8490a: 0f 84 c0 00 00 00 je 849d0 0.00 : 84910: 48 ff c9 dec %rcx 0.00 : 84913: 48 8b 06 mov (%rsi),%rax 0.00 : 84916: 48 8b 5e 08 mov 0x8(%rsi),%rbx 0.00 : 8491a: 4c 8b 4e 10 mov 0x10(%rsi),%r9 0.00 : 8491e: 4c 8b 56 18 mov 0x18(%rsi),%r10 0.00 : 84922: 4c 8b 5e 20 mov 0x20(%rsi),%r11 0.00 : 84926: 4c 8b 66 28 mov 0x28(%rsi),%r12 0.00 : 8492a: 4c 8b 6e 30 mov 0x30(%rsi),%r13 0.00 : 8492e: 4c 8b 76 38 mov 0x38(%rsi),%r14 0.00 : 84932: 0f 18 8e 80 03 00 00 prefetcht0 0x380(%rsi) 0.00 : 84939: 0f 18 8e c0 03 00 00 prefetcht0 0x3c0(%rsi) 0.00 : 84940: 48 89 07 mov %rax,(%rdi) 0.00 : 84943: 48 89 5f 08 mov %rbx,0x8(%rdi) 0.00 : 84947: 4c 89 4f 10 mov %r9,0x10(%rdi) 0.00 : 8494b: 4c 89 57 18 mov %r10,0x18(%rdi) 0.00 : 8494f: 4c 89 5f 20 mov %r11,0x20(%rdi) 0.00 : 84953: 4c 89 67 28 mov %r12,0x28(%rdi) 0.00 : 84957: 4c 89 6f 30 mov %r13,0x30(%rdi) 0.00 : 8495b: 4c 89 77 38 mov %r14,0x38(%rdi) 0.00 : 8495f: 48 8d 76 40 lea 0x40(%rsi),%rsi 0.00 : 84963: 48 8d 7f 40 lea 0x40(%rdi),%rdi 0.00 : 84967: 0f 84 19 01 00 00 je 84a86 0.00 : 8496d: 48 ff c9 dec %rcx 0.00 : 84970: 48 8b 06 mov (%rsi),%rax 0.00 : 84973: 48 8b 5e 08 mov 0x8(%rsi),%rbx 0.00 : 84977: 4c 8b 4e 10 mov 0x10(%rsi),%r9 0.00 : 8497b: 4c 8b 56 18 mov 0x18(%rsi),%r10 0.00 : 8497f: 4c 8b 5e 20 mov 0x20(%rsi),%r11 0.00 : 84983: 4c 8b 66 28 mov 0x28(%rsi),%r12 0.00 : 84987: 4c 8b 6e 30 mov 0x30(%rsi),%r13 0.00 : 8498b: 4c 8b 76 38 mov 0x38(%rsi),%r14 0.00 : 8498f: 48 89 07 mov %rax,(%rdi) 0.00 : 84992: 48 89 5f 08 mov %rbx,0x8(%rdi) 0.00 : 84996: 4c 89 4f 10 mov %r9,0x10(%rdi) 0.00 : 8499a: 4c 89 57 18 mov %r10,0x18(%rdi) 0.00 : 8499e: 4c 89 5f 20 mov %r11,0x20(%rdi) 0.00 : 849a2: 4c 89 67 28 mov %r12,0x28(%rdi) 0.00 : 849a6: 4c 89 6f 30 mov %r13,0x30(%rdi) 0.00 : 849aa: 4c 89 77 38 mov %r14,0x38(%rdi) 0.00 : 849ae: 0f 0d 8f 40 03 00 00 prefetchw 0x340(%rdi) 0.00 : 849b5: 0f 0d 8f 80 03 00 00 prefetchw 0x380(%rdi) 0.00 : 849bc: 48 8d 76 40 lea 0x40(%rsi),%rsi 0.00 : 849c0: 48 8d 7f 40 lea 0x40(%rdi),%rdi 0.00 : 849c4: 0f 85 46 ff ff ff jne 84910 0.00 : 849ca: e9 b7 00 00 00 jmpq 84a86 0.00 : 849cf: 90 nop 0.00 : 849d0: 48 ff c9 dec %rcx 0.00 : 849d3: 48 8b 06 mov (%rsi),%rax 0.00 : 849d6: 48 8b 5e 08 mov 0x8(%rsi),%rbx 0.00 : 849da: 4c 8b 4e 10 mov 0x10(%rsi),%r9 0.00 : 849de: 4c 8b 56 18 mov 0x18(%rsi),%r10 0.00 : 849e2: 4c 8b 5e 20 mov 0x20(%rsi),%r11 0.00 : 849e6: 4c 8b 66 28 mov 0x28(%rsi),%r12 0.00 : 849ea: 4c 8b 6e 30 mov 0x30(%rsi),%r13 0.00 : 849ee: 4c 8b 76 38 mov 0x38(%rsi),%r14 0.00 : 849f2: 0f 18 8e 80 03 00 00 prefetcht0 0x380(%rsi) 0.00 : 849f9: 0f 18 8e c0 03 00 00 prefetcht0 0x3c0(%rsi) 0.00 : 84a00: 48 89 07 mov %rax,(%rdi) 0.00 : 84a03: 48 89 5f 08 mov %rbx,0x8(%rdi) 0.00 : 84a07: 4c 89 4f 10 mov %r9,0x10(%rdi) 0.00 : 84a0b: 4c 89 57 18 mov %r10,0x18(%rdi) 0.00 : 84a0f: 4c 89 5f 20 mov %r11,0x20(%rdi) 0.00 : 84a13: 4c 89 67 28 mov %r12,0x28(%rdi) 0.00 : 84a17: 4c 89 6f 30 mov %r13,0x30(%rdi) 0.00 : 84a1b: 4c 89 77 38 mov %r14,0x38(%rdi) 0.00 : 84a1f: 48 8d 76 40 lea 0x40(%rsi),%rsi 0.00 : 84a23: 48 8d 7f 40 lea 0x40(%rdi),%rdi 0.00 : 84a27: 74 5d je 84a86 0.00 : 84a29: 48 ff c9 dec %rcx 0.00 : 84a2c: 48 8b 06 mov (%rsi),%rax 0.00 : 84a2f: 48 8b 5e 08 mov 0x8(%rsi),%rbx 0.00 : 84a33: 4c 8b 4e 10 mov 0x10(%rsi),%r9 0.00 : 84a37: 4c 8b 56 18 mov 0x18(%rsi),%r10 0.00 : 84a3b: 4c 8b 5e 20 mov 0x20(%rsi),%r11 0.00 : 84a3f: 4c 8b 66 28 mov 0x28(%rsi),%r12 0.00 : 84a43: 4c 8b 6e 30 mov 0x30(%rsi),%r13 0.00 : 84a47: 4c 8b 76 38 mov 0x38(%rsi),%r14 0.00 : 84a4b: 0f 18 8f 40 03 00 00 prefetcht0 0x340(%rdi) 0.00 : 84a52: 0f 18 8f 80 03 00 00 prefetcht0 0x380(%rdi) 0.00 : 84a59: 48 89 07 mov %rax,(%rdi) 0.00 : 84a5c: 48 89 5f 08 mov %rbx,0x8(%rdi) 0.00 : 84a60: 4c 89 4f 10 mov %r9,0x10(%rdi) 0.00 : 84a64: 4c 89 57 18 mov %r10,0x18(%rdi) 0.00 : 84a68: 4c 89 5f 20 mov %r11,0x20(%rdi) 0.00 : 84a6c: 4c 89 67 28 mov %r12,0x28(%rdi) 0.00 : 84a70: 4c 89 6f 30 mov %r13,0x30(%rdi) 0.00 : 84a74: 4c 89 77 38 mov %r14,0x38(%rdi) 0.00 : 84a78: 48 8d 76 40 lea 0x40(%rsi),%rsi 0.00 : 84a7c: 48 8d 7f 40 lea 0x40(%rdi),%rdi 0.00 : 84a80: 0f 85 4a ff ff ff jne 849d0 0.00 : 84a86: 48 8b 5c 24 d8 mov -0x28(%rsp),%rbx 0.00 : 84a8b: 4c 8b 64 24 e0 mov -0x20(%rsp),%r12 0.00 : 84a90: 4c 8b 6c 24 e8 mov -0x18(%rsp),%r13 0.00 : 84a95: 4c 8b 74 24 f0 mov -0x10(%rsp),%r14 0.00 : 84a9a: 4c 29 c2 sub %r8,%rdx 0.00 : 84a9d: 48 f7 c2 c0 ff ff ff test $0xffffffffffffffc0,%rdx 0.00 : 84aa4: 75 1a jne 84ac0 0.00 : 84aa6: 83 e2 3f and $0x3f,%edx 0.00 : 84aa9: 48 8b 44 24 f8 mov -0x8(%rsp),%rax 0.00 : 84aae: 0f 85 a5 fc ff ff jne 84759 0.00 : 84ab4: f3 c3 repz retq 0.00 : 84ab6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 84abd: 00 00 00 0.00 : 84ac0: 48 89 d1 mov %rdx,%rcx 0.00 : 84ac3: 48 c1 e9 07 shr $0x7,%rcx 0.00 : 84ac7: 0f 84 d8 00 00 00 je 84ba5 0.00 : 84acd: 4c 89 74 24 f0 mov %r14,-0x10(%rsp) 0.00 : 84ad2: 4c 89 6c 24 e8 mov %r13,-0x18(%rsp) 0.00 : 84ad7: 4c 89 64 24 e0 mov %r12,-0x20(%rsp) 0.00 : 84adc: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 84ae0: 0f 18 86 00 03 00 00 prefetchnta 0x300(%rsi) 0.00 : 84ae7: 0f 18 86 40 03 00 00 prefetchnta 0x340(%rsi) 0.00 : 84aee: 48 ff c9 dec %rcx 0.00 : 84af1: 48 8b 06 mov (%rsi),%rax 0.00 : 84af4: 4c 8b 46 08 mov 0x8(%rsi),%r8 0.00 : 84af8: 4c 8b 4e 10 mov 0x10(%rsi),%r9 0.00 : 84afc: 4c 8b 56 18 mov 0x18(%rsi),%r10 0.00 : 84b00: 4c 8b 5e 20 mov 0x20(%rsi),%r11 0.00 : 84b04: 4c 8b 66 28 mov 0x28(%rsi),%r12 0.00 : 84b08: 4c 8b 6e 30 mov 0x30(%rsi),%r13 0.00 : 84b0c: 4c 8b 76 38 mov 0x38(%rsi),%r14 0.00 : 84b10: 48 0f c3 07 movnti %rax,(%rdi) 0.00 : 84b14: 4c 0f c3 47 08 movnti %r8,0x8(%rdi) 0.00 : 84b19: 4c 0f c3 4f 10 movnti %r9,0x10(%rdi) 0.00 : 84b1e: 4c 0f c3 57 18 movnti %r10,0x18(%rdi) 0.00 : 84b23: 4c 0f c3 5f 20 movnti %r11,0x20(%rdi) 0.00 : 84b28: 4c 0f c3 67 28 movnti %r12,0x28(%rdi) 0.00 : 84b2d: 4c 0f c3 6f 30 movnti %r13,0x30(%rdi) 0.00 : 84b32: 4c 0f c3 77 38 movnti %r14,0x38(%rdi) 0.00 : 84b37: 48 8b 46 40 mov 0x40(%rsi),%rax 0.00 : 84b3b: 4c 8b 46 48 mov 0x48(%rsi),%r8 0.00 : 84b3f: 4c 8b 4e 50 mov 0x50(%rsi),%r9 0.00 : 84b43: 4c 8b 56 58 mov 0x58(%rsi),%r10 0.00 : 84b47: 4c 8b 5e 60 mov 0x60(%rsi),%r11 0.00 : 84b4b: 4c 8b 66 68 mov 0x68(%rsi),%r12 0.00 : 84b4f: 4c 8b 6e 70 mov 0x70(%rsi),%r13 0.00 : 84b53: 4c 8b 76 78 mov 0x78(%rsi),%r14 0.00 : 84b57: 48 0f c3 47 40 movnti %rax,0x40(%rdi) 0.00 : 84b5c: 4c 0f c3 47 48 movnti %r8,0x48(%rdi) 0.00 : 84b61: 4c 0f c3 4f 50 movnti %r9,0x50(%rdi) 0.00 : 84b66: 4c 0f c3 57 58 movnti %r10,0x58(%rdi) 0.00 : 84b6b: 4c 0f c3 5f 60 movnti %r11,0x60(%rdi) 0.00 : 84b70: 4c 0f c3 67 68 movnti %r12,0x68(%rdi) 0.00 : 84b75: 4c 0f c3 6f 70 movnti %r13,0x70(%rdi) 0.00 : 84b7a: 4c 0f c3 77 78 movnti %r14,0x78(%rdi) 0.00 : 84b7f: 48 8d b6 80 00 00 00 lea 0x80(%rsi),%rsi 0.00 : 84b86: 48 8d bf 80 00 00 00 lea 0x80(%rdi),%rdi 0.00 : 84b8d: 0f 85 4d ff ff ff jne 84ae0 0.00 : 84b93: 0f ae f8 sfence 0.00 : 84b96: 4c 8b 64 24 e0 mov -0x20(%rsp),%r12 0.00 : 84b9b: 4c 8b 6c 24 e8 mov -0x18(%rsp),%r13 0.00 : 84ba0: 4c 8b 74 24 f0 mov -0x10(%rsp),%r14 0.00 : 84ba5: 83 e2 7f and $0x7f,%edx 0.00 : 84ba8: 48 8b 44 24 f8 mov -0x8(%rsp),%rax 0.00 : 84bad: 0f 85 a6 fb ff ff jne 84759 0.00 : 84bb3: f3 c3 repz retq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1296 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1313 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1319 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1320 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1334 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000046f260 : : * This function forces the entries of the slot's Datum/isnull : * arrays to be valid at least up through the attnum'th entry. : */ : void : slot_getsomeattrs(TupleTableSlot *slot, int attnum) : { 20.00 : 46f260: 55 push %rbp 0.00 : 46f261: 48 89 e5 mov %rsp,%rbp 0.00 : 46f264: 4c 89 65 f0 mov %r12,-0x10(%rbp) 0.00 : 46f268: 4c 89 6d f8 mov %r13,-0x8(%rbp) 0.00 : 46f26c: 49 89 fc mov %rdi,%r12 0.00 : 46f26f: 48 89 5d e8 mov %rbx,-0x18(%rbp) 0.00 : 46f273: 48 83 ec 20 sub $0x20,%rsp : HeapTuple tuple; : int attno; : : /* Quick out if we have 'em all already */ : if (slot->tts_nvalid >= attnum) 0.00 : 46f277: 39 77 24 cmp %esi,0x24(%rdi) : * This function forces the entries of the slot's Datum/isnull : * arrays to be valid at least up through the attnum'th entry. : */ : void : slot_getsomeattrs(TupleTableSlot *slot, int attnum) : { 0.00 : 46f27a: 41 89 f5 mov %esi,%r13d : HeapTuple tuple; : int attno; : : /* Quick out if we have 'em all already */ : if (slot->tts_nvalid >= attnum) 0.00 : 46f27d: 7d 67 jge 46f2e6 : return; : : /* Check for caller error */ : if (attnum <= 0 || attnum > slot->tts_tupleDescriptor->natts) 0.00 : 46f27f: 85 f6 test %esi,%esi 0.00 : 46f281: 7e 75 jle 46f2f8 0.00 : 46f283: 48 8b 47 10 mov 0x10(%rdi),%rax 0.00 : 46f287: 3b 30 cmp (%rax),%esi 0.00 : 46f289: 7f 6d jg 46f2f8 : : /* : * otherwise we had better have a physical tuple (tts_nvalid should equal : * natts in all virtual-tuple cases) : */ : tuple = slot->tts_tuple; 0.00 : 46f28b: 48 8b 47 08 mov 0x8(%rdi),%rax : if (tuple == NULL) /* internal error */ /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1313 20.00 : 46f28f: 48 85 c0 test %rax,%rax 0.00 : 46f292: 0f 84 8d 00 00 00 je 46f325 : elog(ERROR, "cannot extract attribute from empty tuple slot"); : : /* : * load up any slots available from physical tuple : */ : attno = HeapTupleHeaderGetNatts(tuple->t_data); 0.00 : 46f298: 48 8b 40 10 mov 0x10(%rax),%rax 0.00 : 46f29c: 0f b7 40 12 movzwl 0x12(%rax),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1319 20.00 : 46f2a0: 25 ff 07 00 00 and $0x7ff,%eax : attno = Min(attno, attnum); 0.00 : 46f2a5: 39 c6 cmp %eax,%esi /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1320 20.00 : 46f2a7: 89 c3 mov %eax,%ebx 0.00 : 46f2a9: 0f 4e de cmovle %esi,%ebx : : slot_deform_tuple(slot, attno); 0.00 : 46f2ac: 89 de mov %ebx,%esi 0.00 : 46f2ae: e8 5d fc ff ff callq 46ef10 : : /* : * If tuple doesn't have all the atts indicated by tupleDesc, read the : * rest as null : */ : for (; attno < attnum; attno++) 0.00 : 46f2b3: 41 39 dd cmp %ebx,%r13d 0.00 : 46f2b6: 7e 29 jle 46f2e1 0.00 : 46f2b8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 46f2bf: 00 : { : slot->tts_values[attno] = (Datum) 0; 0.00 : 46f2c0: 49 8b 54 24 28 mov 0x28(%r12),%rdx 0.00 : 46f2c5: 48 63 c3 movslq %ebx,%rax : : /* : * If tuple doesn't have all the atts indicated by tupleDesc, read the : * rest as null : */ : for (; attno < attnum; attno++) 0.00 : 46f2c8: 83 c3 01 add $0x1,%ebx 0.00 : 46f2cb: 41 39 dd cmp %ebx,%r13d : { : slot->tts_values[attno] = (Datum) 0; 0.00 : 46f2ce: 48 c7 04 c2 00 00 00 movq $0x0,(%rdx,%rax,8) 0.00 : 46f2d5: 00 : slot->tts_isnull[attno] = true; 0.00 : 46f2d6: 49 8b 54 24 30 mov 0x30(%r12),%rdx 0.00 : 46f2db: c6 04 02 01 movb $0x1,(%rdx,%rax,1) : : /* : * If tuple doesn't have all the atts indicated by tupleDesc, read the : * rest as null : */ : for (; attno < attnum; attno++) 0.00 : 46f2df: 7f df jg 46f2c0 : { : slot->tts_values[attno] = (Datum) 0; : slot->tts_isnull[attno] = true; : } : slot->tts_nvalid = attnum; 0.00 : 46f2e1: 45 89 6c 24 24 mov %r13d,0x24(%r12) : } 0.00 : 46f2e6: 48 8b 5d e8 mov -0x18(%rbp),%rbx 0.00 : 46f2ea: 4c 8b 65 f0 mov -0x10(%rbp),%r12 0.00 : 46f2ee: 4c 8b 6d f8 mov -0x8(%rbp),%r13 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1334 20.00 : 46f2f2: c9 leaveq 0.00 : 46f2f3: c3 retq 0.00 : 46f2f4: 0f 1f 40 00 nopl 0x0(%rax) : if (slot->tts_nvalid >= attnum) : return; : : /* Check for caller error */ : if (attnum <= 0 || attnum > slot->tts_tupleDescriptor->natts) : elog(ERROR, "invalid attribute number %d", attnum); 0.00 : 46f2f8: ba c0 f6 7a 00 mov $0x7af6c0,%edx 0.00 : 46f2fd: be 1a 05 00 00 mov $0x51a,%esi 0.00 : 46f302: bf f4 f5 7a 00 mov $0x7af5f4,%edi 0.00 : 46f307: e8 14 c1 30 00 callq 77b420 0.00 : 46f30c: 44 89 ea mov %r13d,%edx 0.00 : 46f30f: be 13 f6 7a 00 mov $0x7af613,%esi 0.00 : 46f314: bf 14 00 00 00 mov $0x14,%edi 0.00 : 46f319: 31 c0 xor %eax,%eax 0.00 : 46f31b: e8 10 bf 30 00 callq 77b230 0.00 : 46f320: e8 ab a1 ff ff callq 4694d0 : * otherwise we had better have a physical tuple (tts_nvalid should equal : * natts in all virtual-tuple cases) : */ : tuple = slot->tts_tuple; : if (tuple == NULL) /* internal error */ : elog(ERROR, "cannot extract attribute from empty tuple slot"); 0.00 : 46f325: ba c0 f6 7a 00 mov $0x7af6c0,%edx 0.00 : 46f32a: be 22 05 00 00 mov $0x522,%esi 0.00 : 46f32f: bf f4 f5 7a 00 mov $0x7af5f4,%edi 0.00 : 46f334: e8 e7 c0 30 00 callq 77b420 0.00 : 46f339: be b0 f7 7a 00 mov $0x7af7b0,%esi 0.00 : 46f33e: bf 14 00 00 00 mov $0x14,%edi 0.00 : 46f343: 31 c0 xor %eax,%eax 0.00 : 46f345: e8 e6 be 30 00 callq 77b230 0.00 : 46f34a: e8 81 a1 ff ff callq 4694d0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 40.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1669 20.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1669 20.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1693 20.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1693 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bbfc0 : : /* : * Allocate 'size' bytes from the currently active HashMemoryChunk : */ : static void * : dense_alloc(HashJoinTable hashtable, Size size) : { 0.00 : 5bbfc0: 55 push %rbp 0.00 : 5bbfc1: 48 89 e5 mov %rsp,%rbp 0.00 : 5bbfc4: 41 54 push %r12 0.00 : 5bbfc6: 49 89 fc mov %rdi,%r12 0.00 : 5bbfc9: 53 push %rbx : HashMemoryChunk newChunk; : char *ptr; : : /* just in case the size is not already aligned properly */ : size = MAXALIGN(size); 0.00 : 5bbfca: 48 8d 5e 07 lea 0x7(%rsi),%rbx 0.00 : 5bbfce: 48 83 e3 f8 and $0xfffffffffffffff8,%rbx : : /* : * If tuple size is larger than of 1/4 of chunk size, allocate a separate : * chunk. : */ : if (size > HASH_CHUNK_THRESHOLD) 0.00 : 5bbfd2: 48 81 fb 00 20 00 00 cmp $0x2000,%rbx 0.00 : 5bbfd9: 0f 87 89 00 00 00 ja 5bc068 : : /* : * See if we have enough space for it in the current chunk (if any). : * If not, allocate a fresh chunk. : */ : if ((hashtable->chunks == NULL) || 0.00 : 5bbfdf: 48 8b 97 c8 00 00 00 mov 0xc8(%rdi),%rdx 0.00 : 5bbfe6: 48 85 d2 test %rdx,%rdx 0.00 : 5bbfe9: 74 35 je 5bc020 0.00 : 5bbfeb: 48 8b 4a 10 mov 0x10(%rdx),%rcx /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1669 40.00 : 5bbfef: 48 8b 42 08 mov 0x8(%rdx),%rax 20.00 : 5bbff3: 48 29 c8 sub %rcx,%rax 0.00 : 5bbff6: 48 39 c3 cmp %rax,%rbx 0.00 : 5bbff9: 77 25 ja 5bc020 : return newChunk->data; : } : : /* There is enough space in the current chunk, let's add the tuple */ : ptr = hashtable->chunks->data + hashtable->chunks->used; : hashtable->chunks->used += size; 0.00 : 5bbffb: 48 8d 04 0b lea (%rbx,%rcx,1),%rax 0.00 : 5bbfff: 48 89 42 10 mov %rax,0x10(%rdx) : hashtable->chunks->ntuples += 1; 0.00 : 5bc003: 48 8b 87 c8 00 00 00 mov 0xc8(%rdi),%rax 0.00 : 5bc00a: 83 00 01 addl $0x1,(%rax) : : /* return pointer to the start of the tuple memory */ : return ptr; 0.00 : 5bc00d: 48 8d 44 0a 20 lea 0x20(%rdx,%rcx,1),%rax : } 0.00 : 5bc012: 5b pop %rbx /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1693 20.00 : 5bc013: 41 5c pop %r12 0.00 : 5bc015: c9 leaveq 20.00 : 5bc016: c3 retq 0.00 : 5bc017: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5bc01e: 00 00 : */ : if ((hashtable->chunks == NULL) || : (hashtable->chunks->maxlen - hashtable->chunks->used) < size) : { : /* allocate new chunk and put it at the beginning of the list */ : newChunk = (HashMemoryChunk) MemoryContextAlloc(hashtable->batchCxt, 0.00 : 5bc020: 49 8b bc 24 c0 00 00 mov 0xc0(%r12),%rdi 0.00 : 5bc027: 00 0.00 : 5bc028: be 20 80 00 00 mov $0x8020,%esi 0.00 : 5bc02d: e8 5e ce 1d 00 callq 798e90 : offsetof(HashMemoryChunkData, data) + HASH_CHUNK_SIZE); : : newChunk->maxlen = HASH_CHUNK_SIZE; 0.00 : 5bc032: 48 c7 40 08 00 80 00 movq $0x8000,0x8(%rax) 0.00 : 5bc039: 00 : newChunk->used = size; 0.00 : 5bc03a: 48 89 58 10 mov %rbx,0x10(%rax) : newChunk->ntuples = 1; 0.00 : 5bc03e: c7 00 01 00 00 00 movl $0x1,(%rax) : : newChunk->next = hashtable->chunks; 0.00 : 5bc044: 49 8b 94 24 c8 00 00 mov 0xc8(%r12),%rdx 0.00 : 5bc04b: 00 0.00 : 5bc04c: 48 89 50 18 mov %rdx,0x18(%rax) : hashtable->chunks = newChunk; 0.00 : 5bc050: 49 89 84 24 c8 00 00 mov %rax,0xc8(%r12) 0.00 : 5bc057: 00 : : return newChunk->data; 0.00 : 5bc058: 48 83 c0 20 add $0x20,%rax : hashtable->chunks->used += size; : hashtable->chunks->ntuples += 1; : : /* return pointer to the start of the tuple memory */ : return ptr; : } 0.00 : 5bc05c: 5b pop %rbx 0.00 : 5bc05d: 41 5c pop %r12 0.00 : 5bc05f: c9 leaveq 0.00 : 5bc060: c3 retq 0.00 : 5bc061: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * chunk. : */ : if (size > HASH_CHUNK_THRESHOLD) : { : /* allocate new chunk and put it at the beginning of the list */ : newChunk = (HashMemoryChunk) MemoryContextAlloc(hashtable->batchCxt, 0.00 : 5bc068: 48 8b bf c0 00 00 00 mov 0xc0(%rdi),%rdi 0.00 : 5bc06f: 48 8d 73 20 lea 0x20(%rbx),%rsi 0.00 : 5bc073: e8 18 ce 1d 00 callq 798e90 0.00 : 5bc078: 48 89 c2 mov %rax,%rdx : offsetof(HashMemoryChunkData, data) + size); : newChunk->maxlen = size; 0.00 : 5bc07b: 48 89 58 08 mov %rbx,0x8(%rax) : newChunk->used = 0; 0.00 : 5bc07f: 48 c7 40 10 00 00 00 movq $0x0,0x10(%rax) 0.00 : 5bc086: 00 : newChunk->ntuples = 0; 0.00 : 5bc087: c7 00 00 00 00 00 movl $0x0,(%rax) : : /* : * Add this chunk to the list after the first existing chunk, so that : * we don't lose the remaining space in the "current" chunk. : */ : if (hashtable->chunks != NULL) 0.00 : 5bc08d: 49 8b 84 24 c8 00 00 mov 0xc8(%r12),%rax 0.00 : 5bc094: 00 0.00 : 5bc095: 48 85 c0 test %rax,%rax 0.00 : 5bc098: 74 26 je 5bc0c0 : { : newChunk->next = hashtable->chunks->next; 0.00 : 5bc09a: 48 8b 40 18 mov 0x18(%rax),%rax 0.00 : 5bc09e: 48 89 42 18 mov %rax,0x18(%rdx) : hashtable->chunks->next = newChunk; 0.00 : 5bc0a2: 49 8b 84 24 c8 00 00 mov 0xc8(%r12),%rax 0.00 : 5bc0a9: 00 0.00 : 5bc0aa: 48 89 50 18 mov %rdx,0x18(%rax) : { : newChunk->next = hashtable->chunks; : hashtable->chunks = newChunk; : } : : newChunk->used += size; 0.00 : 5bc0ae: 48 01 5a 10 add %rbx,0x10(%rdx) : newChunk->ntuples += 1; 0.00 : 5bc0b2: 83 02 01 addl $0x1,(%rdx) : : return newChunk->data; 0.00 : 5bc0b5: 48 8d 42 20 lea 0x20(%rdx),%rax : hashtable->chunks->used += size; : hashtable->chunks->ntuples += 1; : : /* return pointer to the start of the tuple memory */ : return ptr; : } 0.00 : 5bc0b9: 5b pop %rbx 0.00 : 5bc0ba: 41 5c pop %r12 0.00 : 5bc0bc: c9 leaveq 0.00 : 5bc0bd: c3 retq 0.00 : 5bc0be: 66 90 xchg %ax,%ax : newChunk->next = hashtable->chunks->next; : hashtable->chunks->next = newChunk; : } : else : { : newChunk->next = hashtable->chunks; 0.00 : 5bc0c0: 48 c7 42 18 00 00 00 movq $0x0,0x18(%rdx) 0.00 : 5bc0c7: 00 : hashtable->chunks = newChunk; 0.00 : 5bc0c8: 49 89 94 24 c8 00 00 mov %rdx,0xc8(%r12) 0.00 : 5bc0cf: 00 0.00 : 5bc0d0: eb dc jmp 5bc0ae Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 80.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1870 20.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1881 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000675260 : : * : * Note: caller must have done ResourceOwnerEnlargeBuffers. : */ : static int : SyncOneBuffer(int buf_id, bool skip_recently_used) : { 0.00 : 675260: 55 push %rbp : static __inline__ int : tas(volatile slock_t *lock) : { : register slock_t _res = 1; : : __asm__ __volatile__( 0.00 : 675261: b8 01 00 00 00 mov $0x1,%eax 0.00 : 675266: 48 89 e5 mov %rsp,%rbp 0.00 : 675269: 48 89 5d e8 mov %rbx,-0x18(%rbp) : volatile BufferDesc *bufHdr = &BufferDescriptors[buf_id]; 0.00 : 67526d: 48 63 df movslq %edi,%rbx : * : * Note: caller must have done ResourceOwnerEnlargeBuffers. : */ : static int : SyncOneBuffer(int buf_id, bool skip_recently_used) : { 0.00 : 675270: 4c 89 6d f8 mov %r13,-0x8(%rbp) 0.00 : 675274: 4c 89 65 f0 mov %r12,-0x10(%rbp) : volatile BufferDesc *bufHdr = &BufferDescriptors[buf_id]; 0.00 : 675278: 48 c1 e3 06 shl $0x6,%rbx : * : * Note: caller must have done ResourceOwnerEnlargeBuffers. : */ : static int : SyncOneBuffer(int buf_id, bool skip_recently_used) : { 0.00 : 67527c: 48 83 ec 20 sub $0x20,%rsp : volatile BufferDesc *bufHdr = &BufferDescriptors[buf_id]; 0.00 : 675280: 48 03 1d 79 a8 54 00 add 0x54a879(%rip),%rbx # bbfb00 : * : * Note: caller must have done ResourceOwnerEnlargeBuffers. : */ : static int : SyncOneBuffer(int buf_id, bool skip_recently_used) : { 0.00 : 675287: 41 89 f5 mov %esi,%r13d : * as we mark pages dirty in access methods *before* logging changes with : * XLogInsert(): if someone marks the buffer dirty just after our check we : * don't worry because our checkpoint.redo points before log record for : * upcoming changes and so we are not required to write such dirty buffer. : */ : LockBufHdr(bufHdr); 0.00 : 67528a: 48 8d 7b 20 lea 0x20(%rbx),%rdi 0.00 : 67528e: f0 86 07 lock xchg %al,(%rdi) /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1870 80.00 : 675291: 84 c0 test %al,%al 0.00 : 675293: 75 5b jne 6752f0 : : if (bufHdr->refcount == 0 && bufHdr->usage_count == 0) 0.00 : 675295: 8b 43 18 mov 0x18(%rbx),%eax 0.00 : 675298: 85 c0 test %eax,%eax 0.00 : 67529a: 75 0f jne 6752ab 0.00 : 67529c: 0f b7 43 16 movzwl 0x16(%rbx),%eax : result |= BUF_REUSABLE; : else if (skip_recently_used) : { : /* Caller told us not to write recently-used buffers */ : UnlockBufHdr(bufHdr); 0.00 : 6752a0: 41 bc 02 00 00 00 mov $0x2,%r12d : * don't worry because our checkpoint.redo points before log record for : * upcoming changes and so we are not required to write such dirty buffer. : */ : LockBufHdr(bufHdr); : : if (bufHdr->refcount == 0 && bufHdr->usage_count == 0) 0.00 : 6752a6: 66 85 c0 test %ax,%ax 0.00 : 6752a9: 74 08 je 6752b3 : result |= BUF_REUSABLE; : else if (skip_recently_used) 0.00 : 6752ab: 45 31 e4 xor %r12d,%r12d 0.00 : 6752ae: 45 84 ed test %r13b,%r13b 0.00 : 6752b1: 75 2d jne 6752e0 : /* Caller told us not to write recently-used buffers */ : UnlockBufHdr(bufHdr); : return result; : } : : if (!(bufHdr->flags & BM_VALID) || !(bufHdr->flags & BM_DIRTY)) 0.00 : 6752b3: 0f b7 43 14 movzwl 0x14(%rbx),%eax /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1881 20.00 : 6752b7: a8 02 test $0x2,%al 0.00 : 6752b9: 74 08 je 6752c3 0.00 : 6752bb: 0f b7 43 14 movzwl 0x14(%rbx),%eax 0.00 : 6752bf: a8 01 test $0x1,%al 0.00 : 6752c1: 75 45 jne 675308 : { : /* It's clean, so nothing to do */ : UnlockBufHdr(bufHdr); 0.00 : 6752c3: c6 43 20 00 movb $0x0,0x20(%rbx) : : LWLockRelease(bufHdr->content_lock); : UnpinBuffer(bufHdr, true); : : return result | BUF_WRITTEN; : } 0.00 : 6752c7: 44 89 e0 mov %r12d,%eax 0.00 : 6752ca: 48 8b 5d e8 mov -0x18(%rbp),%rbx 0.00 : 6752ce: 4c 8b 65 f0 mov -0x10(%rbp),%r12 0.00 : 6752d2: 4c 8b 6d f8 mov -0x8(%rbp),%r13 0.00 : 6752d6: c9 leaveq 0.00 : 6752d7: c3 retq 0.00 : 6752d8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 6752df: 00 : if (bufHdr->refcount == 0 && bufHdr->usage_count == 0) : result |= BUF_REUSABLE; : else if (skip_recently_used) : { : /* Caller told us not to write recently-used buffers */ : UnlockBufHdr(bufHdr); 0.00 : 6752e0: 45 31 e4 xor %r12d,%r12d 0.00 : 6752e3: c6 43 20 00 movb $0x0,0x20(%rbx) : : LWLockRelease(bufHdr->content_lock); : UnpinBuffer(bufHdr, true); : : return result | BUF_WRITTEN; : } 0.00 : 6752e7: eb de jmp 6752c7 0.00 : 6752e9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * as we mark pages dirty in access methods *before* logging changes with : * XLogInsert(): if someone marks the buffer dirty just after our check we : * don't worry because our checkpoint.redo points before log record for : * upcoming changes and so we are not required to write such dirty buffer. : */ : LockBufHdr(bufHdr); 0.00 : 6752f0: ba 4e 07 00 00 mov $0x74e,%edx 0.00 : 6752f5: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 6752fa: e8 41 ad 01 00 callq 690040 0.00 : 6752ff: eb 94 jmp 675295 0.00 : 675301: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : : /* : * Pin it, share-lock it, write it. (FlushBuffer will do nothing if the : * buffer is clean by the time we've locked it.) : */ : PinBuffer_Locked(bufHdr); 0.00 : 675308: 48 89 df mov %rbx,%rdi : FlushBuffer(bufHdr, NULL); : : LWLockRelease(bufHdr->content_lock); : UnpinBuffer(bufHdr, true); : : return result | BUF_WRITTEN; 0.00 : 67530b: 41 83 cc 01 or $0x1,%r12d : : /* : * Pin it, share-lock it, write it. (FlushBuffer will do nothing if the : * buffer is clean by the time we've locked it.) : */ : PinBuffer_Locked(bufHdr); 0.00 : 67530f: e8 bc f8 ff ff callq 674bd0 : LWLockAcquire(bufHdr->content_lock, LW_SHARED); 0.00 : 675314: 48 8b 7b 38 mov 0x38(%rbx),%rdi 0.00 : 675318: be 01 00 00 00 mov $0x1,%esi 0.00 : 67531d: e8 ce a7 01 00 callq 68faf0 : : FlushBuffer(bufHdr, NULL); 0.00 : 675322: 31 f6 xor %esi,%esi 0.00 : 675324: 48 89 df mov %rbx,%rdi 0.00 : 675327: e8 24 fc ff ff callq 674f50 : : LWLockRelease(bufHdr->content_lock); 0.00 : 67532c: 48 8b 7b 38 mov 0x38(%rbx),%rdi 0.00 : 675330: e8 6b a0 01 00 callq 68f3a0 : UnpinBuffer(bufHdr, true); 0.00 : 675335: be 01 00 00 00 mov $0x1,%esi 0.00 : 67533a: 48 89 df mov %rbx,%rdi 0.00 : 67533d: e8 ee f9 ff ff callq 674d30 : : return result | BUF_WRITTEN; : } 0.00 : 675342: eb 83 jmp 6752c7 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:716 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:709 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:719 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:721 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:724 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000798f70 : : return ret; : } : : void * : palloc0(Size size) : { 0.00 : 798f70: 55 push %rbp : void *ret; : : AssertArg(MemoryContextIsValid(CurrentMemoryContext)); : AssertNotInCriticalSection(CurrentMemoryContext); : : if (!AllocSizeIsValid(size)) /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:716 20.00 : 798f71: 48 81 ff ff ff ff 3f cmp $0x3fffffff,%rdi : return ret; : } : : void * : palloc0(Size size) : { 0.00 : 798f78: 48 89 e5 mov %rsp,%rbp 0.00 : 798f7b: 41 54 push %r12 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:709 20.00 : 798f7d: 53 push %rbx 0.00 : 798f7e: 48 89 fb mov %rdi,%rbx : void *ret; : : AssertArg(MemoryContextIsValid(CurrentMemoryContext)); : AssertNotInCriticalSection(CurrentMemoryContext); : : if (!AllocSizeIsValid(size)) 0.00 : 798f81: 77 6d ja 798ff0 : elog(ERROR, "invalid memory alloc request size %zu", size); : : CurrentMemoryContext->isReset = false; 0.00 : 798f83: 48 8b 05 d6 18 42 00 mov 0x4218d6(%rip),%rax # bba860 : : ret = (*CurrentMemoryContext->methods->alloc) (CurrentMemoryContext, size); 0.00 : 798f8a: 48 89 de mov %rbx,%rsi : AssertNotInCriticalSection(CurrentMemoryContext); : : if (!AllocSizeIsValid(size)) : elog(ERROR, "invalid memory alloc request size %zu", size); : : CurrentMemoryContext->isReset = false; /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:719 20.00 : 798f8d: c6 40 30 00 movb $0x0,0x30(%rax) : : ret = (*CurrentMemoryContext->methods->alloc) (CurrentMemoryContext, size); /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:721 20.00 : 798f91: 48 8b 3d c8 18 42 00 mov 0x4218c8(%rip),%rdi # bba860 0.00 : 798f98: 48 8b 47 08 mov 0x8(%rdi),%rax 0.00 : 798f9c: ff 10 callq *(%rax) : VALGRIND_MEMPOOL_ALLOC(CurrentMemoryContext, ret, size); : : MemSetAligned(ret, 0, size); 0.00 : 798f9e: f6 c3 07 test $0x7,%bl : if (!AllocSizeIsValid(size)) : elog(ERROR, "invalid memory alloc request size %zu", size); : : CurrentMemoryContext->isReset = false; : : ret = (*CurrentMemoryContext->methods->alloc) (CurrentMemoryContext, size); 0.00 : 798fa1: 49 89 c4 mov %rax,%r12 : VALGRIND_MEMPOOL_ALLOC(CurrentMemoryContext, ret, size); : : MemSetAligned(ret, 0, size); 0.00 : 798fa4: 75 09 jne 798faf 0.00 : 798fa6: 48 81 fb 00 04 00 00 cmp $0x400,%rbx 0.00 : 798fad: 76 19 jbe 798fc8 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:724 20.00 : 798faf: 48 89 da mov %rbx,%rdx 0.00 : 798fb2: 31 f6 xor %esi,%esi 0.00 : 798fb4: 4c 89 e7 mov %r12,%rdi 0.00 : 798fb7: e8 64 04 cd ff callq 469420 : : return ret; : } 0.00 : 798fbc: 5b pop %rbx 0.00 : 798fbd: 4c 89 e0 mov %r12,%rax 0.00 : 798fc0: 41 5c pop %r12 0.00 : 798fc2: c9 leaveq 0.00 : 798fc3: c3 retq 0.00 : 798fc4: 0f 1f 40 00 nopl 0x0(%rax) : CurrentMemoryContext->isReset = false; : : ret = (*CurrentMemoryContext->methods->alloc) (CurrentMemoryContext, size); : VALGRIND_MEMPOOL_ALLOC(CurrentMemoryContext, ret, size); : : MemSetAligned(ret, 0, size); 0.00 : 798fc8: 49 8d 14 1c lea (%r12,%rbx,1),%rdx 0.00 : 798fcc: 49 39 d4 cmp %rdx,%r12 0.00 : 798fcf: 73 eb jae 798fbc 0.00 : 798fd1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 798fd8: 48 c7 00 00 00 00 00 movq $0x0,(%rax) 0.00 : 798fdf: 48 83 c0 08 add $0x8,%rax 0.00 : 798fe3: 48 39 c2 cmp %rax,%rdx 0.00 : 798fe6: 77 f0 ja 798fd8 : : return ret; : } 0.00 : 798fe8: 5b pop %rbx 0.00 : 798fe9: 4c 89 e0 mov %r12,%rax 0.00 : 798fec: 41 5c pop %r12 0.00 : 798fee: c9 leaveq 0.00 : 798fef: c3 retq : : AssertArg(MemoryContextIsValid(CurrentMemoryContext)); : AssertNotInCriticalSection(CurrentMemoryContext); : : if (!AllocSizeIsValid(size)) : elog(ERROR, "invalid memory alloc request size %zu", size); 0.00 : 798ff0: ba 10 20 8e 00 mov $0x8e2010,%edx 0.00 : 798ff5: be cd 02 00 00 mov $0x2cd,%esi 0.00 : 798ffa: bf 8e 1f 8e 00 mov $0x8e1f8e,%edi 0.00 : 798fff: e8 1c 24 fe ff callq 77b420 0.00 : 799004: 48 89 da mov %rbx,%rdx 0.00 : 799007: be b8 1f 8e 00 mov $0x8e1fb8,%esi 0.00 : 79900c: bf 14 00 00 00 mov $0x14,%edi 0.00 : 799011: 31 c0 xor %eax,%eax 0.00 : 799013: e8 18 22 fe ff callq 77b230 0.00 : 799018: e8 b3 04 cd ff callq 4694d0 Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 25.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:306 25.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:328 25.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:328 25.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:496 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000490350 : : * by using the final values of both b and c. b is perhaps a little less : * well mixed than c, however. : */ : Datum : hash_any(register const unsigned char *k, register int keylen) : { 0.00 : 490350: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:306 25.00 : 490351: 41 89 f2 mov %esi,%r10d : /* Set up the internal state */ : len = keylen; : a = b = c = 0x9e3779b9 + len + 3923095; : : /* If the source pointer is word-aligned, we use word-wide fetches */ : if (((uintptr_t) k & UINT32_ALIGN_MASK) == 0) 0.00 : 490354: 40 f6 c7 03 test $0x3,%dil : c, : len; : : /* Set up the internal state */ : len = keylen; : a = b = c = 0x9e3779b9 + len + 3923095; 0.00 : 490358: 45 8d 82 50 56 73 9e lea -0x618ca9b0(%r10),%r8d : * by using the final values of both b and c. b is perhaps a little less : * well mixed than c, however. : */ : Datum : hash_any(register const unsigned char *k, register int keylen) : { 0.00 : 49035f: 48 89 e5 mov %rsp,%rbp 0.00 : 490362: 53 push %rbx : /* Set up the internal state */ : len = keylen; : a = b = c = 0x9e3779b9 + len + 3923095; : : /* If the source pointer is word-aligned, we use word-wide fetches */ : if (((uintptr_t) k & UINT32_ALIGN_MASK) == 0) 0.00 : 490363: 0f 84 f7 00 00 00 je 490460 : else : { : /* Code path for non-aligned source data */ : : /* handle most of the key */ : while (len >= 12) 0.00 : 490369: 83 fe 0b cmp $0xb,%esi : /* fall through */ : case 2: : a += ((uint32) k[1] << 8); : /* fall through */ : case 1: : a += k[0]; 0.00 : 49036c: 45 89 c1 mov %r8d,%r9d 0.00 : 49036f: 44 89 c2 mov %r8d,%edx : else : { : /* Code path for non-aligned source data */ : : /* handle most of the key */ : while (len >= 12) 0.00 : 490372: 0f 86 7e 02 00 00 jbe 4905f6 0.00 : 490378: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 49037f: 00 : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 0.00 : 490380: 0f b6 4f 05 movzbl 0x5(%rdi),%ecx 0.00 : 490384: 0f b6 47 06 movzbl 0x6(%rdi),%eax : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 0.00 : 490388: 0f b6 77 09 movzbl 0x9(%rdi),%esi : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 0.00 : 49038c: c1 e0 10 shl $0x10,%eax 0.00 : 49038f: c1 e1 08 shl $0x8,%ecx 0.00 : 490392: 01 c1 add %eax,%ecx 0.00 : 490394: 0f b6 47 04 movzbl 0x4(%rdi),%eax : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 0.00 : 490398: c1 e6 08 shl $0x8,%esi : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 0.00 : 49039b: 01 c1 add %eax,%ecx 0.00 : 49039d: 0f b6 47 07 movzbl 0x7(%rdi),%eax 0.00 : 4903a1: c1 e0 18 shl $0x18,%eax 0.00 : 4903a4: 01 c1 add %eax,%ecx : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 0.00 : 4903a6: 0f b6 47 0a movzbl 0xa(%rdi),%eax : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 0.00 : 4903aa: 01 d1 add %edx,%ecx : #ifdef WORDS_BIGENDIAN : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 0.00 : 4903ac: 0f b6 57 01 movzbl 0x1(%rdi),%edx : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 0.00 : 4903b0: c1 e0 10 shl $0x10,%eax 0.00 : 4903b3: 01 c6 add %eax,%esi 0.00 : 4903b5: 0f b6 47 08 movzbl 0x8(%rdi),%eax : #ifdef WORDS_BIGENDIAN : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 0.00 : 4903b9: c1 e2 08 shl $0x8,%edx : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 0.00 : 4903bc: 01 c6 add %eax,%esi 0.00 : 4903be: 0f b6 47 0b movzbl 0xb(%rdi),%eax 0.00 : 4903c2: c1 e0 18 shl $0x18,%eax 0.00 : 4903c5: 01 c6 add %eax,%esi : #ifdef WORDS_BIGENDIAN : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 0.00 : 4903c7: 0f b6 47 02 movzbl 0x2(%rdi),%eax : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 0.00 : 4903cb: 44 01 c6 add %r8d,%esi : #ifdef WORDS_BIGENDIAN : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 0.00 : 4903ce: c1 e0 10 shl $0x10,%eax 0.00 : 4903d1: 01 c2 add %eax,%edx 0.00 : 4903d3: 0f b6 07 movzbl (%rdi),%eax 0.00 : 4903d6: 01 c2 add %eax,%edx 0.00 : 4903d8: 0f b6 47 03 movzbl 0x3(%rdi),%eax 0.00 : 4903dc: c1 e0 18 shl $0x18,%eax 0.00 : 4903df: 01 c2 add %eax,%edx : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); : #endif /* WORDS_BIGENDIAN */ : mix(a, b, c); 0.00 : 4903e1: 89 f0 mov %esi,%eax : #ifdef WORDS_BIGENDIAN : a += (k[3] + ((uint32) k[2] << 8) + ((uint32) k[1] << 16) + ((uint32) k[0] << 24)); : b += (k[7] + ((uint32) k[6] << 8) + ((uint32) k[5] << 16) + ((uint32) k[4] << 24)); : c += (k[11] + ((uint32) k[10] << 8) + ((uint32) k[9] << 16) + ((uint32) k[8] << 24)); : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 0.00 : 4903e3: 44 01 ca add %r9d,%edx : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); : #endif /* WORDS_BIGENDIAN */ : mix(a, b, c); 0.00 : 4903e6: c1 c8 1c ror $0x1c,%eax 0.00 : 4903e9: 29 f2 sub %esi,%edx 0.00 : 4903eb: 01 ce add %ecx,%esi 0.00 : 4903ed: 31 c2 xor %eax,%edx 0.00 : 4903ef: 89 d0 mov %edx,%eax 0.00 : 4903f1: 29 d1 sub %edx,%ecx 0.00 : 4903f3: 01 f2 add %esi,%edx 0.00 : 4903f5: c1 c8 1a ror $0x1a,%eax 0.00 : 4903f8: 31 c8 xor %ecx,%eax 0.00 : 4903fa: 89 c1 mov %eax,%ecx 0.00 : 4903fc: 29 c6 sub %eax,%esi 0.00 : 4903fe: 01 d0 add %edx,%eax 0.00 : 490400: c1 c9 18 ror $0x18,%ecx 0.00 : 490403: 31 f1 xor %esi,%ecx 0.00 : 490405: 89 ce mov %ecx,%esi 0.00 : 490407: 29 ca sub %ecx,%edx 0.00 : 490409: 01 c1 add %eax,%ecx 0.00 : 49040b: c1 ce 10 ror $0x10,%esi : k += 12; : len -= 12; 0.00 : 49040e: 41 83 ea 0c sub $0xc,%r10d : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); : #endif /* WORDS_BIGENDIAN */ : mix(a, b, c); : k += 12; 0.00 : 490412: 48 83 c7 0c add $0xc,%rdi : #else /* !WORDS_BIGENDIAN */ : a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); : b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); : c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); : #endif /* WORDS_BIGENDIAN */ : mix(a, b, c); 0.00 : 490416: 31 d6 xor %edx,%esi 0.00 : 490418: 89 f2 mov %esi,%edx 0.00 : 49041a: 29 f0 sub %esi,%eax 0.00 : 49041c: 44 8d 0c 0e lea (%rsi,%rcx,1),%r9d 0.00 : 490420: c1 ca 0d ror $0xd,%edx 0.00 : 490423: 31 c2 xor %eax,%edx 0.00 : 490425: 41 89 d0 mov %edx,%r8d 0.00 : 490428: 29 d1 sub %edx,%ecx 0.00 : 49042a: 44 01 ca add %r9d,%edx 0.00 : 49042d: 41 c1 c8 1c ror $0x1c,%r8d 0.00 : 490431: 41 31 c8 xor %ecx,%r8d : else : { : /* Code path for non-aligned source data */ : : /* handle most of the key */ : while (len >= 12) 0.00 : 490434: 41 83 fa 0b cmp $0xb,%r10d 0.00 : 490438: 0f 87 42 ff ff ff ja 490380 0.00 : 49043e: 45 89 cb mov %r9d,%r11d 0.00 : 490441: 89 d6 mov %edx,%esi 0.00 : 490443: 44 89 c3 mov %r8d,%ebx : case 1: : a += ((uint32) k[0] << 24); : /* case 0: nothing left to add */ : } : #else /* !WORDS_BIGENDIAN */ : switch (len) /* all the case statements fall through */ 0.00 : 490446: 41 83 fa 0b cmp $0xb,%r10d 0.00 : 49044a: 0f 87 01 01 00 00 ja 490551 0.00 : 490450: 44 89 d0 mov %r10d,%eax 0.00 : 490453: ff 24 c5 18 22 7b 00 jmpq *0x7b2218(,%rax,8) 0.00 : 49045a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : { : /* Code path for aligned source data */ : register const uint32 *ka = (const uint32 *) k; : : /* handle most of the key */ : while (len >= 12) 0.00 : 490460: 83 fe 0b cmp $0xb,%esi 0.00 : 490463: 45 89 c1 mov %r8d,%r9d 0.00 : 490466: 44 89 c1 mov %r8d,%ecx 0.00 : 490469: 0f 86 79 01 00 00 jbe 4905e8 0.00 : 49046f: 90 nop : { : a += ka[0]; : b += ka[1]; : c += ka[2]; 0.00 : 490470: 44 89 c6 mov %r8d,%esi 0.00 : 490473: 03 77 08 add 0x8(%rdi),%esi : register const uint32 *ka = (const uint32 *) k; : : /* handle most of the key */ : while (len >= 12) : { : a += ka[0]; 0.00 : 490476: 44 89 c8 mov %r9d,%eax 0.00 : 490479: 03 07 add (%rdi),%eax : b += ka[1]; 0.00 : 49047b: 03 4f 04 add 0x4(%rdi),%ecx : c += ka[2]; : mix(a, b, c); : ka += 3; : len -= 12; 0.00 : 49047e: 41 83 ea 0c sub $0xc,%r10d : { : a += ka[0]; : b += ka[1]; : c += ka[2]; : mix(a, b, c); : ka += 3; 0.00 : 490482: 48 83 c7 0c add $0xc,%rdi : while (len >= 12) : { : a += ka[0]; : b += ka[1]; : c += ka[2]; : mix(a, b, c); 0.00 : 490486: 89 f2 mov %esi,%edx 0.00 : 490488: 29 f0 sub %esi,%eax 0.00 : 49048a: c1 ca 1c ror $0x1c,%edx 0.00 : 49048d: 01 ce add %ecx,%esi 0.00 : 49048f: 31 d0 xor %edx,%eax 0.00 : 490491: 89 c2 mov %eax,%edx 0.00 : 490493: 29 c1 sub %eax,%ecx 0.00 : 490495: 01 f0 add %esi,%eax 0.00 : 490497: c1 ca 1a ror $0x1a,%edx 0.00 : 49049a: 31 ca xor %ecx,%edx 0.00 : 49049c: 89 d1 mov %edx,%ecx 0.00 : 49049e: 29 d6 sub %edx,%esi 0.00 : 4904a0: 01 c2 add %eax,%edx 0.00 : 4904a2: c1 c9 18 ror $0x18,%ecx /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:328 25.00 : 4904a5: 31 f1 xor %esi,%ecx 0.00 : 4904a7: 89 ce mov %ecx,%esi 0.00 : 4904a9: 29 c8 sub %ecx,%eax 0.00 : 4904ab: 01 d1 add %edx,%ecx 0.00 : 4904ad: c1 ce 10 ror $0x10,%esi 0.00 : 4904b0: 31 c6 xor %eax,%esi 0.00 : 4904b2: 89 f0 mov %esi,%eax 25.00 : 4904b4: 29 f2 sub %esi,%edx 0.00 : 4904b6: 44 8d 0c 0e lea (%rsi,%rcx,1),%r9d 0.00 : 4904ba: c1 c8 0d ror $0xd,%eax 0.00 : 4904bd: 31 d0 xor %edx,%eax 0.00 : 4904bf: 41 89 c0 mov %eax,%r8d 0.00 : 4904c2: 29 c1 sub %eax,%ecx 0.00 : 4904c4: 41 c1 c8 1c ror $0x1c,%r8d 0.00 : 4904c8: 41 31 c8 xor %ecx,%r8d : { : /* Code path for aligned source data */ : register const uint32 *ka = (const uint32 *) k; : : /* handle most of the key */ : while (len >= 12) 0.00 : 4904cb: 41 83 fa 0b cmp $0xb,%r10d : { : a += ka[0]; : b += ka[1]; : c += ka[2]; : mix(a, b, c); 0.00 : 4904cf: 42 8d 0c 08 lea (%rax,%r9,1),%ecx : { : /* Code path for aligned source data */ : register const uint32 *ka = (const uint32 *) k; : : /* handle most of the key */ : while (len >= 12) 0.00 : 4904d3: 77 9b ja 490470 0.00 : 4904d5: 45 89 cb mov %r9d,%r11d 0.00 : 4904d8: 89 ce mov %ecx,%esi 0.00 : 4904da: 44 89 c3 mov %r8d,%ebx : case 1: : a += ((uint32) k[0] << 24); : /* case 0: nothing left to add */ : } : #else /* !WORDS_BIGENDIAN */ : switch (len) 0.00 : 4904dd: 41 83 fa 0b cmp $0xb,%r10d 0.00 : 4904e1: 77 6e ja 490551 0.00 : 4904e3: 44 89 d0 mov %r10d,%eax 0.00 : 4904e6: ff 24 c5 78 22 7b 00 jmpq *0x7b2278(,%rax,8) : } : #else /* !WORDS_BIGENDIAN */ : switch (len) /* all the case statements fall through */ : { : case 11: : c += ((uint32) k[10] << 24); 0.00 : 4904ed: 0f b6 47 0a movzbl 0xa(%rdi),%eax 0.00 : 4904f1: c1 e0 18 shl $0x18,%eax 0.00 : 4904f4: 42 8d 1c 00 lea (%rax,%r8,1),%ebx : case 10: : c += ((uint32) k[9] << 16); 0.00 : 4904f8: 0f b6 47 09 movzbl 0x9(%rdi),%eax 0.00 : 4904fc: c1 e0 10 shl $0x10,%eax 0.00 : 4904ff: 01 c3 add %eax,%ebx : case 9: : c += ((uint32) k[8] << 8); 0.00 : 490501: 0f b6 47 08 movzbl 0x8(%rdi),%eax 0.00 : 490505: c1 e0 08 shl $0x8,%eax 0.00 : 490508: 01 c3 add %eax,%ebx : /* the lowest byte of c is reserved for the length */ : case 8: : b += ((uint32) k[7] << 24); 0.00 : 49050a: 0f b6 47 07 movzbl 0x7(%rdi),%eax 0.00 : 49050e: c1 e0 18 shl $0x18,%eax 0.00 : 490511: 8d 34 10 lea (%rax,%rdx,1),%esi : case 7: : b += ((uint32) k[6] << 16); 0.00 : 490514: 0f b6 47 06 movzbl 0x6(%rdi),%eax 0.00 : 490518: c1 e0 10 shl $0x10,%eax 0.00 : 49051b: 01 c6 add %eax,%esi : case 6: : b += ((uint32) k[5] << 8); 0.00 : 49051d: 0f b6 47 05 movzbl 0x5(%rdi),%eax 0.00 : 490521: c1 e0 08 shl $0x8,%eax 0.00 : 490524: 01 c6 add %eax,%esi : case 5: : b += k[4]; 0.00 : 490526: 0f b6 47 04 movzbl 0x4(%rdi),%eax 0.00 : 49052a: 01 c6 add %eax,%esi : case 4: : a += ((uint32) k[3] << 24); 0.00 : 49052c: 0f b6 47 03 movzbl 0x3(%rdi),%eax 0.00 : 490530: c1 e0 18 shl $0x18,%eax 0.00 : 490533: 46 8d 1c 08 lea (%rax,%r9,1),%r11d : case 3: : a += ((uint32) k[2] << 16); 0.00 : 490537: 0f b6 47 02 movzbl 0x2(%rdi),%eax 0.00 : 49053b: c1 e0 10 shl $0x10,%eax 0.00 : 49053e: 41 01 c3 add %eax,%r11d : case 2: : a += ((uint32) k[1] << 8); 0.00 : 490541: 0f b6 47 01 movzbl 0x1(%rdi),%eax 0.00 : 490545: c1 e0 08 shl $0x8,%eax 0.00 : 490548: 41 01 c3 add %eax,%r11d : case 1: : a += k[0]; 0.00 : 49054b: 0f b6 07 movzbl (%rdi),%eax 0.00 : 49054e: 41 01 c3 add %eax,%r11d : /* case 0: nothing left to add */ : } : #endif /* WORDS_BIGENDIAN */ : } : : final(a, b, c); 0.00 : 490551: 89 da mov %ebx,%edx 0.00 : 490553: 89 f0 mov %esi,%eax 0.00 : 490555: 31 f2 xor %esi,%edx 0.00 : 490557: c1 c8 12 ror $0x12,%eax 0.00 : 49055a: 29 c2 sub %eax,%edx 0.00 : 49055c: 89 d1 mov %edx,%ecx 0.00 : 49055e: 89 d0 mov %edx,%eax 0.00 : 490560: c1 c8 15 ror $0x15,%eax /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:496 25.00 : 490563: 44 31 d9 xor %r11d,%ecx 0.00 : 490566: 29 c1 sub %eax,%ecx 0.00 : 490568: 89 c8 mov %ecx,%eax 0.00 : 49056a: 31 ce xor %ecx,%esi 0.00 : 49056c: c1 c8 07 ror $0x7,%eax 0.00 : 49056f: 29 c6 sub %eax,%esi 0.00 : 490571: 89 f0 mov %esi,%eax 0.00 : 490573: 31 d0 xor %edx,%eax 0.00 : 490575: 89 f2 mov %esi,%edx 0.00 : 490577: c1 ca 10 ror $0x10,%edx 0.00 : 49057a: 29 d0 sub %edx,%eax 0.00 : 49057c: 89 c2 mov %eax,%edx 0.00 : 49057e: 31 ca xor %ecx,%edx 0.00 : 490580: 89 c1 mov %eax,%ecx 0.00 : 490582: c1 c9 1c ror $0x1c,%ecx 0.00 : 490585: 29 ca sub %ecx,%edx 0.00 : 490587: 89 d1 mov %edx,%ecx 0.00 : 490589: c1 ca 12 ror $0x12,%edx 0.00 : 49058c: 31 f1 xor %esi,%ecx 0.00 : 49058e: 29 d1 sub %edx,%ecx 0.00 : 490590: 31 c8 xor %ecx,%eax 0.00 : 490592: c1 c9 08 ror $0x8,%ecx 0.00 : 490595: 29 c8 sub %ecx,%eax : : /* report the result */ : return UInt32GetDatum(c); : } 0.00 : 490597: 5b pop %rbx 0.00 : 490598: c9 leaveq 0.00 : 490599: c3 retq : case 8: : b += ka[1]; : a += ka[0]; : break; : case 7: : b += ((uint32) k[6] << 16); 0.00 : 49059a: 0f b6 47 06 movzbl 0x6(%rdi),%eax 0.00 : 49059e: c1 e0 10 shl $0x10,%eax 0.00 : 4905a1: 8d 34 08 lea (%rax,%rcx,1),%esi : /* fall through */ : case 6: : b += ((uint32) k[5] << 8); 0.00 : 4905a4: 0f b6 47 05 movzbl 0x5(%rdi),%eax 0.00 : 4905a8: c1 e0 08 shl $0x8,%eax 0.00 : 4905ab: 01 c6 add %eax,%esi : /* fall through */ : case 5: : b += k[4]; 0.00 : 4905ad: 0f b6 47 04 movzbl 0x4(%rdi),%eax 0.00 : 4905b1: 01 c6 add %eax,%esi : /* fall through */ : case 4: : a += ka[0]; 0.00 : 4905b3: 45 89 cb mov %r9d,%r11d 0.00 : 4905b6: 44 03 1f add (%rdi),%r11d : break; 0.00 : 4905b9: eb 96 jmp 490551 : } : #else /* !WORDS_BIGENDIAN */ : switch (len) : { : case 11: : c += ((uint32) k[10] << 24); 0.00 : 4905bb: 0f b6 47 0a movzbl 0xa(%rdi),%eax 0.00 : 4905bf: c1 e0 18 shl $0x18,%eax 0.00 : 4905c2: 42 8d 1c 00 lea (%rax,%r8,1),%ebx : /* fall through */ : case 10: : c += ((uint32) k[9] << 16); 0.00 : 4905c6: 0f b6 47 09 movzbl 0x9(%rdi),%eax 0.00 : 4905ca: c1 e0 10 shl $0x10,%eax 0.00 : 4905cd: 01 c3 add %eax,%ebx : /* fall through */ : case 9: : c += ((uint32) k[8] << 8); 0.00 : 4905cf: 0f b6 47 08 movzbl 0x8(%rdi),%eax 0.00 : 4905d3: c1 e0 08 shl $0x8,%eax 0.00 : 4905d6: 01 c3 add %eax,%ebx : /* the lowest byte of c is reserved for the length */ : /* fall through */ : case 8: : b += ka[1]; 0.00 : 4905d8: 89 ce mov %ecx,%esi : a += ka[0]; 0.00 : 4905da: 45 89 cb mov %r9d,%r11d : case 9: : c += ((uint32) k[8] << 8); : /* the lowest byte of c is reserved for the length */ : /* fall through */ : case 8: : b += ka[1]; 0.00 : 4905dd: 03 77 04 add 0x4(%rdi),%esi : a += ka[0]; 0.00 : 4905e0: 44 03 1f add (%rdi),%r11d : break; 0.00 : 4905e3: e9 69 ff ff ff jmpq 490551 : { : /* Code path for aligned source data */ : register const uint32 *ka = (const uint32 *) k; : : /* handle most of the key */ : while (len >= 12) 0.00 : 4905e8: 45 89 c3 mov %r8d,%r11d 0.00 : 4905eb: 44 89 c6 mov %r8d,%esi 0.00 : 4905ee: 44 89 c3 mov %r8d,%ebx 0.00 : 4905f1: e9 e7 fe ff ff jmpq 4904dd : else : { : /* Code path for non-aligned source data */ : : /* handle most of the key */ : while (len >= 12) 0.00 : 4905f6: 45 89 c3 mov %r8d,%r11d 0.00 : 4905f9: 44 89 c6 mov %r8d,%esi 0.00 : 4905fc: 44 89 c3 mov %r8d,%ebx 0.00 : 4905ff: e9 42 fe ff ff jmpq 490446 : /* fall through */ : case 4: : a += ka[0]; : break; : case 3: : a += ((uint32) k[2] << 16); 0.00 : 490604: 0f b6 47 02 movzbl 0x2(%rdi),%eax 0.00 : 490608: c1 e0 10 shl $0x10,%eax 0.00 : 49060b: 46 8d 1c 08 lea (%rax,%r9,1),%r11d 0.00 : 49060f: e9 2d ff ff ff jmpq 490541 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:48 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000004906f0 : : return hash_uint32((int32) PG_GETARG_INT16(0)); : } : : Datum : hashint4(PG_FUNCTION_ARGS) : { 0.00 : 4906f0: 55 push %rbp : return hash_uint32(PG_GETARG_INT32(0)); 0.00 : 4906f1: 48 8b 7f 20 mov 0x20(%rdi),%rdi : return hash_uint32((int32) PG_GETARG_INT16(0)); : } : : Datum : hashint4(PG_FUNCTION_ARGS) : { 0.00 : 4906f5: 48 89 e5 mov %rsp,%rbp : return hash_uint32(PG_GETARG_INT32(0)); : } 0.00 : 4906f8: c9 leaveq : } : : Datum : hashint4(PG_FUNCTION_ARGS) : { : return hash_uint32(PG_GETARG_INT32(0)); /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:48 100.00 : 4906f9: e9 62 ff ff ff jmpq 490660 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:359 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:356 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:364 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005ac4a0 : : TupleTableSlot * : ExecProcNode(PlanState *node) : { : TupleTableSlot *result; : : CHECK_FOR_INTERRUPTS(); 0.00 : 5ac4a0: 0f b6 05 e9 db 60 00 movzbl 0x60dbe9(%rip),%eax # bba090 : * Execute the given node to return a(nother) tuple. : * ---------------------------------------------------------------- : */ : TupleTableSlot * : ExecProcNode(PlanState *node) : { 0.00 : 5ac4a7: 55 push %rbp 0.00 : 5ac4a8: 48 89 e5 mov %rsp,%rbp /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:356 25.00 : 5ac4ab: 41 54 push %r12 0.00 : 5ac4ad: 49 89 fc mov %rdi,%r12 : TupleTableSlot *result; : : CHECK_FOR_INTERRUPTS(); 0.00 : 5ac4b0: 84 c0 test %al,%al : * Execute the given node to return a(nother) tuple. : * ---------------------------------------------------------------- : */ : TupleTableSlot * : ExecProcNode(PlanState *node) : { 0.00 : 5ac4b2: 53 push %rbx : TupleTableSlot *result; : : CHECK_FOR_INTERRUPTS(); /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:359 50.00 : 5ac4b3: 75 6b jne 5ac520 : : if (node->chgParam != NULL) /* something changed */ 0.00 : 5ac4b5: 49 83 7c 24 50 00 cmpq $0x0,0x50(%r12) 0.00 : 5ac4bb: 74 08 je 5ac4c5 : ExecReScan(node); /* let ReScan handle this */ 0.00 : 5ac4bd: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac4c0: e8 db bf ff ff callq 5a84a0 : : if (node->instrument) 0.00 : 5ac4c5: 49 8b 7c 24 18 mov 0x18(%r12),%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:364 25.00 : 5ac4ca: 48 85 ff test %rdi,%rdi 0.00 : 5ac4cd: 74 05 je 5ac4d4 : InstrStartNode(node->instrument); 0.00 : 5ac4cf: e8 2c ba 00 00 callq 5b7f00 : : switch (nodeTag(node)) 0.00 : 5ac4d4: 41 8b 04 24 mov (%r12),%eax 0.00 : 5ac4d8: 2d c9 00 00 00 sub $0xc9,%eax 0.00 : 5ac4dd: 83 f8 21 cmp $0x21,%eax 0.00 : 5ac4e0: 76 2e jbe 5ac510 : case T_LimitState: : result = ExecLimit((LimitState *) node); : break; : : default: : elog(ERROR, "unrecognized node type: %d", (int) nodeTag(node)); 0.00 : 5ac4e2: ba e2 a3 88 00 mov $0x88a3e2,%edx 0.00 : 5ac4e7: be f8 01 00 00 mov $0x1f8,%esi 0.00 : 5ac4ec: bf 75 a0 88 00 mov $0x88a075,%edi 0.00 : 5ac4f1: e8 2a ef 1c 00 callq 77b420 0.00 : 5ac4f6: 41 8b 14 24 mov (%r12),%edx 0.00 : 5ac4fa: be 5c 17 87 00 mov $0x87175c,%esi 0.00 : 5ac4ff: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5ac504: 31 c0 xor %eax,%eax 0.00 : 5ac506: e8 25 ed 1c 00 callq 77b230 0.00 : 5ac50b: e8 c0 cf eb ff callq 4694d0 : ExecReScan(node); /* let ReScan handle this */ : : if (node->instrument) : InstrStartNode(node->instrument); : : switch (nodeTag(node)) 0.00 : 5ac510: 89 c0 mov %eax,%eax 0.00 : 5ac512: ff 24 c5 a0 a1 88 00 jmpq *0x88a1a0(,%rax,8) 0.00 : 5ac519: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : TupleTableSlot * : ExecProcNode(PlanState *node) : { : TupleTableSlot *result; : : CHECK_FOR_INTERRUPTS(); 0.00 : 5ac520: e8 7b fd 0e 00 callq 69c2a0 0.00 : 5ac525: eb 8e jmp 5ac4b5 0.00 : 5ac527: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5ac52e: 00 00 : case T_LockRowsState: : result = ExecLockRows((LockRowsState *) node); : break; : : case T_LimitState: : result = ExecLimit((LimitState *) node); 0.00 : 5ac530: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac533: e8 a8 3c 01 00 callq 5c01e0 0.00 : 5ac538: 48 89 c3 mov %rax,%rbx 0.00 : 5ac53b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : elog(ERROR, "unrecognized node type: %d", (int) nodeTag(node)); : result = NULL; : break; : } : : if (node->instrument) 0.00 : 5ac540: 49 8b 7c 24 18 mov 0x18(%r12),%rdi 0.00 : 5ac545: 48 85 ff test %rdi,%rdi 0.00 : 5ac548: 74 20 je 5ac56a : InstrStopNode(node->instrument, TupIsNull(result) ? 0.0 : 1.0); 0.00 : 5ac54a: 48 85 db test %rbx,%rbx 0.00 : 5ac54d: 0f 84 ed 01 00 00 je 5ac740 0.00 : 5ac553: 80 7b 04 00 cmpb $0x0,0x4(%rbx) 0.00 : 5ac557: 0f 85 e3 01 00 00 jne 5ac740 0.00 : 5ac55d: f2 0f 10 05 f3 2b 20 movsd 0x202bf3(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 5ac564: 00 0.00 : 5ac565: e8 66 b6 00 00 callq 5b7bd0 : : return result; : } 0.00 : 5ac56a: 48 89 d8 mov %rbx,%rax 0.00 : 5ac56d: 5b pop %rbx 0.00 : 5ac56e: 41 5c pop %r12 0.00 : 5ac570: c9 leaveq 0.00 : 5ac571: c3 retq 0.00 : 5ac572: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : case T_SetOpState: : result = ExecSetOp((SetOpState *) node); : break; : : case T_LockRowsState: : result = ExecLockRows((LockRowsState *) node); 0.00 : 5ac578: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac57b: e8 a0 40 01 00 callq 5c0620 0.00 : 5ac580: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac583: eb bb jmp 5ac540 0.00 : 5ac585: 0f 1f 00 nopl (%rax) : case T_HashState: : result = ExecHash((HashState *) node); : break; : : case T_SetOpState: : result = ExecSetOp((SetOpState *) node); 0.00 : 5ac588: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac58b: e8 60 98 01 00 callq 5c5df0 0.00 : 5ac590: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac593: eb ab jmp 5ac540 0.00 : 5ac595: 0f 1f 00 nopl (%rax) : case T_UniqueState: : result = ExecUnique((UniqueState *) node); : break; : : case T_HashState: : result = ExecHash((HashState *) node); 0.00 : 5ac598: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac59b: e8 d0 02 01 00 callq 5bc870 0.00 : 5ac5a0: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac5a3: eb 9b jmp 5ac540 0.00 : 5ac5a5: 0f 1f 00 nopl (%rax) : case T_WindowAggState: : result = ExecWindowAgg((WindowAggState *) node); : break; : : case T_UniqueState: : result = ExecUnique((UniqueState *) node); 0.00 : 5ac5a8: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac5ab: e8 20 a0 01 00 callq 5c65d0 0.00 : 5ac5b0: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac5b3: eb 8b jmp 5ac540 0.00 : 5ac5b5: 0f 1f 00 nopl (%rax) : case T_AggState: : result = ExecAgg((AggState *) node); : break; : : case T_WindowAggState: : result = ExecWindowAgg((WindowAggState *) node); 0.00 : 5ac5b8: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac5bb: e8 90 00 02 00 callq 5cc650 0.00 : 5ac5c0: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac5c3: e9 78 ff ff ff jmpq 5ac540 0.00 : 5ac5c8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5ac5cf: 00 : case T_GroupState: : result = ExecGroup((GroupState *) node); : break; : : case T_AggState: : result = ExecAgg((AggState *) node); 0.00 : 5ac5d0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac5d3: e8 a8 d7 00 00 callq 5b9d80 0.00 : 5ac5d8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac5db: e9 60 ff ff ff jmpq 5ac540 : case T_SortState: : result = ExecSort((SortState *) node); : break; : : case T_GroupState: : result = ExecGroup((GroupState *) node); 0.00 : 5ac5e0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac5e3: e8 88 ab 01 00 callq 5c7170 0.00 : 5ac5e8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac5eb: e9 50 ff ff ff jmpq 5ac540 : case T_MaterialState: : result = ExecMaterial((MaterialState *) node); : break; : : case T_SortState: : result = ExecSort((SortState *) node); 0.00 : 5ac5f0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac5f3: e8 48 9d 01 00 callq 5c6340 0.00 : 5ac5f8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac5fb: e9 40 ff ff ff jmpq 5ac540 : : /* : * materialization nodes : */ : case T_MaterialState: : result = ExecMaterial((MaterialState *) node); 0.00 : 5ac600: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac603: e8 38 47 01 00 callq 5c0d40 0.00 : 5ac608: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac60b: e9 30 ff ff ff jmpq 5ac540 : case T_MergeJoinState: : result = ExecMergeJoin((MergeJoinState *) node); : break; : : case T_HashJoinState: : result = ExecHashJoin((HashJoinState *) node); 0.00 : 5ac610: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac613: e8 88 14 01 00 callq 5bdaa0 0.00 : 5ac618: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac61b: e9 20 ff ff ff jmpq 5ac540 : case T_NestLoopState: : result = ExecNestLoop((NestLoopState *) node); : break; : : case T_MergeJoinState: : result = ExecMergeJoin((MergeJoinState *) node); 0.00 : 5ac620: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac623: e8 08 5a 01 00 callq 5c2030 0.00 : 5ac628: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac62b: e9 10 ff ff ff jmpq 5ac540 : : /* : * join nodes : */ : case T_NestLoopState: : result = ExecNestLoop((NestLoopState *) node); 0.00 : 5ac630: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac633: e8 08 7c 01 00 callq 5c4240 0.00 : 5ac638: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac63b: e9 00 ff ff ff jmpq 5ac540 : case T_WorkTableScanState: : result = ExecWorkTableScan((WorkTableScanState *) node); : break; : : case T_ForeignScanState: : result = ExecForeignScan((ForeignScanState *) node); 0.00 : 5ac640: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac643: e8 f8 d2 01 00 callq 5c9940 0.00 : 5ac648: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac64b: e9 f0 fe ff ff jmpq 5ac540 : case T_CteScanState: : result = ExecCteScan((CteScanState *) node); : break; : : case T_WorkTableScanState: : result = ExecWorkTableScan((WorkTableScanState *) node); 0.00 : 5ac650: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac653: e8 f8 a8 01 00 callq 5c6f50 0.00 : 5ac658: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac65b: e9 e0 fe ff ff jmpq 5ac540 : case T_ValuesScanState: : result = ExecValuesScan((ValuesScanState *) node); : break; : : case T_CteScanState: : result = ExecCteScan((CteScanState *) node); 0.00 : 5ac660: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac663: e8 28 a6 01 00 callq 5c6c90 0.00 : 5ac668: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac66b: e9 d0 fe ff ff jmpq 5ac540 : case T_FunctionScanState: : result = ExecFunctionScan((FunctionScanState *) node); : break; : : case T_ValuesScanState: : result = ExecValuesScan((ValuesScanState *) node); 0.00 : 5ac670: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac673: e8 18 a2 01 00 callq 5c6890 0.00 : 5ac678: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac67b: e9 c0 fe ff ff jmpq 5ac540 : case T_SubqueryScanState: : result = ExecSubqueryScan((SubqueryScanState *) node); : break; : : case T_FunctionScanState: : result = ExecFunctionScan((FunctionScanState *) node); 0.00 : 5ac680: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac683: e8 28 86 01 00 callq 5c4cb0 0.00 : 5ac688: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac68b: e9 b0 fe ff ff jmpq 5ac540 : case T_TidScanState: : result = ExecTidScan((TidScanState *) node); : break; : : case T_SubqueryScanState: : result = ExecSubqueryScan((SubqueryScanState *) node); 0.00 : 5ac690: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac693: e8 d8 c7 01 00 callq 5c8e70 0.00 : 5ac698: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac69b: e9 a0 fe ff ff jmpq 5ac540 : case T_BitmapHeapScanState: : result = ExecBitmapHeapScan((BitmapHeapScanState *) node); : break; : : case T_TidScanState: : result = ExecTidScan((TidScanState *) node); 0.00 : 5ac6a0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac6a3: e8 58 ca 01 00 callq 5c9100 0.00 : 5ac6a8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac6ab: e9 90 fe ff ff jmpq 5ac540 : break; : : /* BitmapIndexScanState does not yield tuples */ : : case T_BitmapHeapScanState: : result = ExecBitmapHeapScan((BitmapHeapScanState *) node); 0.00 : 5ac6b0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac6b3: e8 68 e8 00 00 callq 5baf20 0.00 : 5ac6b8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac6bb: e9 80 fe ff ff jmpq 5ac540 : case T_IndexScanState: : result = ExecIndexScan((IndexScanState *) node); : break; : : case T_IndexOnlyScanState: : result = ExecIndexOnlyScan((IndexOnlyScanState *) node); 0.00 : 5ac6c0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac6c3: e8 b8 33 01 00 callq 5bfa80 0.00 : 5ac6c8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac6cb: e9 70 fe ff ff jmpq 5ac540 : case T_SeqScanState: : result = ExecSeqScan((SeqScanState *) node); : break; : : case T_IndexScanState: : result = ExecIndexScan((IndexScanState *) node); 0.00 : 5ac6d0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac6d3: e8 08 2e 01 00 callq 5bf4e0 0.00 : 5ac6d8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac6db: e9 60 fe ff ff jmpq 5ac540 : : /* : * scan nodes : */ : case T_SeqScanState: : result = ExecSeqScan((SeqScanState *) node); 0.00 : 5ac6e0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac6e3: e8 28 92 01 00 callq 5c5910 0.00 : 5ac6e8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac6eb: e9 50 fe ff ff jmpq 5ac540 : case T_MergeAppendState: : result = ExecMergeAppend((MergeAppendState *) node); : break; : : case T_RecursiveUnionState: : result = ExecRecursiveUnion((RecursiveUnionState *) node); 0.00 : 5ac6f0: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac6f3: e8 d8 8b 01 00 callq 5c52d0 0.00 : 5ac6f8: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac6fb: e9 40 fe ff ff jmpq 5ac540 : case T_AppendState: : result = ExecAppend((AppendState *) node); : break; : : case T_MergeAppendState: : result = ExecMergeAppend((MergeAppendState *) node); 0.00 : 5ac700: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac703: e8 c8 48 01 00 callq 5c0fd0 0.00 : 5ac708: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac70b: e9 30 fe ff ff jmpq 5ac540 : case T_ModifyTableState: : result = ExecModifyTable((ModifyTableState *) node); : break; : : case T_AppendState: : result = ExecAppend((AppendState *) node); 0.00 : 5ac710: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac713: e8 68 ba 00 00 callq 5b8180 0.00 : 5ac718: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac71b: e9 20 fe ff ff jmpq 5ac540 : case T_ResultState: : result = ExecResult((ResultState *) node); : break; : : case T_ModifyTableState: : result = ExecModifyTable((ModifyTableState *) node); 0.00 : 5ac720: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac723: e8 d8 6a 01 00 callq 5c3200 0.00 : 5ac728: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac72b: e9 10 fe ff ff jmpq 5ac540 : { : /* : * control nodes : */ : case T_ResultState: : result = ExecResult((ResultState *) node); 0.00 : 5ac730: 4c 89 e7 mov %r12,%rdi 0.00 : 5ac733: e8 08 8f 01 00 callq 5c5640 0.00 : 5ac738: 48 89 c3 mov %rax,%rbx : break; 0.00 : 5ac73b: e9 00 fe ff ff jmpq 5ac540 : result = NULL; : break; : } : : if (node->instrument) : InstrStopNode(node->instrument, TupIsNull(result) ? 0.0 : 1.0); 0.00 : 5ac740: 66 0f 57 c0 xorpd %xmm0,%xmm0 0.00 : 5ac744: e9 1c fe ff ff jmpq 5ac565 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:687 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:698 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b3f50 : : * As above, the result must be treated as read-only. : * -------------------------------- : */ : MinimalTuple : ExecFetchSlotMinimalTuple(TupleTableSlot *slot) : { 0.00 : 5b3f50: 55 push %rbp 0.00 : 5b3f51: 48 89 e5 mov %rsp,%rbp 0.00 : 5b3f54: 4c 89 65 f8 mov %r12,-0x8(%rbp) 0.00 : 5b3f58: 48 89 5d f0 mov %rbx,-0x10(%rbp) 0.00 : 5b3f5c: 48 83 ec 10 sub $0x10,%rsp : Assert(!slot->tts_isempty); : : /* : * If we have a minimal physical tuple (local or not) then just return it. : */ : if (slot->tts_mintuple) 0.00 : 5b3f60: 48 8b 47 38 mov 0x38(%rdi),%rax : * As above, the result must be treated as read-only. : * -------------------------------- : */ : MinimalTuple : ExecFetchSlotMinimalTuple(TupleTableSlot *slot) : { 0.00 : 5b3f64: 49 89 fc mov %rdi,%r12 : Assert(!slot->tts_isempty); : : /* : * If we have a minimal physical tuple (local or not) then just return it. : */ : if (slot->tts_mintuple) 0.00 : 5b3f67: 48 85 c0 test %rax,%rax 0.00 : 5b3f6a: 74 14 je 5b3f80 : * in that at the moment, but if any materializes, we should change this : * function to force the slot into minimal-tuple-only state. : */ : : return slot->tts_mintuple; : } 0.00 : 5b3f6c: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 5b3f70: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:698 25.00 : 5b3f75: c9 leaveq 0.00 : 5b3f76: c3 retq 0.00 : 5b3f77: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5b3f7e: 00 00 : #endif /* !PG_USE_INLINE */ : #if defined(PG_USE_INLINE) || defined(MCXT_INCLUDE_DEFINITIONS) : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 25.00 : 5b3f80: 48 8b 1d d9 68 60 00 mov 0x6068d9(%rip),%rbx # bba860 : : CurrentMemoryContext = context; 0.00 : 5b3f87: 48 8b 47 18 mov 0x18(%rdi),%rax 0.00 : 5b3f8b: 48 89 05 ce 68 60 00 mov %rax,0x6068ce(%rip) # bba860 : * We may be called in a context that is shorter-lived than the tuple : * slot, but we have to ensure that the materialized tuple will survive : * anyway. : */ : oldContext = MemoryContextSwitchTo(slot->tts_mcxt); : slot->tts_mintuple = ExecCopySlotMinimalTuple(slot); 0.00 : 5b3f92: e8 69 ff ff ff callq 5b3f00 : slot->tts_shouldFreeMin = true; /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:687 50.00 : 5b3f97: 41 c6 44 24 06 01 movb $0x1,0x6(%r12) : * We may be called in a context that is shorter-lived than the tuple : * slot, but we have to ensure that the materialized tuple will survive : * anyway. : */ : oldContext = MemoryContextSwitchTo(slot->tts_mcxt); : slot->tts_mintuple = ExecCopySlotMinimalTuple(slot); 0.00 : 5b3f9d: 49 89 44 24 38 mov %rax,0x38(%r12) 0.00 : 5b3fa2: 48 89 1d b7 68 60 00 mov %rbx,0x6068b7(%rip) # bba860 : * attached to a virtual or non-local physical tuple. There seems no harm : * in that at the moment, but if any materializes, we should change this : * function to force the slot into minimal-tuple-only state. : */ : : return slot->tts_mintuple; 0.00 : 5b3fa9: 49 8b 44 24 38 mov 0x38(%r12),%rax : } 0.00 : 5b3fae: eb bc jmp 5b3f6c Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeBitmapHeapscan.c:260 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeBitmapHeapscan.c:264 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeBitmapHeapscan.c:131 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeBitmapHeapscan.c:360 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005baf80 : : * Retrieve next tuple from the BitmapHeapScan node's currentRelation : * ---------------------------------------------------------------- : */ : static TupleTableSlot * : BitmapHeapNext(BitmapHeapScanState *node) : { 0.00 : 5baf80: 55 push %rbp 0.00 : 5baf81: 48 89 e5 mov %rsp,%rbp 0.00 : 5baf84: 41 57 push %r15 0.00 : 5baf86: 41 56 push %r14 0.00 : 5baf88: 41 55 push %r13 0.00 : 5baf8a: 41 54 push %r12 0.00 : 5baf8c: 53 push %rbx 0.00 : 5baf8d: 48 89 fb mov %rdi,%rbx 0.00 : 5baf90: 48 81 ec d8 00 00 00 sub $0xd8,%rsp : TupleTableSlot *slot; : : /* : * extract necessary information from index scan node : */ : econtext = node->ss.ps.ps_ExprContext; 0.00 : 5baf97: 48 8b 47 60 mov 0x60(%rdi),%rax 0.00 : 5baf9b: 48 89 85 28 ff ff ff mov %rax,-0xd8(%rbp) : slot = node->ss.ss_ScanTupleSlot; 0.00 : 5bafa2: 48 8b 97 88 00 00 00 mov 0x88(%rdi),%rdx 0.00 : 5bafa9: 48 89 95 38 ff ff ff mov %rdx,-0xc8(%rbp) : scan = node->ss.ss_currentScanDesc; : tbm = node->tbm; : tbmiterator = node->tbmiterator; 0.00 : 5bafb0: 48 8b 8f a0 00 00 00 mov 0xa0(%rdi),%rcx : /* : * extract necessary information from index scan node : */ : econtext = node->ss.ps.ps_ExprContext; : slot = node->ss.ss_ScanTupleSlot; : scan = node->ss.ss_currentScanDesc; 0.00 : 5bafb7: 4c 8b a7 80 00 00 00 mov 0x80(%rdi),%r12 : tbm = node->tbm; : tbmiterator = node->tbmiterator; 0.00 : 5bafbe: 48 89 8d 30 ff ff ff mov %rcx,-0xd0(%rbp) : * desired prefetch distance, which starts small and increases up to the : * GUC-controlled maximum, target_prefetch_pages. This is to avoid doing : * a lot of prefetching in a scan that stops after a few tuples because of : * a LIMIT. : */ : if (tbm == NULL) 0.00 : 5bafc5: 48 83 bf 98 00 00 00 cmpq $0x0,0x98(%rdi) 0.00 : 5bafcc: 00 : econtext = node->ss.ps.ps_ExprContext; : slot = node->ss.ss_ScanTupleSlot; : scan = node->ss.ss_currentScanDesc; : tbm = node->tbm; : tbmiterator = node->tbmiterator; : tbmres = node->tbmres; 0.00 : 5bafcd: 48 8b 97 a8 00 00 00 mov 0xa8(%rdi),%rdx : #ifdef USE_PREFETCH : prefetch_iterator = node->prefetch_iterator; 0.00 : 5bafd4: 4c 8b bf c0 00 00 00 mov 0xc0(%rdi),%r15 : * desired prefetch distance, which starts small and increases up to the : * GUC-controlled maximum, target_prefetch_pages. This is to avoid doing : * a lot of prefetching in a scan that stops after a few tuples because of : * a LIMIT. : */ : if (tbm == NULL) 0.00 : 5bafdb: 0f 84 11 06 00 00 je 5bb5f2 : : /* : * Set up the result slot to point to this tuple. Note that the slot : * acquires a pin on the buffer. : */ : ExecStoreTuple(&scan->rs_ctup, 0.00 : 5bafe1: 49 8d 44 24 48 lea 0x48(%r12),%rax : ItemId lp; : : /* : * Get next page of results if needed : */ : if (tbmres == NULL) 0.00 : 5bafe6: 48 85 d2 test %rdx,%rdx : : /* : * Set up the result slot to point to this tuple. Note that the slot : * acquires a pin on the buffer. : */ : ExecStoreTuple(&scan->rs_ctup, 0.00 : 5bafe9: 48 89 85 20 ff ff ff mov %rax,-0xe0(%rbp) : ItemId lp; : : /* : * Get next page of results if needed : */ : if (tbmres == NULL) 0.00 : 5baff0: 0f 84 c4 01 00 00 je 5bb1ba 0.00 : 5baff6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 5baffd: 00 00 00 : else : { : /* : * Continuing in previously obtained page; advance rs_cindex : */ : scan->rs_cindex++; 0.00 : 5bb000: 41 83 44 24 70 01 addl $0x1,0x70(%r12) : : /* : * Try to prefetch at least a few pages even before we get to the : * second page if we don't stop reading after the first tuple. : */ : if (node->prefetch_target < target_prefetch_pages) 0.00 : 5bb006: 49 89 d5 mov %rdx,%r13 0.00 : 5bb009: 8b 83 cc 00 00 00 mov 0xcc(%rbx),%eax 0.00 : 5bb00f: 3b 05 4f 20 5c 00 cmp 0x5c204f(%rip),%eax # b7d064 0.00 : 5bb015: 7d 0c jge 5bb023 : node->prefetch_target++; 0.00 : 5bb017: 83 c0 01 add $0x1,%eax 0.00 : 5bb01a: 49 89 d5 mov %rdx,%r13 0.00 : 5bb01d: 89 83 cc 00 00 00 mov %eax,0xcc(%rbx) : } : : /* : * Out of range? If so, nothing more to look at on this page : */ : if (scan->rs_cindex < 0 || scan->rs_cindex >= scan->rs_ntuples) 0.00 : 5bb023: 41 8b 44 24 70 mov 0x70(%r12),%eax 0.00 : 5bb028: 85 c0 test %eax,%eax 0.00 : 5bb02a: 0f 88 e0 01 00 00 js 5bb210 0.00 : 5bb030: 41 3b 44 24 78 cmp 0x78(%r12),%eax 0.00 : 5bb035: 0f 8d d5 01 00 00 jge 5bb210 : * to avoid having prefetching interfere with the main I/O. Also, this : * should happen only when we have determined there is still something : * to do on the current page, else we may uselessly prefetch the same : * page we are just about to request for real. : */ : if (prefetch_iterator) 0.00 : 5bb03b: 4d 85 ff test %r15,%r15 0.00 : 5bb03e: 74 55 je 5bb095 : { : while (node->prefetch_pages < node->prefetch_target) 0.00 : 5bb040: 8b 83 cc 00 00 00 mov 0xcc(%rbx),%eax 0.00 : 5bb046: 3b 83 c8 00 00 00 cmp 0xc8(%rbx),%eax 0.00 : 5bb04c: 7f 24 jg 5bb072 0.00 : 5bb04e: eb 45 jmp 5bb095 : /* No more pages to prefetch */ : tbm_end_iterate(prefetch_iterator); : node->prefetch_iterator = prefetch_iterator = NULL; : break; : } : node->prefetch_pages++; 0.00 : 5bb050: 83 83 c8 00 00 00 01 addl $0x1,0xc8(%rbx) : PrefetchBuffer(scan->rs_rd, MAIN_FORKNUM, tbmpre->blockno); 0.00 : 5bb057: 31 f6 xor %esi,%esi 0.00 : 5bb059: 8b 10 mov (%rax),%edx 0.00 : 5bb05b: 49 8b 3c 24 mov (%r12),%rdi 0.00 : 5bb05f: e8 6c b7 0b 00 callq 6767d0 : * to do on the current page, else we may uselessly prefetch the same : * page we are just about to request for real. : */ : if (prefetch_iterator) : { : while (node->prefetch_pages < node->prefetch_target) 0.00 : 5bb064: 8b 83 c8 00 00 00 mov 0xc8(%rbx),%eax 0.00 : 5bb06a: 3b 83 cc 00 00 00 cmp 0xcc(%rbx),%eax 0.00 : 5bb070: 7d 23 jge 5bb095 : { : TBMIterateResult *tbmpre = tbm_iterate(prefetch_iterator); 0.00 : 5bb072: 4c 89 ff mov %r15,%rdi 0.00 : 5bb075: e8 d6 82 02 00 callq 5e3350 : : if (tbmpre == NULL) 0.00 : 5bb07a: 48 85 c0 test %rax,%rax 0.00 : 5bb07d: 75 d1 jne 5bb050 : { : /* No more pages to prefetch */ : tbm_end_iterate(prefetch_iterator); 0.00 : 5bb07f: 4c 89 ff mov %r15,%rdi : node->prefetch_iterator = prefetch_iterator = NULL; 0.00 : 5bb082: 45 31 ff xor %r15d,%r15d : TBMIterateResult *tbmpre = tbm_iterate(prefetch_iterator); : : if (tbmpre == NULL) : { : /* No more pages to prefetch */ : tbm_end_iterate(prefetch_iterator); 0.00 : 5bb085: e8 86 84 02 00 callq 5e3510 : node->prefetch_iterator = prefetch_iterator = NULL; 0.00 : 5bb08a: 48 c7 83 c0 00 00 00 movq $0x0,0xc0(%rbx) 0.00 : 5bb091: 00 00 00 00 : #endif /* USE_PREFETCH */ : : /* : * Okay to fetch the tuple : */ : targoffset = scan->rs_vistuples[scan->rs_cindex]; 0.00 : 5bb095: 49 63 44 24 70 movslq 0x70(%r12),%rax : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 5bb09a: 41 8b 74 24 64 mov 0x64(%r12),%esi /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeBitmapHeapscan.c:260 25.00 : 5bb09f: 85 f6 test %esi,%esi : #endif /* USE_PREFETCH */ : : /* : * Okay to fetch the tuple : */ : targoffset = scan->rs_vistuples[scan->rs_cindex]; 0.00 : 5bb0a1: 41 0f b7 7c 44 7c movzwl 0x7c(%r12,%rax,2),%edi : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 5bb0a7: 0f 88 73 01 00 00 js 5bb220 0.00 : 5bb0ad: 8d 46 ff lea -0x1(%rsi),%eax 0.00 : 5bb0b0: 48 63 c8 movslq %eax,%rcx 0.00 : 5bb0b3: 48 c1 e1 0d shl $0xd,%rcx 0.00 : 5bb0b7: 48 03 0d 3a 4a 60 00 add 0x604a3a(%rip),%rcx # bbfaf8 : lp = PageGetItemId(dp, targoffset); 0.00 : 5bb0be: 0f b7 d7 movzwl %di,%edx : Assert(ItemIdIsNormal(lp)); : : scan->rs_ctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); 0.00 : 5bb0c1: 48 83 c2 03 add $0x3,%rdx 0.00 : 5bb0c5: 0f b7 44 91 08 movzwl 0x8(%rcx,%rdx,4),%eax 0.00 : 5bb0ca: 25 ff 7f 00 00 and $0x7fff,%eax 0.00 : 5bb0cf: 48 8d 04 01 lea (%rcx,%rax,1),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeBitmapHeapscan.c:264 25.00 : 5bb0d3: 49 89 44 24 58 mov %rax,0x58(%r12) : scan->rs_ctup.t_len = ItemIdGetLength(lp); 0.00 : 5bb0d8: 0f b7 44 91 0a movzwl 0xa(%rcx,%rdx,4),%eax : scan->rs_ctup.t_tableOid = scan->rs_rd->rd_id; 0.00 : 5bb0dd: 49 8b 14 24 mov (%r12),%rdx : dp = (Page) BufferGetPage(scan->rs_cbuf); : lp = PageGetItemId(dp, targoffset); : Assert(ItemIdIsNormal(lp)); : : scan->rs_ctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); : scan->rs_ctup.t_len = ItemIdGetLength(lp); 0.00 : 5bb0e1: 66 d1 e8 shr %ax 0.00 : 5bb0e4: 0f b7 c0 movzwl %ax,%eax 0.00 : 5bb0e7: 41 89 44 24 48 mov %eax,0x48(%r12) : scan->rs_ctup.t_tableOid = scan->rs_rd->rd_id; 0.00 : 5bb0ec: 8b 42 40 mov 0x40(%rdx),%eax 0.00 : 5bb0ef: 41 89 44 24 54 mov %eax,0x54(%r12) : ItemPointerSet(&scan->rs_ctup.t_self, tbmres->blockno, targoffset); 0.00 : 5bb0f4: 41 8b 45 00 mov 0x0(%r13),%eax 0.00 : 5bb0f8: c1 e8 10 shr $0x10,%eax 0.00 : 5bb0fb: 66 41 89 44 24 4c mov %ax,0x4c(%r12) 0.00 : 5bb101: 41 8b 45 00 mov 0x0(%r13),%eax 0.00 : 5bb105: 66 41 89 7c 24 50 mov %di,0x50(%r12) 0.00 : 5bb10b: 66 41 89 44 24 4e mov %ax,0x4e(%r12) : : pgstat_count_heap_fetch(scan->rs_rd); 0.00 : 5bb111: 48 8b 82 38 01 00 00 mov 0x138(%rdx),%rax 0.00 : 5bb118: 48 85 c0 test %rax,%rax 0.00 : 5bb11b: 74 0a je 5bb127 0.00 : 5bb11d: 48 83 40 20 01 addq $0x1,0x20(%rax) 0.00 : 5bb122: 41 8b 74 24 64 mov 0x64(%r12),%esi : : /* : * Set up the result slot to point to this tuple. Note that the slot : * acquires a pin on the buffer. : */ : ExecStoreTuple(&scan->rs_ctup, 0.00 : 5bb127: 89 f2 mov %esi,%edx 0.00 : 5bb129: 48 8b bd 20 ff ff ff mov -0xe0(%rbp),%rdi 0.00 : 5bb130: 48 8b b5 38 ff ff ff mov -0xc8(%rbp),%rsi 0.00 : 5bb137: 31 c9 xor %ecx,%ecx 0.00 : 5bb139: e8 42 93 ff ff callq 5b4480 : : /* : * If we are using lossy info, we have to recheck the qual conditions : * at every tuple. : */ : if (tbmres->recheck) 0.00 : 5bb13e: 41 80 7d 08 00 cmpb $0x0,0x8(%r13) 0.00 : 5bb143: 0f 84 b1 02 00 00 je 5bb3fa : { : econtext->ecxt_scantuple = slot; 0.00 : 5bb149: 48 8b 95 28 ff ff ff mov -0xd8(%rbp),%rdx 0.00 : 5bb150: 48 8b 8d 38 ff ff ff mov -0xc8(%rbp),%rcx : ResetExprContext(econtext); 0.00 : 5bb157: 48 8b 7a 28 mov 0x28(%rdx),%rdi : * If we are using lossy info, we have to recheck the qual conditions : * at every tuple. : */ : if (tbmres->recheck) : { : econtext->ecxt_scantuple = slot; 0.00 : 5bb15b: 48 89 4a 08 mov %rcx,0x8(%rdx) : ResetExprContext(econtext); 0.00 : 5bb15f: e8 4c d8 1d 00 callq 7989b0 : : if (!ExecQual(node->bitmapqualorig, econtext, false)) 0.00 : 5bb164: 48 8b bb 90 00 00 00 mov 0x90(%rbx),%rdi 0.00 : 5bb16b: 48 8b b5 28 ff ff ff mov -0xd8(%rbp),%rsi 0.00 : 5bb172: 31 d2 xor %edx,%edx 0.00 : 5bb174: e8 97 1d ff ff callq 5acf10 0.00 : 5bb179: 84 c0 test %al,%al 0.00 : 5bb17b: 0f 85 79 02 00 00 jne 5bb3fa : { : /* Fails recheck, so drop it and loop back for another */ : InstrCountFiltered2(node, 1); 0.00 : 5bb181: 48 8b 43 18 mov 0x18(%rbx),%rax 0.00 : 5bb185: 48 85 c0 test %rax,%rax 0.00 : 5bb188: 74 18 je 5bb1a2 0.00 : 5bb18a: f2 0f 10 05 c6 3f 1f movsd 0x1f3fc6(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 5bb191: 00 0.00 : 5bb192: f2 0f 58 80 d0 00 00 addsd 0xd0(%rax),%xmm0 0.00 : 5bb199: 00 0.00 : 5bb19a: f2 0f 11 80 d0 00 00 movsd %xmm0,0xd0(%rax) 0.00 : 5bb1a1: 00 : ExecClearTuple(slot); 0.00 : 5bb1a2: 48 8b bd 38 ff ff ff mov -0xc8(%rbp),%rdi 0.00 : 5bb1a9: e8 62 8f ff ff callq 5b4110 : : /* : * Set up the result slot to point to this tuple. Note that the slot : * acquires a pin on the buffer. : */ : ExecStoreTuple(&scan->rs_ctup, 0.00 : 5bb1ae: 4c 89 ea mov %r13,%rdx : ItemId lp; : : /* : * Get next page of results if needed : */ : if (tbmres == NULL) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeBitmapHeapscan.c:131 25.00 : 5bb1b1: 48 85 d2 test %rdx,%rdx 0.00 : 5bb1b4: 0f 85 46 fe ff ff jne 5bb000 : { : node->tbmres = tbmres = tbm_iterate(tbmiterator); 0.00 : 5bb1ba: 48 8b bd 30 ff ff ff mov -0xd0(%rbp),%rdi 0.00 : 5bb1c1: e8 8a 81 02 00 callq 5e3350 : if (tbmres == NULL) 0.00 : 5bb1c6: 48 85 c0 test %rax,%rax : /* : * Get next page of results if needed : */ : if (tbmres == NULL) : { : node->tbmres = tbmres = tbm_iterate(tbmiterator); 0.00 : 5bb1c9: 49 89 c5 mov %rax,%r13 0.00 : 5bb1cc: 48 89 83 a8 00 00 00 mov %rax,0xa8(%rbx) : if (tbmres == NULL) 0.00 : 5bb1d3: 0f 84 0e 02 00 00 je 5bb3e7 : /* no more entries in the bitmap */ : break; : } : : #ifdef USE_PREFETCH : if (node->prefetch_pages > 0) 0.00 : 5bb1d9: 8b 83 c8 00 00 00 mov 0xc8(%rbx),%eax 0.00 : 5bb1df: 85 c0 test %eax,%eax 0.00 : 5bb1e1: 0f 8e ae 01 00 00 jle 5bb395 : { : /* The main iterator has closed the distance by one page */ : node->prefetch_pages--; 0.00 : 5bb1e7: 83 e8 01 sub $0x1,%eax 0.00 : 5bb1ea: 89 83 c8 00 00 00 mov %eax,0xc8(%rbx) 0.00 : 5bb1f0: 41 8b 55 00 mov 0x0(%r13),%edx 0.00 : 5bb1f4: 89 95 7c ff ff ff mov %edx,-0x84(%rbp) : * Ignore any claimed entries past what we think is the end of the : * relation. (This is probably not necessary given that we got at : * least AccessShareLock on the table before performing any of the : * indexscans, but let's be safe.) : */ : if (tbmres->blockno >= scan->rs_nblocks) 0.00 : 5bb1fa: 8b 85 7c ff ff ff mov -0x84(%rbp),%eax 0.00 : 5bb200: 41 39 44 24 28 cmp %eax,0x28(%r12) 0.00 : 5bb205: 77 2f ja 5bb236 0.00 : 5bb207: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5bb20e: 00 00 : /* : * Out of range? If so, nothing more to look at on this page : */ : if (scan->rs_cindex < 0 || scan->rs_cindex >= scan->rs_ntuples) : { : node->tbmres = tbmres = NULL; 0.00 : 5bb210: 48 c7 83 a8 00 00 00 movq $0x0,0xa8(%rbx) 0.00 : 5bb217: 00 00 00 00 0.00 : 5bb21b: 45 31 ed xor %r13d,%r13d : continue; 0.00 : 5bb21e: eb 8e jmp 5bb1ae : : /* : * Okay to fetch the tuple : */ : targoffset = scan->rs_vistuples[scan->rs_cindex]; : dp = (Page) BufferGetPage(scan->rs_cbuf); 0.00 : 5bb220: 89 f0 mov %esi,%eax 0.00 : 5bb222: 48 8b 15 ef 1e 5c 00 mov 0x5c1eef(%rip),%rdx # b7d118 0.00 : 5bb229: f7 d0 not %eax 0.00 : 5bb22b: 48 98 cltq 0.00 : 5bb22d: 48 8b 0c c2 mov (%rdx,%rax,8),%rcx 0.00 : 5bb231: e9 88 fe ff ff jmpq 5bb0be : /* : * Acquire pin on the target heap page, trading in any pin we held before. : */ : Assert(page < scan->rs_nblocks); : : scan->rs_cbuf = ReleaseAndReadBuffer(scan->rs_cbuf, 0.00 : 5bb236: 41 8b 7c 24 64 mov 0x64(%r12),%edi 0.00 : 5bb23b: 8b 95 7c ff ff ff mov -0x84(%rbp),%edx 0.00 : 5bb241: 49 8b 34 24 mov (%r12),%rsi 0.00 : 5bb245: e8 76 b4 0b 00 callq 6766c0 0.00 : 5bb24a: 89 85 78 ff ff ff mov %eax,-0x88(%rbp) : scan->rs_rd, : page); : buffer = scan->rs_cbuf; : snapshot = scan->rs_snapshot; 0.00 : 5bb250: 49 8b 54 24 08 mov 0x8(%r12),%rdx : ntup = 0; : : /* : * Prune and repair fragmentation for the whole page, if possible. : */ : heap_page_prune_opt(scan->rs_rd, buffer); 0.00 : 5bb255: 89 c6 mov %eax,%esi : /* : * Acquire pin on the target heap page, trading in any pin we held before. : */ : Assert(page < scan->rs_nblocks); : : scan->rs_cbuf = ReleaseAndReadBuffer(scan->rs_cbuf, 0.00 : 5bb257: 41 89 44 24 64 mov %eax,0x64(%r12) : scan->rs_rd, : page); : buffer = scan->rs_cbuf; : snapshot = scan->rs_snapshot; 0.00 : 5bb25c: 48 89 95 58 ff ff ff mov %rdx,-0xa8(%rbp) : ntup = 0; : : /* : * Prune and repair fragmentation for the whole page, if possible. : */ : heap_page_prune_opt(scan->rs_rd, buffer); 0.00 : 5bb263: 49 8b 3c 24 mov (%r12),%rdi 0.00 : 5bb267: e8 e4 43 ee ff callq 49f650 : /* : * We must hold share lock on the buffer content while examining tuple : * visibility. Afterwards, however, the tuples we have found to be : * visible are guaranteed good as long as we hold the buffer pin. : */ : LockBuffer(buffer, BUFFER_LOCK_SHARE); 0.00 : 5bb26c: 8b bd 78 ff ff ff mov -0x88(%rbp),%edi 0.00 : 5bb272: be 01 00 00 00 mov $0x1,%esi 0.00 : 5bb277: e8 94 94 0b 00 callq 674710 : : /* : * We need two separate strategies for lossy and non-lossy cases. : */ : if (tbmres->ntuples >= 0) 0.00 : 5bb27c: 41 83 7d 04 00 cmpl $0x0,0x4(%r13) 0.00 : 5bb281: 0f 8c 97 01 00 00 jl 5bb41e : * tbmres; but we have to follow any HOT chain starting at each such : * offset. : */ : int curslot; : : for (curslot = 0; curslot < tbmres->ntuples; curslot++) 0.00 : 5bb287: 0f 84 c1 01 00 00 je 5bb44e 0.00 : 5bb28d: 8b 8d 7c ff ff ff mov -0x84(%rbp),%ecx 0.00 : 5bb293: 0f b7 85 7c ff ff ff movzwl -0x84(%rbp),%eax 0.00 : 5bb29a: 45 31 f6 xor %r14d,%r14d 0.00 : 5bb29d: c7 85 54 ff ff ff 00 movl $0x0,-0xac(%rbp) 0.00 : 5bb2a4: 00 00 00 0.00 : 5bb2a7: c1 e9 10 shr $0x10,%ecx 0.00 : 5bb2aa: 66 89 4d 80 mov %cx,-0x80(%rbp) 0.00 : 5bb2ae: 66 89 45 9e mov %ax,-0x62(%rbp) 0.00 : 5bb2b2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : { : OffsetNumber offnum = tbmres->offsets[curslot]; 0.00 : 5bb2b8: 49 63 c6 movslq %r14d,%rax : ItemPointerData tid; : HeapTupleData heapTuple; : : ItemPointerSet(&tid, page, offnum); 0.00 : 5bb2bb: 0f b7 55 80 movzwl -0x80(%rbp),%edx 0.00 : 5bb2bf: 0f b7 4d 9e movzwl -0x62(%rbp),%ecx : */ : int curslot; : : for (curslot = 0; curslot < tbmres->ntuples; curslot++) : { : OffsetNumber offnum = tbmres->offsets[curslot]; 0.00 : 5bb2c3: 41 0f b7 44 45 0a movzwl 0xa(%r13,%rax,2),%eax : ItemPointerData tid; : HeapTupleData heapTuple; : : ItemPointerSet(&tid, page, offnum); : if (heap_hot_search_buffer(&tid, scan->rs_rd, buffer, snapshot, 0.00 : 5bb2c9: c7 04 24 01 00 00 00 movl $0x1,(%rsp) 0.00 : 5bb2d0: 4c 8d 45 a0 lea -0x60(%rbp),%r8 0.00 : 5bb2d4: 48 8d 7d c0 lea -0x40(%rbp),%rdi 0.00 : 5bb2d8: 45 31 c9 xor %r9d,%r9d : { : OffsetNumber offnum = tbmres->offsets[curslot]; : ItemPointerData tid; : HeapTupleData heapTuple; : : ItemPointerSet(&tid, page, offnum); 0.00 : 5bb2db: 66 89 55 c0 mov %dx,-0x40(%rbp) 0.00 : 5bb2df: 66 89 4d c2 mov %cx,-0x3e(%rbp) 0.00 : 5bb2e3: 66 89 45 c4 mov %ax,-0x3c(%rbp) : if (heap_hot_search_buffer(&tid, scan->rs_rd, buffer, snapshot, 0.00 : 5bb2e7: 48 8b 8d 58 ff ff ff mov -0xa8(%rbp),%rcx 0.00 : 5bb2ee: 8b 95 78 ff ff ff mov -0x88(%rbp),%edx 0.00 : 5bb2f4: 49 8b 34 24 mov (%r12),%rsi 0.00 : 5bb2f8: e8 23 1f ee ff callq 49d220 0.00 : 5bb2fd: 84 c0 test %al,%al 0.00 : 5bb2ff: 74 18 je 5bb319 : &heapTuple, NULL, true)) : scan->rs_vistuples[ntup++] = ItemPointerGetOffsetNumber(&tid); 0.00 : 5bb301: 48 63 95 54 ff ff ff movslq -0xac(%rbp),%rdx 0.00 : 5bb308: 0f b7 45 c4 movzwl -0x3c(%rbp),%eax 0.00 : 5bb30c: 66 41 89 44 54 7c mov %ax,0x7c(%r12,%rdx,2) 0.00 : 5bb312: 83 85 54 ff ff ff 01 addl $0x1,-0xac(%rbp) : * tbmres; but we have to follow any HOT chain starting at each such : * offset. : */ : int curslot; : : for (curslot = 0; curslot < tbmres->ntuples; curslot++) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeBitmapHeapscan.c:360 25.00 : 5bb319: 41 83 c6 01 add $0x1,%r14d 0.00 : 5bb31d: 45 3b 75 04 cmp 0x4(%r13),%r14d 0.00 : 5bb321: 7c 95 jl 5bb2b8 : CheckForSerializableConflictOut(valid, scan->rs_rd, &loctup, : buffer, snapshot); : } : } : : LockBuffer(buffer, BUFFER_LOCK_UNLOCK); 0.00 : 5bb323: 8b bd 78 ff ff ff mov -0x88(%rbp),%edi 0.00 : 5bb329: 31 f6 xor %esi,%esi 0.00 : 5bb32b: e8 e0 93 0b 00 callq 674710 : : Assert(ntup <= MaxHeapTuplesPerPage); : scan->rs_ntuples = ntup; 0.00 : 5bb330: 8b 85 54 ff ff ff mov -0xac(%rbp),%eax 0.00 : 5bb336: 41 89 44 24 78 mov %eax,0x78(%r12) : /* : * Fetch the current heap page and identify candidate tuples. : */ : bitgetpage(scan, tbmres); : : if (tbmres->ntuples >= 0) 0.00 : 5bb33b: 41 8b 45 04 mov 0x4(%r13),%eax 0.00 : 5bb33f: 85 c0 test %eax,%eax 0.00 : 5bb341: 0f 88 16 01 00 00 js 5bb45d : node->exact_pages++; 0.00 : 5bb347: 48 83 83 b0 00 00 00 addq $0x1,0xb0(%rbx) 0.00 : 5bb34e: 01 : node->lossy_pages++; : : /* : * Set rs_cindex to first slot to examine : */ : scan->rs_cindex = 0; 0.00 : 5bb34f: 41 c7 44 24 70 00 00 movl $0x0,0x70(%r12) 0.00 : 5bb356: 00 00 : * Increase prefetch target if it's not yet at the max. Note that : * we will increase it to zero after fetching the very first : * page/tuple, then to one after the second tuple is fetched, then : * it doubles as later pages are fetched. : */ : if (node->prefetch_target >= target_prefetch_pages) 0.00 : 5bb358: 8b 8b cc 00 00 00 mov 0xcc(%rbx),%ecx 0.00 : 5bb35e: 31 c0 xor %eax,%eax 0.00 : 5bb360: 8b 15 fe 1c 5c 00 mov 0x5c1cfe(%rip),%edx # b7d064 0.00 : 5bb366: 39 d1 cmp %edx,%ecx 0.00 : 5bb368: 0f 8d c2 fc ff ff jge 5bb030 : /* don't increase any further */ ; : else if (node->prefetch_target >= target_prefetch_pages / 2) 0.00 : 5bb36e: 89 d0 mov %edx,%eax 0.00 : 5bb370: c1 e8 1f shr $0x1f,%eax 0.00 : 5bb373: 01 d0 add %edx,%eax 0.00 : 5bb375: d1 f8 sar %eax 0.00 : 5bb377: 39 c1 cmp %eax,%ecx 0.00 : 5bb379: 0f 8d 94 00 00 00 jge 5bb413 : node->prefetch_target = target_prefetch_pages; : else if (node->prefetch_target > 0) 0.00 : 5bb37f: 85 c9 test %ecx,%ecx 0.00 : 5bb381: 0f 8e 5d 02 00 00 jle 5bb5e4 : node->prefetch_target *= 2; 0.00 : 5bb387: 8d 04 09 lea (%rcx,%rcx,1),%eax 0.00 : 5bb38a: 89 83 cc 00 00 00 mov %eax,0xcc(%rbx) 0.00 : 5bb390: e9 8e fc ff ff jmpq 5bb023 : if (node->prefetch_pages > 0) : { : /* The main iterator has closed the distance by one page */ : node->prefetch_pages--; : } : else if (prefetch_iterator) 0.00 : 5bb395: 4d 85 ff test %r15,%r15 0.00 : 5bb398: 0f 84 cc 00 00 00 je 5bb46a : { : /* Do not let the prefetch iterator get behind the main one */ : TBMIterateResult *tbmpre = tbm_iterate(prefetch_iterator); 0.00 : 5bb39e: 4c 89 ff mov %r15,%rdi 0.00 : 5bb3a1: e8 aa 7f 02 00 callq 5e3350 : : if (tbmpre == NULL || tbmpre->blockno != tbmres->blockno) 0.00 : 5bb3a6: 48 85 c0 test %rax,%rax 0.00 : 5bb3a9: 74 12 je 5bb3bd 0.00 : 5bb3ab: 8b 00 mov (%rax),%eax 0.00 : 5bb3ad: 89 85 7c ff ff ff mov %eax,-0x84(%rbp) 0.00 : 5bb3b3: 41 3b 45 00 cmp 0x0(%r13),%eax 0.00 : 5bb3b7: 0f 84 3d fe ff ff je 5bb1fa : elog(ERROR, "prefetch and main iterators are out of sync"); 0.00 : 5bb3bd: ba b4 b8 88 00 mov $0x88b8b4,%edx 0.00 : 5bb3c2: be 98 00 00 00 mov $0x98,%esi 0.00 : 5bb3c7: bf 72 b8 88 00 mov $0x88b872,%edi 0.00 : 5bb3cc: e8 4f 00 1c 00 callq 77b420 0.00 : 5bb3d1: be 88 b8 88 00 mov $0x88b888,%esi 0.00 : 5bb3d6: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5bb3db: 31 c0 xor %eax,%eax 0.00 : 5bb3dd: e8 4e fe 1b 00 callq 77b230 0.00 : 5bb3e2: e8 e9 e0 ea ff callq 4694d0 : } : : /* : * if we get here it means we are at the end of the scan.. : */ : return ExecClearTuple(slot); 0.00 : 5bb3e7: 48 8b bd 38 ff ff ff mov -0xc8(%rbp),%rdi 0.00 : 5bb3ee: e8 1d 8d ff ff callq 5b4110 0.00 : 5bb3f3: 48 89 85 38 ff ff ff mov %rax,-0xc8(%rbp) : } 0.00 : 5bb3fa: 48 8b 85 38 ff ff ff mov -0xc8(%rbp),%rax 0.00 : 5bb401: 48 81 c4 d8 00 00 00 add $0xd8,%rsp 0.00 : 5bb408: 5b pop %rbx 0.00 : 5bb409: 41 5c pop %r12 0.00 : 5bb40b: 41 5d pop %r13 0.00 : 5bb40d: 41 5e pop %r14 0.00 : 5bb40f: 41 5f pop %r15 0.00 : 5bb411: c9 leaveq 0.00 : 5bb412: c3 retq : * it doubles as later pages are fetched. : */ : if (node->prefetch_target >= target_prefetch_pages) : /* don't increase any further */ ; : else if (node->prefetch_target >= target_prefetch_pages / 2) : node->prefetch_target = target_prefetch_pages; 0.00 : 5bb413: 89 93 cc 00 00 00 mov %edx,0xcc(%rbx) 0.00 : 5bb419: e9 05 fc ff ff jmpq 5bb023 : { : /* : * Bitmap is lossy, so we must examine each item pointer on the page. : * But we can ignore HOT chains, since we'll check each tuple anyway. : */ : Page dp = (Page) BufferGetPage(buffer); 0.00 : 5bb41e: 8b 95 78 ff ff ff mov -0x88(%rbp),%edx 0.00 : 5bb424: 85 d2 test %edx,%edx 0.00 : 5bb426: 0f 88 9e 01 00 00 js 5bb5ca 0.00 : 5bb42c: 8b 85 78 ff ff ff mov -0x88(%rbp),%eax 0.00 : 5bb432: 83 e8 01 sub $0x1,%eax 0.00 : 5bb435: 4c 63 c8 movslq %eax,%r9 0.00 : 5bb438: 49 c1 e1 0d shl $0xd,%r9 0.00 : 5bb43c: 4c 03 0d b5 46 60 00 add 0x6046b5(%rip),%r9 # bbfaf8 : OffsetNumber maxoff = PageGetMaxOffsetNumber(dp); 0.00 : 5bb443: 41 0f b7 41 0c movzwl 0xc(%r9),%eax 0.00 : 5bb448: 66 83 f8 18 cmp $0x18,%ax 0.00 : 5bb44c: 77 2b ja 5bb479 : OffsetNumber offnum; : : for (offnum = FirstOffsetNumber; offnum <= maxoff; offnum = OffsetNumberNext(offnum)) 0.00 : 5bb44e: c7 85 54 ff ff ff 00 movl $0x0,-0xac(%rbp) 0.00 : 5bb455: 00 00 00 0.00 : 5bb458: e9 c6 fe ff ff jmpq 5bb323 : bitgetpage(scan, tbmres); : : if (tbmres->ntuples >= 0) : node->exact_pages++; : else : node->lossy_pages++; 0.00 : 5bb45d: 48 83 83 b8 00 00 00 addq $0x1,0xb8(%rbx) 0.00 : 5bb464: 01 0.00 : 5bb465: e9 e5 fe ff ff jmpq 5bb34f : { : /* Do not let the prefetch iterator get behind the main one */ : TBMIterateResult *tbmpre = tbm_iterate(prefetch_iterator); : : if (tbmpre == NULL || tbmpre->blockno != tbmres->blockno) : elog(ERROR, "prefetch and main iterators are out of sync"); 0.00 : 5bb46a: 41 8b 4d 00 mov 0x0(%r13),%ecx 0.00 : 5bb46e: 89 8d 7c ff ff ff mov %ecx,-0x84(%rbp) 0.00 : 5bb474: e9 81 fd ff ff jmpq 5bb1fa : /* : * Bitmap is lossy, so we must examine each item pointer on the page. : * But we can ignore HOT chains, since we'll check each tuple anyway. : */ : Page dp = (Page) BufferGetPage(buffer); : OffsetNumber maxoff = PageGetMaxOffsetNumber(dp); 0.00 : 5bb479: 0f b7 c0 movzwl %ax,%eax 0.00 : 5bb47c: 48 83 e8 18 sub $0x18,%rax 0.00 : 5bb480: 48 c1 e8 02 shr $0x2,%rax : OffsetNumber offnum; : : for (offnum = FirstOffsetNumber; offnum <= maxoff; offnum = OffsetNumberNext(offnum)) 0.00 : 5bb484: 66 85 c0 test %ax,%ax : /* : * Bitmap is lossy, so we must examine each item pointer on the page. : * But we can ignore HOT chains, since we'll check each tuple anyway. : */ : Page dp = (Page) BufferGetPage(buffer); : OffsetNumber maxoff = PageGetMaxOffsetNumber(dp); 0.00 : 5bb487: 66 89 85 40 ff ff ff mov %ax,-0xc0(%rbp) : OffsetNumber offnum; : : for (offnum = FirstOffsetNumber; offnum <= maxoff; offnum = OffsetNumberNext(offnum)) 0.00 : 5bb48e: 74 be je 5bb44e : if (!ItemIdIsNormal(lp)) : continue; : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); : loctup.t_len = ItemIdGetLength(lp); : loctup.t_tableOid = scan->rs_rd->rd_id; : ItemPointerSet(&loctup.t_self, page, offnum); 0.00 : 5bb490: 8b 85 7c ff ff ff mov -0x84(%rbp),%eax 0.00 : 5bb496: 41 be 01 00 00 00 mov $0x1,%r14d 0.00 : 5bb49c: c7 85 54 ff ff ff 00 movl $0x0,-0xac(%rbp) 0.00 : 5bb4a3: 00 00 00 0.00 : 5bb4a6: c1 e8 10 shr $0x10,%eax 0.00 : 5bb4a9: 66 89 85 60 ff ff ff mov %ax,-0xa0(%rbp) 0.00 : 5bb4b0: eb 18 jmp 5bb4ca 0.00 : 5bb4b2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : if (valid) : { : scan->rs_vistuples[ntup++] = offnum; : PredicateLockTuple(scan->rs_rd, &loctup, snapshot); : } : CheckForSerializableConflictOut(valid, scan->rs_rd, &loctup, 0.00 : 5bb4b8: 41 83 c6 01 add $0x1,%r14d : */ : Page dp = (Page) BufferGetPage(buffer); : OffsetNumber maxoff = PageGetMaxOffsetNumber(dp); : OffsetNumber offnum; : : for (offnum = FirstOffsetNumber; offnum <= maxoff; offnum = OffsetNumberNext(offnum)) 0.00 : 5bb4bc: 66 44 3b b5 40 ff ff cmp -0xc0(%rbp),%r14w 0.00 : 5bb4c3: ff 0.00 : 5bb4c4: 0f 87 59 fe ff ff ja 5bb323 : { : ItemId lp; : HeapTupleData loctup; : bool valid; : : lp = PageGetItemId(dp, offnum); 0.00 : 5bb4ca: 41 0f b7 c6 movzwl %r14w,%eax : if (!ItemIdIsNormal(lp)) 0.00 : 5bb4ce: 48 8d 50 03 lea 0x3(%rax),%rdx 0.00 : 5bb4d2: 41 8b 44 91 08 mov 0x8(%r9,%rdx,4),%eax 0.00 : 5bb4d7: 25 00 80 01 00 and $0x18000,%eax 0.00 : 5bb4dc: 3d 00 80 00 00 cmp $0x8000,%eax 0.00 : 5bb4e1: 75 d5 jne 5bb4b8 : continue; : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); 0.00 : 5bb4e3: 41 0f b7 44 91 08 movzwl 0x8(%r9,%rdx,4),%eax : loctup.t_len = ItemIdGetLength(lp); : loctup.t_tableOid = scan->rs_rd->rd_id; : ItemPointerSet(&loctup.t_self, page, offnum); 0.00 : 5bb4e9: 0f b7 8d 7c ff ff ff movzwl -0x84(%rbp),%ecx : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); 0.00 : 5bb4f0: 48 8d 7d a0 lea -0x60(%rbp),%rdi 0.00 : 5bb4f4: 48 8b b5 58 ff ff ff mov -0xa8(%rbp),%rsi : bool valid; : : lp = PageGetItemId(dp, offnum); : if (!ItemIdIsNormal(lp)) : continue; : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); 0.00 : 5bb4fb: 25 ff 7f 00 00 and $0x7fff,%eax 0.00 : 5bb500: 49 8d 04 01 lea (%r9,%rax,1),%rax 0.00 : 5bb504: 48 89 45 b0 mov %rax,-0x50(%rbp) : loctup.t_len = ItemIdGetLength(lp); 0.00 : 5bb508: 41 0f b7 44 91 0a movzwl 0xa(%r9,%rdx,4),%eax : loctup.t_tableOid = scan->rs_rd->rd_id; : ItemPointerSet(&loctup.t_self, page, offnum); 0.00 : 5bb50e: 0f b7 95 60 ff ff ff movzwl -0xa0(%rbp),%edx : : lp = PageGetItemId(dp, offnum); : if (!ItemIdIsNormal(lp)) : continue; : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); : loctup.t_len = ItemIdGetLength(lp); 0.00 : 5bb515: 66 d1 e8 shr %ax 0.00 : 5bb518: 0f b7 c0 movzwl %ax,%eax 0.00 : 5bb51b: 89 45 a0 mov %eax,-0x60(%rbp) : loctup.t_tableOid = scan->rs_rd->rd_id; 0.00 : 5bb51e: 49 8b 04 24 mov (%r12),%rax 0.00 : 5bb522: 8b 40 40 mov 0x40(%rax),%eax : ItemPointerSet(&loctup.t_self, page, offnum); 0.00 : 5bb525: 66 89 55 a4 mov %dx,-0x5c(%rbp) : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); 0.00 : 5bb529: 4c 89 8d 10 ff ff ff mov %r9,-0xf0(%rbp) : if (!ItemIdIsNormal(lp)) : continue; : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); : loctup.t_len = ItemIdGetLength(lp); : loctup.t_tableOid = scan->rs_rd->rd_id; : ItemPointerSet(&loctup.t_self, page, offnum); 0.00 : 5bb530: 66 89 4d a6 mov %cx,-0x5a(%rbp) 0.00 : 5bb534: 66 44 89 75 a8 mov %r14w,-0x58(%rbp) : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); 0.00 : 5bb539: 8b 95 78 ff ff ff mov -0x88(%rbp),%edx : lp = PageGetItemId(dp, offnum); : if (!ItemIdIsNormal(lp)) : continue; : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); : loctup.t_len = ItemIdGetLength(lp); : loctup.t_tableOid = scan->rs_rd->rd_id; 0.00 : 5bb53f: 89 45 ac mov %eax,-0x54(%rbp) : ItemPointerSet(&loctup.t_self, page, offnum); : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); 0.00 : 5bb542: ff 16 callq *(%rsi) : if (valid) 0.00 : 5bb544: 84 c0 test %al,%al : continue; : loctup.t_data = (HeapTupleHeader) PageGetItem((Page) dp, lp); : loctup.t_len = ItemIdGetLength(lp); : loctup.t_tableOid = scan->rs_rd->rd_id; : ItemPointerSet(&loctup.t_self, page, offnum); : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); 0.00 : 5bb546: 41 89 c0 mov %eax,%r8d : if (valid) 0.00 : 5bb549: 4c 8b 8d 10 ff ff ff mov -0xf0(%rbp),%r9 0.00 : 5bb550: 75 31 jne 5bb583 : { : scan->rs_vistuples[ntup++] = offnum; : PredicateLockTuple(scan->rs_rd, &loctup, snapshot); : } : CheckForSerializableConflictOut(valid, scan->rs_rd, &loctup, 0.00 : 5bb552: 41 0f be f8 movsbl %r8b,%edi 0.00 : 5bb556: 49 8b 34 24 mov (%r12),%rsi 0.00 : 5bb55a: 4c 8b 85 58 ff ff ff mov -0xa8(%rbp),%r8 0.00 : 5bb561: 8b 8d 78 ff ff ff mov -0x88(%rbp),%ecx 0.00 : 5bb567: 48 8d 55 a0 lea -0x60(%rbp),%rdx 0.00 : 5bb56b: 4c 89 8d 10 ff ff ff mov %r9,-0xf0(%rbp) 0.00 : 5bb572: e8 e9 90 0d 00 callq 694660 0.00 : 5bb577: 4c 8b 8d 10 ff ff ff mov -0xf0(%rbp),%r9 0.00 : 5bb57e: e9 35 ff ff ff jmpq 5bb4b8 : loctup.t_tableOid = scan->rs_rd->rd_id; : ItemPointerSet(&loctup.t_self, page, offnum); : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); : if (valid) : { : scan->rs_vistuples[ntup++] = offnum; 0.00 : 5bb583: 48 63 85 54 ff ff ff movslq -0xac(%rbp),%rax : PredicateLockTuple(scan->rs_rd, &loctup, snapshot); 0.00 : 5bb58a: 48 8d 75 a0 lea -0x60(%rbp),%rsi : loctup.t_tableOid = scan->rs_rd->rd_id; : ItemPointerSet(&loctup.t_self, page, offnum); : valid = HeapTupleSatisfiesVisibility(&loctup, snapshot, buffer); : if (valid) : { : scan->rs_vistuples[ntup++] = offnum; 0.00 : 5bb58e: 66 45 89 74 44 7c mov %r14w,0x7c(%r12,%rax,2) 0.00 : 5bb594: 83 85 54 ff ff ff 01 addl $0x1,-0xac(%rbp) : PredicateLockTuple(scan->rs_rd, &loctup, snapshot); 0.00 : 5bb59b: 49 8b 3c 24 mov (%r12),%rdi 0.00 : 5bb59f: 48 8b 95 58 ff ff ff mov -0xa8(%rbp),%rdx 0.00 : 5bb5a6: 44 88 85 18 ff ff ff mov %r8b,-0xe8(%rbp) 0.00 : 5bb5ad: 4c 89 8d 10 ff ff ff mov %r9,-0xf0(%rbp) 0.00 : 5bb5b4: e8 e7 95 0d 00 callq 694ba0 0.00 : 5bb5b9: 4c 8b 8d 10 ff ff ff mov -0xf0(%rbp),%r9 0.00 : 5bb5c0: 44 0f b6 85 18 ff ff movzbl -0xe8(%rbp),%r8d 0.00 : 5bb5c7: ff 0.00 : 5bb5c8: eb 88 jmp 5bb552 : { : /* : * Bitmap is lossy, so we must examine each item pointer on the page. : * But we can ignore HOT chains, since we'll check each tuple anyway. : */ : Page dp = (Page) BufferGetPage(buffer); 0.00 : 5bb5ca: 8b 85 78 ff ff ff mov -0x88(%rbp),%eax 0.00 : 5bb5d0: 48 8b 15 41 1b 5c 00 mov 0x5c1b41(%rip),%rdx # b7d118 0.00 : 5bb5d7: f7 d0 not %eax 0.00 : 5bb5d9: 48 98 cltq 0.00 : 5bb5db: 4c 8b 0c c2 mov (%rdx,%rax,8),%r9 0.00 : 5bb5df: e9 5f fe ff ff jmpq 5bb443 : else if (node->prefetch_target >= target_prefetch_pages / 2) : node->prefetch_target = target_prefetch_pages; : else if (node->prefetch_target > 0) : node->prefetch_target *= 2; : else : node->prefetch_target++; 0.00 : 5bb5e4: 8d 41 01 lea 0x1(%rcx),%eax 0.00 : 5bb5e7: 89 83 cc 00 00 00 mov %eax,0xcc(%rbx) 0.00 : 5bb5ed: e9 31 fa ff ff jmpq 5bb023 : * a lot of prefetching in a scan that stops after a few tuples because of : * a LIMIT. : */ : if (tbm == NULL) : { : tbm = (TIDBitmap *) MultiExecProcNode(outerPlanState(node)); 0.00 : 5bb5f2: 48 8b 7f 30 mov 0x30(%rdi),%rdi 0.00 : 5bb5f6: e8 d5 0d ff ff callq 5ac3d0 : : if (!tbm || !IsA(tbm, TIDBitmap)) 0.00 : 5bb5fb: 48 85 c0 test %rax,%rax : * a lot of prefetching in a scan that stops after a few tuples because of : * a LIMIT. : */ : if (tbm == NULL) : { : tbm = (TIDBitmap *) MultiExecProcNode(outerPlanState(node)); 0.00 : 5bb5fe: 49 89 c5 mov %rax,%r13 : : if (!tbm || !IsA(tbm, TIDBitmap)) 0.00 : 5bb601: 74 08 je 5bb60b 0.00 : 5bb603: 81 38 ba 03 00 00 cmpl $0x3ba,(%rax) 0.00 : 5bb609: 74 2a je 5bb635 : elog(ERROR, "unrecognized result from subplan"); 0.00 : 5bb60b: ba b4 b8 88 00 mov $0x88b8b4,%edx 0.00 : 5bb610: be 6b 00 00 00 mov $0x6b,%esi 0.00 : 5bb615: bf 72 b8 88 00 mov $0x88b872,%edi 0.00 : 5bb61a: e8 01 fe 1b 00 callq 77b420 0.00 : 5bb61f: be c0 b7 88 00 mov $0x88b7c0,%esi 0.00 : 5bb624: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5bb629: 31 c0 xor %eax,%eax 0.00 : 5bb62b: e8 00 fc 1b 00 callq 77b230 0.00 : 5bb630: e8 9b de ea ff callq 4694d0 : : node->tbm = tbm; 0.00 : 5bb635: 48 89 83 98 00 00 00 mov %rax,0x98(%rbx) : node->tbmiterator = tbmiterator = tbm_begin_iterate(tbm); 0.00 : 5bb63c: 48 89 c7 mov %rax,%rdi 0.00 : 5bb63f: e8 dc 7e 02 00 callq 5e3520 : node->tbmres = tbmres = NULL; 0.00 : 5bb644: 48 c7 83 a8 00 00 00 movq $0x0,0xa8(%rbx) 0.00 : 5bb64b: 00 00 00 00 : : if (!tbm || !IsA(tbm, TIDBitmap)) : elog(ERROR, "unrecognized result from subplan"); : : node->tbm = tbm; : node->tbmiterator = tbmiterator = tbm_begin_iterate(tbm); 0.00 : 5bb64f: 48 89 83 a0 00 00 00 mov %rax,0xa0(%rbx) : node->tbmres = tbmres = NULL; : : #ifdef USE_PREFETCH : if (target_prefetch_pages > 0) 0.00 : 5bb656: 31 d2 xor %edx,%edx 0.00 : 5bb658: 8b 0d 06 1a 5c 00 mov 0x5c1a06(%rip),%ecx # b7d064 : : if (!tbm || !IsA(tbm, TIDBitmap)) : elog(ERROR, "unrecognized result from subplan"); : : node->tbm = tbm; : node->tbmiterator = tbmiterator = tbm_begin_iterate(tbm); 0.00 : 5bb65e: 48 89 85 30 ff ff ff mov %rax,-0xd0(%rbp) : node->tbmres = tbmres = NULL; : : #ifdef USE_PREFETCH : if (target_prefetch_pages > 0) 0.00 : 5bb665: 85 c9 test %ecx,%ecx 0.00 : 5bb667: 0f 8e 74 f9 ff ff jle 5bafe1 : { : node->prefetch_iterator = prefetch_iterator = tbm_begin_iterate(tbm); 0.00 : 5bb66d: 4c 89 ef mov %r13,%rdi 0.00 : 5bb670: e8 ab 7e 02 00 callq 5e3520 : node->prefetch_pages = 0; 0.00 : 5bb675: c7 83 c8 00 00 00 00 movl $0x0,0xc8(%rbx) 0.00 : 5bb67c: 00 00 00 : node->tbmres = tbmres = NULL; : : #ifdef USE_PREFETCH : if (target_prefetch_pages > 0) : { : node->prefetch_iterator = prefetch_iterator = tbm_begin_iterate(tbm); 0.00 : 5bb67f: 49 89 c7 mov %rax,%r15 0.00 : 5bb682: 48 89 83 c0 00 00 00 mov %rax,0xc0(%rbx) : node->prefetch_pages = 0; : node->prefetch_target = -1; 0.00 : 5bb689: c7 83 cc 00 00 00 ff movl $0xffffffff,0xcc(%rbx) 0.00 : 5bb690: ff ff ff 0.00 : 5bb693: 31 d2 xor %edx,%edx 0.00 : 5bb695: e9 47 f9 ff ff jmpq 5bafe1 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 75.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1073 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1097 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bbda0 : : * for the latter. : */ : bool : ExecScanHashBucket(HashJoinState *hjstate, : ExprContext *econtext) : { 0.00 : 5bbda0: 55 push %rbp 0.00 : 5bbda1: 48 89 e5 mov %rsp,%rbp 0.00 : 5bbda4: 41 57 push %r15 0.00 : 5bbda6: 41 56 push %r14 0.00 : 5bbda8: 49 89 f6 mov %rsi,%r14 0.00 : 5bbdab: 41 55 push %r13 0.00 : 5bbdad: 41 54 push %r12 0.00 : 5bbdaf: 49 89 fc mov %rdi,%r12 0.00 : 5bbdb2: 53 push %rbx 0.00 : 5bbdb3: 48 83 ec 08 sub $0x8,%rsp : List *hjclauses = hjstate->hashclauses; : HashJoinTable hashtable = hjstate->hj_HashTable; : HashJoinTuple hashTuple = hjstate->hj_CurTuple; 0.00 : 5bbdb7: 48 8b 87 c0 00 00 00 mov 0xc0(%rdi),%rax : */ : bool : ExecScanHashBucket(HashJoinState *hjstate, : ExprContext *econtext) : { : List *hjclauses = hjstate->hashclauses; 0.00 : 5bbdbe: 4c 8b bf 88 00 00 00 mov 0x88(%rdi),%r15 : HashJoinTable hashtable = hjstate->hj_HashTable; 0.00 : 5bbdc5: 48 8b 8f a8 00 00 00 mov 0xa8(%rdi),%rcx : HashJoinTuple hashTuple = hjstate->hj_CurTuple; : uint32 hashvalue = hjstate->hj_CurHashValue; 0.00 : 5bbdcc: 44 8b af b0 00 00 00 mov 0xb0(%rdi),%r13d : * bucket, or NULL if it's time to start scanning a new bucket. : * : * If the tuple hashed to a skew bucket then scan the skew bucket : * otherwise scan the standard hashtable bucket. : */ : if (hashTuple != NULL) 0.00 : 5bbdd3: 48 85 c0 test %rax,%rax 0.00 : 5bbdd6: 74 79 je 5bbe51 : hashTuple = hashTuple->next; 0.00 : 5bbdd8: 48 8b 18 mov (%rax),%rbx 0.00 : 5bbddb: eb 06 jmp 5bbde3 0.00 : 5bbddd: 0f 1f 00 nopl (%rax) : hjstate->hj_CurTuple = hashTuple; : return true; : } : } : : hashTuple = hashTuple->next; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1097 25.00 : 5bbde0: 48 8b 1b mov (%rbx),%rbx : else if (hjstate->hj_CurSkewBucketNo != INVALID_SKEW_BUCKET_NO) : hashTuple = hashtable->skewBucket[hjstate->hj_CurSkewBucketNo]->tuples; : else : hashTuple = hashtable->buckets[hjstate->hj_CurBucketNo]; : : while (hashTuple != NULL) 0.00 : 5bbde3: 48 85 db test %rbx,%rbx 0.00 : 5bbde6: 74 58 je 5bbe40 : { : if (hashTuple->hashvalue == hashvalue) 0.00 : 5bbde8: 44 39 6b 08 cmp %r13d,0x8(%rbx) 0.00 : 5bbdec: 75 f2 jne 5bbde0 : { : TupleTableSlot *inntuple; : : /* insert hashtable's tuple into exec slot so ExecQual sees it */ : inntuple = ExecStoreMinimalTuple(HJTUPLE_MINTUPLE(hashTuple), 0.00 : 5bbdee: 49 8b b4 24 d0 00 00 mov 0xd0(%r12),%rsi 0.00 : 5bbdf5: 00 0.00 : 5bbdf6: 48 8d 7b 10 lea 0x10(%rbx),%rdi 0.00 : 5bbdfa: 31 d2 xor %edx,%edx 0.00 : 5bbdfc: e8 df 85 ff ff callq 5b43e0 : hjstate->hj_HashTupleSlot, : false); /* do not pfree */ : econtext->ecxt_innertuple = inntuple; : : /* reset temp memory each time to avoid leaks from qual expr */ : ResetExprContext(econtext); 0.00 : 5bbe01: 49 8b 7e 28 mov 0x28(%r14),%rdi : : /* insert hashtable's tuple into exec slot so ExecQual sees it */ : inntuple = ExecStoreMinimalTuple(HJTUPLE_MINTUPLE(hashTuple), : hjstate->hj_HashTupleSlot, : false); /* do not pfree */ : econtext->ecxt_innertuple = inntuple; 0.00 : 5bbe05: 49 89 46 10 mov %rax,0x10(%r14) : : /* reset temp memory each time to avoid leaks from qual expr */ : ResetExprContext(econtext); 0.00 : 5bbe09: e8 a2 cb 1d 00 callq 7989b0 : : if (ExecQual(hjclauses, econtext, false)) 0.00 : 5bbe0e: 31 d2 xor %edx,%edx 0.00 : 5bbe10: 4c 89 f6 mov %r14,%rsi 0.00 : 5bbe13: 4c 89 ff mov %r15,%rdi 0.00 : 5bbe16: e8 f5 10 ff ff callq 5acf10 0.00 : 5bbe1b: 84 c0 test %al,%al 0.00 : 5bbe1d: 74 c1 je 5bbde0 : { : hjstate->hj_CurTuple = hashTuple; 0.00 : 5bbe1f: 49 89 9c 24 c0 00 00 mov %rbx,0xc0(%r12) 0.00 : 5bbe26: 00 : : /* : * no match : */ : return false; : } 0.00 : 5bbe27: 48 83 c4 08 add $0x8,%rsp : /* reset temp memory each time to avoid leaks from qual expr */ : ResetExprContext(econtext); : : if (ExecQual(hjclauses, econtext, false)) : { : hjstate->hj_CurTuple = hashTuple; 0.00 : 5bbe2b: b8 01 00 00 00 mov $0x1,%eax : : /* : * no match : */ : return false; : } 0.00 : 5bbe30: 5b pop %rbx 0.00 : 5bbe31: 41 5c pop %r12 0.00 : 5bbe33: 41 5d pop %r13 0.00 : 5bbe35: 41 5e pop %r14 0.00 : 5bbe37: 41 5f pop %r15 0.00 : 5bbe39: c9 leaveq 0.00 : 5bbe3a: c3 retq 0.00 : 5bbe3b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5bbe40: 48 83 c4 08 add $0x8,%rsp : else if (hjstate->hj_CurSkewBucketNo != INVALID_SKEW_BUCKET_NO) : hashTuple = hashtable->skewBucket[hjstate->hj_CurSkewBucketNo]->tuples; : else : hashTuple = hashtable->buckets[hjstate->hj_CurBucketNo]; : : while (hashTuple != NULL) 0.00 : 5bbe44: 31 c0 xor %eax,%eax : : /* : * no match : */ : return false; : } 0.00 : 5bbe46: 5b pop %rbx 0.00 : 5bbe47: 41 5c pop %r12 0.00 : 5bbe49: 41 5d pop %r13 0.00 : 5bbe4b: 41 5e pop %r14 0.00 : 5bbe4d: 41 5f pop %r15 0.00 : 5bbe4f: c9 leaveq 0.00 : 5bbe50: c3 retq : * If the tuple hashed to a skew bucket then scan the skew bucket : * otherwise scan the standard hashtable bucket. : */ : if (hashTuple != NULL) : hashTuple = hashTuple->next; : else if (hjstate->hj_CurSkewBucketNo != INVALID_SKEW_BUCKET_NO) 0.00 : 5bbe51: 8b 87 b8 00 00 00 mov 0xb8(%rdi),%eax 0.00 : 5bbe57: 83 f8 ff cmp $0xffffffff,%eax 0.00 : 5bbe5a: 74 13 je 5bbe6f : hashTuple = hashtable->skewBucket[hjstate->hj_CurSkewBucketNo]->tuples; 0.00 : 5bbe5c: 48 8b 51 28 mov 0x28(%rcx),%rdx 0.00 : 5bbe60: 48 98 cltq 0.00 : 5bbe62: 48 8b 04 c2 mov (%rdx,%rax,8),%rax 0.00 : 5bbe66: 48 8b 58 08 mov 0x8(%rax),%rbx 0.00 : 5bbe6a: e9 74 ff ff ff jmpq 5bbde3 : else : hashTuple = hashtable->buckets[hjstate->hj_CurBucketNo]; 0.00 : 5bbe6f: 48 63 97 b4 00 00 00 movslq 0xb4(%rdi),%rdx 0.00 : 5bbe76: 48 8b 41 18 mov 0x18(%rcx),%rax 0.00 : 5bbe7a: 48 8b 1c d0 mov (%rax,%rdx,8),%rbx /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1073 75.00 : 5bbe7e: e9 60 ff ff ff jmpq 5bbde3 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 25.00 /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:719 25.00 /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:723 25.00 /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:727 25.00 /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:732 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005e3350 : : * be examined, but the condition must be rechecked anyway. (For ease of : * testing, recheck is always set true when ntuples < 0.) : */ : TBMIterateResult * : tbm_iterate(TBMIterator *iterator) : { 0.00 : 5e3350: 55 push %rbp 0.00 : 5e3351: 48 89 e5 mov %rsp,%rbp 0.00 : 5e3354: 53 push %rbx : TIDBitmap *tbm = iterator->tbm; 0.00 : 5e3355: 4c 8b 1f mov (%rdi),%r11 : : /* : * If lossy chunk pages remain, make sure we've advanced schunkptr/ : * schunkbit to the next set bit. : */ : while (iterator->schunkptr < tbm->nchunks) 0.00 : 5e3358: 44 8b 57 0c mov 0xc(%rdi),%r10d : */ : TBMIterateResult * : tbm_iterate(TBMIterator *iterator) : { : TIDBitmap *tbm = iterator->tbm; : TBMIterateResult *output = &(iterator->output); 0.00 : 5e335c: 48 8d 5f 14 lea 0x14(%rdi),%rbx : : /* : * If lossy chunk pages remain, make sure we've advanced schunkptr/ : * schunkbit to the next set bit. : */ : while (iterator->schunkptr < tbm->nchunks) 0.00 : 5e3360: 45 3b 53 2c cmp 0x2c(%r11),%r10d 0.00 : 5e3364: 0f 8d 9f 00 00 00 jge 5e3409 : while (schunkbit < PAGES_PER_CHUNK) : { : int wordnum = WORDNUM(schunkbit); : int bitnum = BITNUM(schunkbit); : : if ((chunk->words[wordnum] & ((bitmapword) 1 << bitnum)) != 0) 0.00 : 5e336a: 41 b9 01 00 00 00 mov $0x1,%r9d : * schunkbit to the next set bit. : */ : while (iterator->schunkptr < tbm->nchunks) : { : PagetableEntry *chunk = tbm->schunks[iterator->schunkptr]; : int schunkbit = iterator->schunkbit; 0.00 : 5e3370: 8b 77 10 mov 0x10(%rdi),%esi : * If lossy chunk pages remain, make sure we've advanced schunkptr/ : * schunkbit to the next set bit. : */ : while (iterator->schunkptr < tbm->nchunks) : { : PagetableEntry *chunk = tbm->schunks[iterator->schunkptr]; 0.00 : 5e3373: 49 8b 43 70 mov 0x70(%r11),%rax 0.00 : 5e3377: 49 63 d2 movslq %r10d,%rdx : int schunkbit = iterator->schunkbit; : : while (schunkbit < PAGES_PER_CHUNK) 0.00 : 5e337a: 81 fe ff 00 00 00 cmp $0xff,%esi : * If lossy chunk pages remain, make sure we've advanced schunkptr/ : * schunkbit to the next set bit. : */ : while (iterator->schunkptr < tbm->nchunks) : { : PagetableEntry *chunk = tbm->schunks[iterator->schunkptr]; 0.00 : 5e3380: 4c 8b 04 d0 mov (%rax,%rdx,8),%r8 : int schunkbit = iterator->schunkbit; : : while (schunkbit < PAGES_PER_CHUNK) 0.00 : 5e3384: 7f 68 jg 5e33ee : { : int wordnum = WORDNUM(schunkbit); : int bitnum = BITNUM(schunkbit); : : if ((chunk->words[wordnum] & ((bitmapword) 1 << bitnum)) != 0) 0.00 : 5e3386: 8d 56 1f lea 0x1f(%rsi),%edx 0.00 : 5e3389: 85 f6 test %esi,%esi 0.00 : 5e338b: 89 f0 mov %esi,%eax 0.00 : 5e338d: 0f 49 d6 cmovns %esi,%edx 0.00 : 5e3390: c1 f8 1f sar $0x1f,%eax 0.00 : 5e3393: c1 e8 1b shr $0x1b,%eax 0.00 : 5e3396: c1 fa 05 sar $0x5,%edx 0.00 : 5e3399: 8d 0c 06 lea (%rsi,%rax,1),%ecx 0.00 : 5e339c: 48 63 d2 movslq %edx,%rdx 0.00 : 5e339f: 83 e1 1f and $0x1f,%ecx 0.00 : 5e33a2: 29 c1 sub %eax,%ecx 0.00 : 5e33a4: 44 89 c8 mov %r9d,%eax 0.00 : 5e33a7: d3 e0 shl %cl,%eax 0.00 : 5e33a9: 41 85 44 90 08 test %eax,0x8(%r8,%rdx,4) 0.00 : 5e33ae: 74 33 je 5e33e3 0.00 : 5e33b0: eb 6e jmp 5e3420 0.00 : 5e33b2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5e33b8: 89 f0 mov %esi,%eax 0.00 : 5e33ba: c1 f8 1f sar $0x1f,%eax 0.00 : 5e33bd: c1 e8 1b shr $0x1b,%eax 0.00 : 5e33c0: 8d 0c 06 lea (%rsi,%rax,1),%ecx 0.00 : 5e33c3: 83 e1 1f and $0x1f,%ecx 0.00 : 5e33c6: 29 c1 sub %eax,%ecx 0.00 : 5e33c8: 44 89 c8 mov %r9d,%eax 0.00 : 5e33cb: d3 e0 shl %cl,%eax 0.00 : 5e33cd: 85 f6 test %esi,%esi 0.00 : 5e33cf: 89 c1 mov %eax,%ecx 0.00 : 5e33d1: 8d 46 1f lea 0x1f(%rsi),%eax 0.00 : 5e33d4: 0f 49 c6 cmovns %esi,%eax 0.00 : 5e33d7: c1 f8 05 sar $0x5,%eax 0.00 : 5e33da: 48 98 cltq 0.00 : 5e33dc: 41 85 4c 80 08 test %ecx,0x8(%r8,%rax,4) 0.00 : 5e33e1: 75 3d jne 5e3420 : break; : schunkbit++; 0.00 : 5e33e3: 83 c6 01 add $0x1,%esi : while (iterator->schunkptr < tbm->nchunks) : { : PagetableEntry *chunk = tbm->schunks[iterator->schunkptr]; : int schunkbit = iterator->schunkbit; : : while (schunkbit < PAGES_PER_CHUNK) 0.00 : 5e33e6: 81 fe 00 01 00 00 cmp $0x100,%esi 0.00 : 5e33ec: 75 ca jne 5e33b8 : { : iterator->schunkbit = schunkbit; : break; : } : /* advance to next chunk */ : iterator->schunkptr++; 0.00 : 5e33ee: 41 8d 42 01 lea 0x1(%r10),%eax : iterator->schunkbit = 0; 0.00 : 5e33f2: c7 47 10 00 00 00 00 movl $0x0,0x10(%rdi) : { : iterator->schunkbit = schunkbit; : break; : } : /* advance to next chunk */ : iterator->schunkptr++; 0.00 : 5e33f9: 89 47 0c mov %eax,0xc(%rdi) : : /* : * If lossy chunk pages remain, make sure we've advanced schunkptr/ : * schunkbit to the next set bit. : */ : while (iterator->schunkptr < tbm->nchunks) 0.00 : 5e33fc: 41 3b 43 2c cmp 0x2c(%r11),%eax 0.00 : 5e3400: 41 89 c2 mov %eax,%r10d 0.00 : 5e3403: 0f 8c 67 ff ff ff jl 5e3370 : iterator->schunkbit++; : return output; : } : } : : if (iterator->spageptr < tbm->npages) 0.00 : 5e3409: 8b 77 08 mov 0x8(%rdi),%esi 0.00 : 5e340c: 41 3b 73 28 cmp 0x28(%r11),%esi 0.00 : 5e3410: 7c 44 jl 5e3456 0.00 : 5e3412: 31 db xor %ebx,%ebx 0.00 : 5e3414: e9 c9 00 00 00 jmpq 5e34e2 0.00 : 5e3419: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : break; : schunkbit++; : } : if (schunkbit < PAGES_PER_CHUNK) : { : iterator->schunkbit = schunkbit; 0.00 : 5e3420: 89 77 10 mov %esi,0x10(%rdi) : : /* : * If both chunk and per-page data remain, must output the numerically : * earlier page. : */ : if (iterator->schunkptr < tbm->nchunks) 0.00 : 5e3423: 8b 47 0c mov 0xc(%rdi),%eax 0.00 : 5e3426: 41 3b 43 2c cmp 0x2c(%r11),%eax 0.00 : 5e342a: 7d dd jge 5e3409 : { : PagetableEntry *chunk = tbm->schunks[iterator->schunkptr]; : BlockNumber chunk_blockno; : : chunk_blockno = chunk->blockno + iterator->schunkbit; 0.00 : 5e342c: 49 8b 53 70 mov 0x70(%r11),%rdx 0.00 : 5e3430: 48 98 cltq 0.00 : 5e3432: 89 f1 mov %esi,%ecx : if (iterator->spageptr >= tbm->npages || 0.00 : 5e3434: 8b 77 08 mov 0x8(%rdi),%esi : if (iterator->schunkptr < tbm->nchunks) : { : PagetableEntry *chunk = tbm->schunks[iterator->schunkptr]; : BlockNumber chunk_blockno; : : chunk_blockno = chunk->blockno + iterator->schunkbit; 0.00 : 5e3437: 48 8b 04 c2 mov (%rdx,%rax,8),%rax 0.00 : 5e343b: 03 08 add (%rax),%ecx : if (iterator->spageptr >= tbm->npages || 0.00 : 5e343d: 41 3b 73 28 cmp 0x28(%r11),%esi 0.00 : 5e3441: 0f 8d 89 00 00 00 jge 5e34d0 0.00 : 5e3447: 49 8b 53 68 mov 0x68(%r11),%rdx 0.00 : 5e344b: 48 63 c6 movslq %esi,%rax 0.00 : 5e344e: 48 8b 04 c2 mov (%rdx,%rax,8),%rax 0.00 : 5e3452: 3b 08 cmp (%rax),%ecx 0.00 : 5e3454: 72 7a jb 5e34d0 : PagetableEntry *page; : int ntuples; : int wordnum; : : /* In ONE_PAGE state, we don't allocate an spages[] array */ : if (tbm->status == TBM_ONE_PAGE) 0.00 : 5e3456: 41 83 7b 10 01 cmpl $0x1,0x10(%r11) : page = &tbm->entry1; 0.00 : 5e345b: 49 8d 53 34 lea 0x34(%r11),%rdx : PagetableEntry *page; : int ntuples; : int wordnum; : : /* In ONE_PAGE state, we don't allocate an spages[] array */ : if (tbm->status == TBM_ONE_PAGE) 0.00 : 5e345f: 74 0b je 5e346c : page = &tbm->entry1; : else : page = tbm->spages[iterator->spageptr]; 0.00 : 5e3461: 49 8b 43 68 mov 0x68(%r11),%rax 0.00 : 5e3465: 48 63 d6 movslq %esi,%rdx 0.00 : 5e3468: 48 8b 14 d0 mov (%rax,%rdx,8),%rdx 0.00 : 5e346c: 45 31 c0 xor %r8d,%r8d 0.00 : 5e346f: 45 31 c9 xor %r9d,%r9d 0.00 : 5e3472: 41 ba 01 00 00 00 mov $0x1,%r10d 0.00 : 5e3478: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5e347f: 00 : : /* scan bitmap to extract individual offset numbers */ : ntuples = 0; : for (wordnum = 0; wordnum < WORDS_PER_PAGE; wordnum++) : { : bitmapword w = page->words[wordnum]; 0.00 : 5e3480: 42 8b 4c 0a 08 mov 0x8(%rdx,%r9,1),%ecx : : if (w != 0) /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:719 25.00 : 5e3485: 85 c9 test %ecx,%ecx 0.00 : 5e3487: 74 1f je 5e34a8 0.00 : 5e3489: 44 89 d6 mov %r10d,%esi 0.00 : 5e348c: eb 05 jmp 5e3493 0.00 : 5e348e: 66 90 xchg %ax,%ax : : while (w != 0) : { : if (w & 1) : output->offsets[ntuples++] = (OffsetNumber) off; : off++; 0.00 : 5e3490: 83 c6 01 add $0x1,%esi : { : int off = wordnum * BITS_PER_BITMAPWORD + 1; : : while (w != 0) : { : if (w & 1) 0.00 : 5e3493: f6 c1 01 test $0x1,%cl 0.00 : 5e3496: 74 0c je 5e34a4 : output->offsets[ntuples++] = (OffsetNumber) off; 0.00 : 5e3498: 49 63 c0 movslq %r8d,%rax 0.00 : 5e349b: 41 83 c0 01 add $0x1,%r8d 0.00 : 5e349f: 66 89 74 47 1e mov %si,0x1e(%rdi,%rax,2) : : if (w != 0) : { : int off = wordnum * BITS_PER_BITMAPWORD + 1; : : while (w != 0) /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:723 25.00 : 5e34a4: d1 e9 shr %ecx 0.00 : 5e34a6: 75 e8 jne 5e3490 : { : if (w & 1) : output->offsets[ntuples++] = (OffsetNumber) off; : off++; /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:727 25.00 : 5e34a8: 49 83 c1 04 add $0x4,%r9 0.00 : 5e34ac: 41 83 c2 20 add $0x20,%r10d : else : page = tbm->spages[iterator->spageptr]; : : /* scan bitmap to extract individual offset numbers */ : ntuples = 0; : for (wordnum = 0; wordnum < WORDS_PER_PAGE; wordnum++) 0.00 : 5e34b0: 49 83 f9 28 cmp $0x28,%r9 0.00 : 5e34b4: 75 ca jne 5e3480 : off++; : w >>= 1; : } : } : } : output->blockno = page->blockno; /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:732 25.00 : 5e34b6: 8b 02 mov (%rdx),%eax : output->ntuples = ntuples; 0.00 : 5e34b8: 44 89 47 18 mov %r8d,0x18(%rdi) : off++; : w >>= 1; : } : } : } : output->blockno = page->blockno; 0.00 : 5e34bc: 89 47 14 mov %eax,0x14(%rdi) : output->ntuples = ntuples; : output->recheck = page->recheck; 0.00 : 5e34bf: 0f b6 42 05 movzbl 0x5(%rdx),%eax : iterator->spageptr++; 0.00 : 5e34c3: 83 47 08 01 addl $0x1,0x8(%rdi) : } : } : } : output->blockno = page->blockno; : output->ntuples = ntuples; : output->recheck = page->recheck; 0.00 : 5e34c7: 88 47 1c mov %al,0x1c(%rdi) : return output; : } : : /* Nothing more in the bitmap */ : return NULL; : } 0.00 : 5e34ca: 48 89 d8 mov %rbx,%rax 0.00 : 5e34cd: 5b pop %rbx 0.00 : 5e34ce: c9 leaveq 0.00 : 5e34cf: c3 retq : { : /* Return a lossy page indicator from the chunk */ : output->blockno = chunk_blockno; : output->ntuples = -1; : output->recheck = true; : iterator->schunkbit++; 0.00 : 5e34d0: 83 47 10 01 addl $0x1,0x10(%rdi) : chunk_blockno = chunk->blockno + iterator->schunkbit; : if (iterator->spageptr >= tbm->npages || : chunk_blockno < tbm->spages[iterator->spageptr]->blockno) : { : /* Return a lossy page indicator from the chunk */ : output->blockno = chunk_blockno; 0.00 : 5e34d4: 89 4f 14 mov %ecx,0x14(%rdi) : output->ntuples = -1; 0.00 : 5e34d7: c7 47 18 ff ff ff ff movl $0xffffffff,0x18(%rdi) : output->recheck = true; 0.00 : 5e34de: c6 47 1c 01 movb $0x1,0x1c(%rdi) : return output; : } : : /* Nothing more in the bitmap */ : return NULL; : } 0.00 : 5e34e2: 48 89 d8 mov %rbx,%rax 0.00 : 5e34e5: 5b pop %rbx 0.00 : 5e34e6: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1283 25.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1283 25.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1284 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000674c30 : : * Returns TRUE if buffer is BM_VALID, else FALSE. This provision allows : * some callers to avoid an extra spinlock cycle. : */ : static bool : PinBuffer(volatile BufferDesc *buf, BufferAccessStrategy strategy) : { 0.00 : 674c30: 55 push %rbp : int b = buf->buf_id; : bool result; : PrivateRefCountEntry *ref; : : ref = GetPrivateRefCountEntry(b + 1, true, true); 0.00 : 674c31: ba 01 00 00 00 mov $0x1,%edx : * Returns TRUE if buffer is BM_VALID, else FALSE. This provision allows : * some callers to avoid an extra spinlock cycle. : */ : static bool : PinBuffer(volatile BufferDesc *buf, BufferAccessStrategy strategy) : { 0.00 : 674c36: 48 89 e5 mov %rsp,%rbp 0.00 : 674c39: 48 89 5d e0 mov %rbx,-0x20(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1283 25.00 : 674c3d: 4c 89 65 e8 mov %r12,-0x18(%rbp) 0.00 : 674c41: 48 89 fb mov %rdi,%rbx 0.00 : 674c44: 4c 89 6d f0 mov %r13,-0x10(%rbp) 0.00 : 674c48: 4c 89 75 f8 mov %r14,-0x8(%rbp) 0.00 : 674c4c: 48 83 ec 20 sub $0x20,%rsp : int b = buf->buf_id; /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1284 25.00 : 674c50: 8b 7f 24 mov 0x24(%rdi),%edi : * Returns TRUE if buffer is BM_VALID, else FALSE. This provision allows : * some callers to avoid an extra spinlock cycle. : */ : static bool : PinBuffer(volatile BufferDesc *buf, BufferAccessStrategy strategy) : { /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1283 50.00 : 674c53: 49 89 f6 mov %rsi,%r14 : int b = buf->buf_id; : bool result; : PrivateRefCountEntry *ref; : : ref = GetPrivateRefCountEntry(b + 1, true, true); 0.00 : 674c56: be 01 00 00 00 mov $0x1,%esi : : if (ref->refcount == 0) 0.00 : 674c5b: 41 bd 01 00 00 00 mov $0x1,%r13d : { : int b = buf->buf_id; : bool result; : PrivateRefCountEntry *ref; : : ref = GetPrivateRefCountEntry(b + 1, true, true); 0.00 : 674c61: 83 c7 01 add $0x1,%edi 0.00 : 674c64: e8 b7 f8 ff ff callq 674520 0.00 : 674c69: 49 89 c4 mov %rax,%r12 : : if (ref->refcount == 0) 0.00 : 674c6c: 8b 40 04 mov 0x4(%rax),%eax 0.00 : 674c6f: 85 c0 test %eax,%eax 0.00 : 674c71: 75 43 jne 674cb6 : { : LockBufHdr(buf); 0.00 : 674c73: 48 8d 7b 20 lea 0x20(%rbx),%rdi : static __inline__ int : tas(volatile slock_t *lock) : { : register slock_t _res = 1; : : __asm__ __volatile__( 0.00 : 674c77: b8 01 00 00 00 mov $0x1,%eax 0.00 : 674c7c: f0 86 07 lock xchg %al,(%rdi) 0.00 : 674c7f: 84 c0 test %al,%al 0.00 : 674c81: 75 6d jne 674cf0 : buf->refcount++; 0.00 : 674c83: 8b 43 18 mov 0x18(%rbx),%eax 0.00 : 674c86: 83 c0 01 add $0x1,%eax : if (strategy == NULL) 0.00 : 674c89: 4d 85 f6 test %r14,%r14 : ref = GetPrivateRefCountEntry(b + 1, true, true); : : if (ref->refcount == 0) : { : LockBufHdr(buf); : buf->refcount++; 0.00 : 674c8c: 89 43 18 mov %eax,0x18(%rbx) : if (strategy == NULL) 0.00 : 674c8f: 74 7c je 674d0d : if (buf->usage_count < BM_MAX_USAGE_COUNT) : buf->usage_count++; : } : else : { : if (buf->usage_count == 0) 0.00 : 674c91: 0f b7 43 16 movzwl 0x16(%rbx),%eax 0.00 : 674c95: 66 85 c0 test %ax,%ax 0.00 : 674c98: 75 06 jne 674ca0 : buf->usage_count = 1; 0.00 : 674c9a: 66 c7 43 16 01 00 movw $0x1,0x16(%rbx) : } : result = (buf->flags & BM_VALID) != 0; 0.00 : 674ca0: 0f b7 43 14 movzwl 0x14(%rbx),%eax 0.00 : 674ca4: d1 e8 shr %eax 0.00 : 674ca6: 41 89 c5 mov %eax,%r13d 0.00 : 674ca9: 41 83 e5 01 and $0x1,%r13d : UnlockBufHdr(buf); 0.00 : 674cad: c6 43 20 00 movb $0x0,0x20(%rbx) 0.00 : 674cb1: 41 8b 44 24 04 mov 0x4(%r12),%eax : { : /* If we previously pinned the buffer, it must surely be valid */ : result = true; : } : : ref->refcount++; 0.00 : 674cb6: 83 c0 01 add $0x1,%eax 0.00 : 674cb9: 41 89 44 24 04 mov %eax,0x4(%r12) : Assert(ref->refcount > 0); : ResourceOwnerRememberBuffer(CurrentResourceOwner, 0.00 : 674cbe: 8b 73 24 mov 0x24(%rbx),%esi 0.00 : 674cc1: 48 8b 3d f8 5b 54 00 mov 0x545bf8(%rip),%rdi # bba8c0 0.00 : 674cc8: 83 c6 01 add $0x1,%esi 0.00 : 674ccb: e8 d0 54 12 00 callq 79a1a0 : BufferDescriptorGetBuffer(buf)); : return result; : } 0.00 : 674cd0: 44 89 e8 mov %r13d,%eax 0.00 : 674cd3: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 674cd7: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 674cdc: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 674ce1: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 0.00 : 674ce6: c9 leaveq 0.00 : 674ce7: c3 retq 0.00 : 674ce8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 674cef: 00 : : ref = GetPrivateRefCountEntry(b + 1, true, true); : : if (ref->refcount == 0) : { : LockBufHdr(buf); 0.00 : 674cf0: ba 0c 05 00 00 mov $0x50c,%edx 0.00 : 674cf5: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 674cfa: e8 41 b3 01 00 callq 690040 : buf->refcount++; 0.00 : 674cff: 8b 43 18 mov 0x18(%rbx),%eax 0.00 : 674d02: 83 c0 01 add $0x1,%eax : if (strategy == NULL) 0.00 : 674d05: 4d 85 f6 test %r14,%r14 : ref = GetPrivateRefCountEntry(b + 1, true, true); : : if (ref->refcount == 0) : { : LockBufHdr(buf); : buf->refcount++; 0.00 : 674d08: 89 43 18 mov %eax,0x18(%rbx) : if (strategy == NULL) 0.00 : 674d0b: 75 84 jne 674c91 : { : if (buf->usage_count < BM_MAX_USAGE_COUNT) 0.00 : 674d0d: 0f b7 43 16 movzwl 0x16(%rbx),%eax 0.00 : 674d11: 66 83 f8 04 cmp $0x4,%ax 0.00 : 674d15: 77 89 ja 674ca0 : buf->usage_count++; 0.00 : 674d17: 0f b7 43 16 movzwl 0x16(%rbx),%eax 0.00 : 674d1b: 83 c0 01 add $0x1,%eax 0.00 : 674d1e: 66 89 43 16 mov %ax,0x16(%rbx) 0.00 : 674d22: e9 79 ff ff ff jmpq 674ca0 Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 66.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:499 33.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:508 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b3a20 : : Assert(slot != NULL); : Assert(slot->tts_tupleDescriptor != NULL); : Assert(slot->tts_isempty); : : slot->tts_isempty = false; : slot->tts_nvalid = slot->tts_tupleDescriptor->natts; 0.00 : 5b3a20: 48 8b 47 10 mov 0x10(%rdi),%rax : * This is a bit unclean but it avoids one round of data copying. : * -------------------------------- : */ : TupleTableSlot * : ExecStoreVirtualTuple(TupleTableSlot *slot) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:499 66.67 : 5b3a24: 55 push %rbp : */ : Assert(slot != NULL); : Assert(slot->tts_tupleDescriptor != NULL); : Assert(slot->tts_isempty); : : slot->tts_isempty = false; 0.00 : 5b3a25: c6 47 04 00 movb $0x0,0x4(%rdi) : * This is a bit unclean but it avoids one round of data copying. : * -------------------------------- : */ : TupleTableSlot * : ExecStoreVirtualTuple(TupleTableSlot *slot) : { 0.00 : 5b3a29: 48 89 e5 mov %rsp,%rbp : Assert(slot != NULL); : Assert(slot->tts_tupleDescriptor != NULL); : Assert(slot->tts_isempty); : : slot->tts_isempty = false; : slot->tts_nvalid = slot->tts_tupleDescriptor->natts; /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:508 33.33 : 5b3a2c: 8b 00 mov (%rax),%eax 0.00 : 5b3a2e: 89 47 24 mov %eax,0x24(%rdi) : : return slot; : } 0.00 : 5b3a31: 48 89 f8 mov %rdi,%rax 0.00 : 5b3a34: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 66.67 /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/lwlock.c:666 33.33 /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/../../../../src/include/port/atomics/arch-x86.h:202 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000068eec0 : : * for 'potentially_spurious'. Its value will be set to true if we possibly : * did so. The caller then has to handle that scenario. : */ : static bool : LWLockAttemptLock(LWLock* lock, LWLockMode mode, bool *potentially_spurious) : { 0.00 : 68eec0: 55 push %rbp : lwstats = get_lwlock_stats_entry(lock); : #endif : : AssertArg(mode == LW_EXCLUSIVE || mode == LW_SHARED); : : if (potentially_spurious != NULL) 0.00 : 68eec1: 48 85 d2 test %rdx,%rdx : * for 'potentially_spurious'. Its value will be set to true if we possibly : * did so. The caller then has to handle that scenario. : */ : static bool : LWLockAttemptLock(LWLock* lock, LWLockMode mode, bool *potentially_spurious) : { 0.00 : 68eec4: 48 89 e5 mov %rsp,%rbp : lwstats = get_lwlock_stats_entry(lock); : #endif : : AssertArg(mode == LW_EXCLUSIVE || mode == LW_SHARED); : : if (potentially_spurious != NULL) 0.00 : 68eec7: 74 03 je 68eecc : *potentially_spurious = false; 0.00 : 68eec9: c6 02 00 movb $0x0,(%rdx) : : if (mode == LW_EXCLUSIVE) 0.00 : 68eecc: 85 f6 test %esi,%esi 0.00 : 68eece: 75 28 jne 68eef8 : #ifndef PG_HAVE_ATOMIC_READ_U32 : #define PG_HAVE_ATOMIC_READ_U32 : static inline uint32 : pg_atomic_read_u32_impl(volatile pg_atomic_uint32 *ptr) : { : return *(&ptr->value); 0.00 : 68eed0: 8b 47 04 mov 0x4(%rdi),%eax : * First check whether the variable is free without a atomic : * operation; it's often quite a bit cheaper for contended : * locks. Doing so can cause a superflous shared-exclusive cacheline : * transition, but benchmarks show that it's still worth doing so. : */ : expected = pg_atomic_read_u32(&lock->lockcount); 0.00 : 68eed3: 48 8d 57 04 lea 0x4(%rdi),%rdx : : if (expected != 0) 0.00 : 68eed7: 85 c0 test %eax,%eax 0.00 : 68eed9: 75 65 jne 68ef40 : : /* : * Perform cmpxchg and use the zero flag which it implicitly sets when : * equal to measure the success. : */ : __asm__ __volatile__( 0.00 : 68eedb: b9 00 00 00 40 mov $0x40000000,%ecx 0.00 : 68eee0: 89 f0 mov %esi,%eax 0.00 : 68eee2: f0 0f b1 0a lock cmpxchg %ecx,(%rdx) 0.00 : 68eee6: 40 0f 94 c6 sete %sil 0.00 : 68eeea: 40 84 f6 test %sil,%sil 0.00 : 68eeed: 0f 94 c1 sete %cl : return false; : } : } : : pg_unreachable(); : } 0.00 : 68eef0: 89 c8 mov %ecx,%eax 0.00 : 68eef2: c9 leaveq 0.00 : 68eef3: c3 retq 0.00 : 68eef4: 0f 1f 40 00 nopl 0x0(%rax) : /* : * If the caller is interested in spurious locks, do an unlocked check : * first. This is useful if potentially spurious results have a : * noticeable cost. : */ : if (potentially_spurious != NULL && 0.00 : 68eef8: 48 85 d2 test %rdx,%rdx 0.00 : 68eefb: 48 8d 77 04 lea 0x4(%rdi),%rsi 0.00 : 68eeff: 74 0e je 68ef0f 0.00 : 68ef01: 8b 47 04 mov 0x4(%rdi),%eax 0.00 : 68ef04: 48 8d 77 04 lea 0x4(%rdi),%rsi 0.00 : 68ef08: 3d ff ff ff 3f cmp $0x3fffffff,%eax 0.00 : 68ef0d: 77 31 ja 68ef40 : #define PG_HAVE_ATOMIC_FETCH_ADD_U32 : static inline uint32 : pg_atomic_fetch_add_u32_impl(volatile pg_atomic_uint32 *ptr, int32 add_) : { : uint32 res; : __asm__ __volatile__( 0.00 : 68ef0f: b8 01 00 00 00 mov $0x1,%eax /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/../../../../src/include/port/atomics/arch-x86.h:202 33.33 : 68ef14: f0 0f c1 06 lock xadd %eax,(%rsi) : * might have to back out again if it turns out somebody else has an : * exclusive lock. : */ : oldstate = pg_atomic_fetch_add_u32(&lock->lockcount, 1); : : if (oldstate >= EXCLUSIVE_LOCK) /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/lwlock.c:666 66.67 : 68ef18: 31 c9 xor %ecx,%ecx 0.00 : 68ef1a: 3d ff ff ff 3f cmp $0x3fffffff,%eax 0.00 : 68ef1f: 76 cf jbe 68eef0 0.00 : 68ef21: b8 ff ff ff ff mov $0xffffffff,%eax 0.00 : 68ef26: f0 0f c1 06 lock xadd %eax,(%rsi) : * problems exist. : */ : pg_atomic_fetch_sub_u32(&lock->lockcount, 1); : : : if (potentially_spurious != NULL) 0.00 : 68ef2a: 48 85 d2 test %rdx,%rdx 0.00 : 68ef2d: 74 11 je 68ef40 : *potentially_spurious = true; 0.00 : 68ef2f: b9 01 00 00 00 mov $0x1,%ecx 0.00 : 68ef34: c6 02 01 movb $0x1,(%rdx) : return false; : } : } : : pg_unreachable(); : } 0.00 : 68ef37: 89 c8 mov %ecx,%eax 0.00 : 68ef39: c9 leaveq 0.00 : 68ef3a: c3 retq 0.00 : 68ef3b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : */ : pg_atomic_fetch_sub_u32(&lock->lockcount, 1); : : : if (potentially_spurious != NULL) : *potentially_spurious = true; 0.00 : 68ef40: b9 01 00 00 00 mov $0x1,%ecx : return false; : } : } : : pg_unreachable(); : } 0.00 : 68ef45: c9 leaveq 0.00 : 68ef46: 89 c8 mov %ecx,%eax Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 66.67 /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/predicate.c:4064 33.33 /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/predicate.c:3871 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000694660 : : */ : void : CheckForSerializableConflictOut(bool visible, Relation relation, : HeapTuple tuple, Buffer buffer, : Snapshot snapshot) : { 0.00 : 694660: 55 push %rbp 0.00 : 694661: 48 89 e5 mov %rsp,%rbp 0.00 : 694664: 4c 89 65 f0 mov %r12,-0x10(%rbp) 0.00 : 694668: 4c 89 6d f8 mov %r13,-0x8(%rbp) 0.00 : 69466c: 49 89 d4 mov %rdx,%r12 0.00 : 69466f: 48 89 5d e8 mov %rbx,-0x18(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/predicate.c:3871 33.33 : 694673: 48 83 ec 30 sub $0x30,%rsp : */ : static inline bool : SerializationNeededForRead(Relation relation, Snapshot snapshot) : { : /* Nothing to do if this is not a serializable transaction */ : if (MySerializableXact == InvalidSerializableXact) 0.00 : 694677: 48 8b 15 42 a0 4e 00 mov 0x4ea042(%rip),%rdx # b7e6c0 : */ : void : CheckForSerializableConflictOut(bool visible, Relation relation, : HeapTuple tuple, Buffer buffer, : Snapshot snapshot) : { 0.00 : 69467e: 41 89 fd mov %edi,%r13d : */ : static inline bool : SerializationNeededForRead(Relation relation, Snapshot snapshot) : { : /* Nothing to do if this is not a serializable transaction */ : if (MySerializableXact == InvalidSerializableXact) 0.00 : 694681: 48 85 d2 test %rdx,%rdx 0.00 : 694684: 74 13 je 694699 : * This excludes things like CLUSTER and REINDEX. They use the wholesale : * functions TransferPredicateLocksToHeapRelation() and : * CheckTableForSerializableConflictIn() to participate serialization, but : * the scans involved don't need serialization. : */ : if (!IsMVCCSnapshot(snapshot)) 0.00 : 694686: 49 8b 00 mov (%r8),%rax 0.00 : 694689: 48 3d 50 57 7a 00 cmp $0x7a5750,%rax 0.00 : 69468f: 74 1f je 6946b0 0.00 : 694691: 48 3d 60 47 7a 00 cmp $0x7a4760,%rax 0.00 : 694697: 74 17 je 6946b0 : * Flag the conflict. But first, if this conflict creates a dangerous : * structure, ereport an error. : */ : FlagRWConflict(MySerializableXact, sxact); : LWLockRelease(SerializableXactHashLock); : } 0.00 : 694699: 48 8b 5d e8 mov -0x18(%rbp),%rbx 0.00 : 69469d: 4c 8b 65 f0 mov -0x10(%rbp),%r12 0.00 : 6946a1: 4c 8b 6d f8 mov -0x8(%rbp),%r13 0.00 : 6946a5: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/predicate.c:4064 66.67 : 6946a6: c3 retq 0.00 : 6946a7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 6946ae: 00 00 : * : * A transaction is flagged as RO_SAFE if all concurrent R/W transactions : * commit without having conflicts out to an earlier snapshot, thus : * ensuring that no conflicts are possible for this transaction. : */ : if (SxactIsROSafe(MySerializableXact)) 0.00 : 6946b0: 8b 52 7c mov 0x7c(%rdx),%edx 0.00 : 6946b3: 84 d2 test %dl,%dl 0.00 : 6946b5: 78 69 js 694720 : * relations are exempt, as are materialized views. : */ : static inline bool : PredicateLockingNeededForRelation(Relation relation) : { : return !(relation->rd_id < FirstBootstrapObjectId || 0.00 : 6946b7: 81 7e 40 0f 27 00 00 cmpl $0x270f,0x40(%rsi) 0.00 : 6946be: 76 d9 jbe 694699 0.00 : 6946c0: 48 8b 46 30 mov 0x30(%rsi),%rax 0.00 : 6946c4: 80 78 6e 74 cmpb $0x74,0x6e(%rax) 0.00 : 6946c8: 74 cf je 694699 0.00 : 6946ca: 80 78 6f 6d cmpb $0x6d,0x6f(%rax) 0.00 : 6946ce: 66 90 xchg %ax,%ax 0.00 : 6946d0: 74 c7 je 694699 : : if (!SerializationNeededForRead(relation, snapshot)) : return; : : /* Check if someone else has already decided that we need to die */ : if (SxactIsDoomed(MySerializableXact)) 0.00 : 6946d2: 83 e2 08 and $0x8,%edx 0.00 : 6946d5: 0f 85 55 02 00 00 jne 694930 : * transaction, either to create it not visible to us, or to delete it : * while it is visible to us. The "visible" bool indicates whether the : * tuple is visible to us, while HeapTupleSatisfiesVacuum checks what else : * is going on with it. : */ : htsvResult = HeapTupleSatisfiesVacuum(tuple, TransactionXmin, buffer); 0.00 : 6946db: 8b 35 77 e0 4d 00 mov 0x4de077(%rip),%esi # b72758 0.00 : 6946e1: 89 ca mov %ecx,%edx 0.00 : 6946e3: 4c 89 e7 mov %r12,%rdi 0.00 : 6946e6: e8 35 04 11 00 callq 7a4b20 : switch (htsvResult) 0.00 : 6946eb: 83 f8 04 cmp $0x4,%eax : * transaction, either to create it not visible to us, or to delete it : * while it is visible to us. The "visible" bool indicates whether the : * tuple is visible to us, while HeapTupleSatisfiesVacuum checks what else : * is going on with it. : */ : htsvResult = HeapTupleSatisfiesVacuum(tuple, TransactionXmin, buffer); 0.00 : 6946ee: 89 c3 mov %eax,%ebx : switch (htsvResult) 0.00 : 6946f0: 76 3e jbe 694730 : /* : * The only way to get to this default clause is if a new value is : * added to the enum type without adding it to this switch : * statement. That's a bug, so elog. : */ : elog(ERROR, "unrecognized return value from HeapTupleSatisfiesVacuum: %u", htsvResult); 0.00 : 6946f2: ba e0 da 8a 00 mov $0x8adae0,%edx 0.00 : 6946f7: be 56 0f 00 00 mov $0xf56,%esi 0.00 : 6946fc: bf d3 d1 8a 00 mov $0x8ad1d3,%edi 0.00 : 694701: e8 1a 6d 0e 00 callq 77b420 0.00 : 694706: 89 da mov %ebx,%edx 0.00 : 694708: be a0 d8 8a 00 mov $0x8ad8a0,%esi 0.00 : 69470d: bf 14 00 00 00 mov $0x14,%edi 0.00 : 694712: 31 c0 xor %eax,%eax 0.00 : 694714: e8 17 6b 0e 00 callq 77b230 0.00 : 694719: e8 b2 4d dd ff callq 4694d0 0.00 : 69471e: 66 90 xchg %ax,%ax : * commit without having conflicts out to an earlier snapshot, thus : * ensuring that no conflicts are possible for this transaction. : */ : if (SxactIsROSafe(MySerializableXact)) : { : ReleasePredicateLocks(false); 0.00 : 694720: 31 ff xor %edi,%edi 0.00 : 694722: e8 c9 e1 ff ff callq 6928f0 0.00 : 694727: e9 6d ff ff ff jmpq 694699 0.00 : 69472c: 0f 1f 40 00 nopl 0x0(%rax) : * while it is visible to us. The "visible" bool indicates whether the : * tuple is visible to us, while HeapTupleSatisfiesVacuum checks what else : * is going on with it. : */ : htsvResult = HeapTupleSatisfiesVacuum(tuple, TransactionXmin, buffer); : switch (htsvResult) 0.00 : 694730: 89 c0 mov %eax,%eax 0.00 : 694732: ff 24 c5 c0 d9 8a 00 jmpq *0x8ad9c0(,%rax,8) 0.00 : 694739: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : if (visible) : return; : xid = HeapTupleHeaderGetXmin(tuple->t_data); : break; : case HEAPTUPLE_RECENTLY_DEAD: : if (!visible) 0.00 : 694740: 45 84 ed test %r13b,%r13b 0.00 : 694743: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 694748: 0f 84 4b ff ff ff je 694699 : return; : xid = HeapTupleHeaderGetUpdateXid(tuple->t_data); : break; : case HEAPTUPLE_DELETE_IN_PROGRESS: : xid = HeapTupleHeaderGetUpdateXid(tuple->t_data); 0.00 : 69474e: 49 8b 7c 24 10 mov 0x10(%r12),%rdi 0.00 : 694753: 0f b7 57 14 movzwl 0x14(%rdi),%edx 0.00 : 694757: 89 d0 mov %edx,%eax 0.00 : 694759: 25 00 18 00 00 and $0x1800,%eax 0.00 : 69475e: 3d 00 10 00 00 cmp $0x1000,%eax 0.00 : 694763: 0f 84 f7 00 00 00 je 694860 0.00 : 694769: 8b 5f 04 mov 0x4(%rdi),%ebx : : /* : * Find top level xid. Bail out if xid is too early to be a conflict, or : * if it's our own xid. : */ : if (TransactionIdEquals(xid, GetTopTransactionIdIfAny())) 0.00 : 69476c: e8 0f c4 e2 ff callq 4c0b80 0.00 : 694771: 39 d8 cmp %ebx,%eax 0.00 : 694773: 0f 84 20 ff ff ff je 694699 : return; : xid = SubTransGetTopmostTransaction(xid); 0.00 : 694779: 89 df mov %ebx,%edi 0.00 : 69477b: e8 70 21 e3 ff callq 4c68f0 : if (TransactionIdPrecedes(xid, TransactionXmin)) 0.00 : 694780: 8b 35 d2 df 4d 00 mov 0x4ddfd2(%rip),%esi # b72758 0.00 : 694786: 89 c7 mov %eax,%edi : * Find top level xid. Bail out if xid is too early to be a conflict, or : * if it's our own xid. : */ : if (TransactionIdEquals(xid, GetTopTransactionIdIfAny())) : return; : xid = SubTransGetTopmostTransaction(xid); 0.00 : 694788: 89 c3 mov %eax,%ebx : if (TransactionIdPrecedes(xid, TransactionXmin)) 0.00 : 69478a: e8 51 b8 e2 ff callq 4bffe0 0.00 : 69478f: 84 c0 test %al,%al 0.00 : 694791: 0f 85 02 ff ff ff jne 694699 : return; : if (TransactionIdEquals(xid, GetTopTransactionIdIfAny())) 0.00 : 694797: e8 e4 c3 e2 ff callq 4c0b80 0.00 : 69479c: 39 c3 cmp %eax,%ebx 0.00 : 69479e: 66 90 xchg %ax,%ax 0.00 : 6947a0: 0f 84 f3 fe ff ff je 694699 : : /* : * Find sxact or summarized info for the top level xid. : */ : sxidtag.xid = xid; : LWLockAcquire(SerializableXactHashLock, LW_EXCLUSIVE); 0.00 : 6947a6: 48 8b 3d 53 92 4e 00 mov 0x4e9253(%rip),%rdi # b7da00 0.00 : 6947ad: 31 f6 xor %esi,%esi : return; : : /* : * Find sxact or summarized info for the top level xid. : */ : sxidtag.xid = xid; 0.00 : 6947af: 89 5d d0 mov %ebx,-0x30(%rbp) : LWLockAcquire(SerializableXactHashLock, LW_EXCLUSIVE); 0.00 : 6947b2: 48 81 c7 80 03 00 00 add $0x380,%rdi 0.00 : 6947b9: e8 32 b3 ff ff callq 68faf0 : sxid = (SERIALIZABLEXID *) 0.00 : 6947be: 48 8b 3d 93 9f 4e 00 mov 0x4e9f93(%rip),%rdi # b7e758 0.00 : 6947c5: 48 8d 75 d0 lea -0x30(%rbp),%rsi 0.00 : 6947c9: 31 c9 xor %ecx,%ecx 0.00 : 6947cb: 31 d2 xor %edx,%edx 0.00 : 6947cd: e8 ce fe 0e 00 callq 7846a0 : hash_search(SerializableXidHash, &sxidtag, HASH_FIND, NULL); : if (!sxid) 0.00 : 6947d2: 48 85 c0 test %rax,%rax 0.00 : 6947d5: 0f 84 c5 01 00 00 je 6949a0 : : /* It's not serializable or otherwise not important. */ : LWLockRelease(SerializableXactHashLock); : return; : } : sxact = sxid->myXact; 0.00 : 6947db: 4c 8b 60 08 mov 0x8(%rax),%r12 : Assert(TransactionIdEquals(sxact->topXid, xid)); : if (sxact == MySerializableXact || SxactIsDoomed(sxact)) 0.00 : 6947df: 48 8b 0d da 9e 4e 00 mov 0x4e9eda(%rip),%rcx # b7e6c0 0.00 : 6947e6: 49 39 cc cmp %rcx,%r12 0.00 : 6947e9: 0f 84 b1 00 00 00 je 6948a0 0.00 : 6947ef: 41 8b 54 24 7c mov 0x7c(%r12),%edx 0.00 : 6947f4: f6 c2 08 test $0x8,%dl 0.00 : 6947f7: 0f 85 a3 00 00 00 jne 6948a0 : * We have a conflict out to a transaction which has a conflict out to a : * summarized transaction. That summarized transaction must have : * committed first, and we can't tell when it committed in relation to our : * snapshot acquisition, so something needs to be canceled. : */ : if (SxactHasSummaryConflictOut(sxact)) 0.00 : 6947fd: f6 c6 04 test $0x4,%dh 0.00 : 694800: 0f 84 b2 00 00 00 je 6948b8 : { : if (!SxactIsPrepared(sxact)) 0.00 : 694806: f6 c2 02 test $0x2,%dl 0.00 : 694809: 0f 85 39 03 00 00 jne 694b48 : { : sxact->flags |= SXACT_FLAG_DOOMED; 0.00 : 69480f: 83 ca 08 or $0x8,%edx 0.00 : 694812: 41 89 54 24 7c mov %edx,0x7c(%r12) : LWLockRelease(SerializableXactHashLock); 0.00 : 694817: 48 8b 3d e2 91 4e 00 mov 0x4e91e2(%rip),%rdi # b7da00 0.00 : 69481e: 48 81 c7 80 03 00 00 add $0x380,%rdi 0.00 : 694825: e8 76 ab ff ff callq 68f3a0 : * Flag the conflict. But first, if this conflict creates a dangerous : * structure, ereport an error. : */ : FlagRWConflict(MySerializableXact, sxact); : LWLockRelease(SerializableXactHashLock); : } 0.00 : 69482a: e9 6a fe ff ff jmpq 694699 0.00 : 69482f: 90 nop : */ : htsvResult = HeapTupleSatisfiesVacuum(tuple, TransactionXmin, buffer); : switch (htsvResult) : { : case HEAPTUPLE_LIVE: : if (visible) 0.00 : 694830: 45 84 ed test %r13b,%r13b 0.00 : 694833: 0f 85 60 fe ff ff jne 694699 : break; : case HEAPTUPLE_DELETE_IN_PROGRESS: : xid = HeapTupleHeaderGetUpdateXid(tuple->t_data); : break; : case HEAPTUPLE_INSERT_IN_PROGRESS: : xid = HeapTupleHeaderGetXmin(tuple->t_data); 0.00 : 694839: 49 8b 54 24 10 mov 0x10(%r12),%rdx : /* : * The only way to get to this default clause is if a new value is : * added to the enum type without adding it to this switch : * statement. That's a bug, so elog. : */ : elog(ERROR, "unrecognized return value from HeapTupleSatisfiesVacuum: %u", htsvResult); 0.00 : 69483e: bb 02 00 00 00 mov $0x2,%ebx : break; : case HEAPTUPLE_DELETE_IN_PROGRESS: : xid = HeapTupleHeaderGetUpdateXid(tuple->t_data); : break; : case HEAPTUPLE_INSERT_IN_PROGRESS: : xid = HeapTupleHeaderGetXmin(tuple->t_data); 0.00 : 694843: 0f b7 42 14 movzwl 0x14(%rdx),%eax 0.00 : 694847: 25 00 03 00 00 and $0x300,%eax 0.00 : 69484c: 3d 00 03 00 00 cmp $0x300,%eax 0.00 : 694851: 0f 84 15 ff ff ff je 69476c 0.00 : 694857: 8b 1a mov (%rdx),%ebx 0.00 : 694859: e9 0e ff ff ff jmpq 69476c 0.00 : 69485e: 66 90 xchg %ax,%ax : if (!visible) : return; : xid = HeapTupleHeaderGetUpdateXid(tuple->t_data); : break; : case HEAPTUPLE_DELETE_IN_PROGRESS: : xid = HeapTupleHeaderGetUpdateXid(tuple->t_data); 0.00 : 694860: 84 d2 test %dl,%dl 0.00 : 694862: 0f 88 01 ff ff ff js 694769 0.00 : 694868: e8 b3 28 e0 ff callq 497120 0.00 : 69486d: 89 c3 mov %eax,%ebx 0.00 : 69486f: 90 nop 0.00 : 694870: e9 f7 fe ff ff jmpq 69476c : /* This write was already in our snapshot; no conflict. */ : LWLockRelease(SerializableXactHashLock); : return; : } : : if (RWConflictExists(MySerializableXact, sxact)) 0.00 : 694875: 48 8b 3d 44 9e 4e 00 mov 0x4e9e44(%rip),%rdi # b7e6c0 0.00 : 69487c: 4c 89 e6 mov %r12,%rsi 0.00 : 69487f: e8 1c cc ff ff callq 6914a0 0.00 : 694884: 84 c0 test %al,%al 0.00 : 694886: 75 18 jne 6948a0 : : /* : * Flag the conflict. But first, if this conflict creates a dangerous : * structure, ereport an error. : */ : FlagRWConflict(MySerializableXact, sxact); 0.00 : 694888: 48 8b 3d 31 9e 4e 00 mov 0x4e9e31(%rip),%rdi # b7e6c0 0.00 : 69488f: 4c 89 e6 mov %r12,%rsi 0.00 : 694892: e8 79 c5 ff ff callq 690e10 0.00 : 694897: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 69489e: 00 00 : LWLockRelease(SerializableXactHashLock); 0.00 : 6948a0: 48 8b 3d 59 91 4e 00 mov 0x4e9159(%rip),%rdi # b7da00 0.00 : 6948a7: 48 81 c7 80 03 00 00 add $0x380,%rdi 0.00 : 6948ae: e8 ed aa ff ff callq 68f3a0 0.00 : 6948b3: e9 e1 fd ff ff jmpq 694699 : /* : * If this is a read-only transaction and the writing transaction has : * committed, and it doesn't have a rw-conflict to a transaction which : * committed before it, no conflict. : */ : if (SxactIsReadOnly(MySerializableXact) 0.00 : 6948b8: f6 41 7c 20 testb $0x20,0x7c(%rcx) 0.00 : 6948bc: 74 10 je 6948ce 0.00 : 6948be: 89 d0 mov %edx,%eax 0.00 : 6948c0: 25 01 04 00 00 and $0x401,%eax 0.00 : 6948c5: 83 e8 01 sub $0x1,%eax 0.00 : 6948c8: 0f 84 e9 01 00 00 je 694ab7 : uint32 i; : : Assert(TransactionIdIsValid(xid)); : Assert(!TransactionIdEquals(xid, GetTopTransactionIdIfAny())); : : snap = GetTransactionSnapshot(); 0.00 : 6948ce: e8 3d 2d 11 00 callq 7a7610 : : if (TransactionIdPrecedes(xid, snap->xmin)) 0.00 : 6948d3: 8b 70 08 mov 0x8(%rax),%esi 0.00 : 6948d6: 89 df mov %ebx,%edi : uint32 i; : : Assert(TransactionIdIsValid(xid)); : Assert(!TransactionIdEquals(xid, GetTopTransactionIdIfAny())); : : snap = GetTransactionSnapshot(); 0.00 : 6948d8: 49 89 c5 mov %rax,%r13 : : if (TransactionIdPrecedes(xid, snap->xmin)) 0.00 : 6948db: e8 00 b7 e2 ff callq 4bffe0 0.00 : 6948e0: 84 c0 test %al,%al 0.00 : 6948e2: 75 bc jne 6948a0 : return false; : : if (TransactionIdFollowsOrEquals(xid, snap->xmax)) 0.00 : 6948e4: 41 8b 75 0c mov 0xc(%r13),%esi 0.00 : 6948e8: 89 df mov %ebx,%edi 0.00 : 6948ea: e8 81 b7 e2 ff callq 4c0070 0.00 : 6948ef: 84 c0 test %al,%al 0.00 : 6948f1: 75 82 jne 694875 : return true; : : for (i = 0; i < snap->xcnt; i++) 0.00 : 6948f3: 41 8b 75 18 mov 0x18(%r13),%esi 0.00 : 6948f7: 85 f6 test %esi,%esi 0.00 : 6948f9: 74 a5 je 6948a0 : { : if (xid == snap->xip[i]) 0.00 : 6948fb: 49 8b 45 10 mov 0x10(%r13),%rax 0.00 : 6948ff: 31 d2 xor %edx,%edx 0.00 : 694901: 3b 18 cmp (%rax),%ebx 0.00 : 694903: 48 89 c1 mov %rax,%rcx 0.00 : 694906: 75 17 jne 69491f 0.00 : 694908: e9 68 ff ff ff jmpq 694875 0.00 : 69490d: 0f 1f 00 nopl (%rax) 0.00 : 694910: 8b 41 04 mov 0x4(%rcx),%eax 0.00 : 694913: 48 83 c1 04 add $0x4,%rcx 0.00 : 694917: 39 c3 cmp %eax,%ebx 0.00 : 694919: 0f 84 56 ff ff ff je 694875 : return false; : : if (TransactionIdFollowsOrEquals(xid, snap->xmax)) : return true; : : for (i = 0; i < snap->xcnt; i++) 0.00 : 69491f: 83 c2 01 add $0x1,%edx 0.00 : 694922: 39 f2 cmp %esi,%edx 0.00 : 694924: 72 ea jb 694910 0.00 : 694926: e9 75 ff ff ff jmpq 6948a0 0.00 : 69492b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : return; : : /* Check if someone else has already decided that we need to die */ : if (SxactIsDoomed(MySerializableXact)) : { : ereport(ERROR, 0.00 : 694930: 45 31 c0 xor %r8d,%r8d 0.00 : 694933: b9 e0 da 8a 00 mov $0x8adae0,%ecx 0.00 : 694938: ba 30 0f 00 00 mov $0xf30,%edx 0.00 : 69493d: be d3 d1 8a 00 mov $0x8ad1d3,%esi 0.00 : 694942: bf 14 00 00 00 mov $0x14,%edi 0.00 : 694947: e8 74 61 0e 00 callq 77aac0 0.00 : 69494c: 84 c0 test %al,%al 0.00 : 69494e: 0f 84 c5 fd ff ff je 694719 0.00 : 694954: bf c8 d2 8a 00 mov $0x8ad2c8,%edi 0.00 : 694959: 31 c0 xor %eax,%eax 0.00 : 69495b: e8 40 73 0e 00 callq 77bca0 0.00 : 694960: bf 48 d8 8a 00 mov $0x8ad848,%edi 0.00 : 694965: 41 89 c5 mov %eax,%r13d : return; : } : else : { : LWLockRelease(SerializableXactHashLock); : ereport(ERROR, 0.00 : 694968: 31 c0 xor %eax,%eax 0.00 : 69496a: e8 11 7a 0e 00 callq 77c380 0.00 : 69496f: 89 c3 mov %eax,%ebx 0.00 : 694971: bf 48 d3 8a 00 mov $0x8ad348,%edi 0.00 : 694976: 31 c0 xor %eax,%eax 0.00 : 694978: e8 23 7f 0e 00 callq 77c8a0 0.00 : 69497d: bf 04 00 00 01 mov $0x1000004,%edi 0.00 : 694982: 41 89 c4 mov %eax,%r12d 0.00 : 694985: e8 c6 83 0e 00 callq 77cd50 0.00 : 69498a: 44 89 e9 mov %r13d,%ecx 0.00 : 69498d: 89 c7 mov %eax,%edi 0.00 : 69498f: 89 da mov %ebx,%edx 0.00 : 694991: 44 89 e6 mov %r12d,%esi 0.00 : 694994: 31 c0 xor %eax,%eax 0.00 : 694996: e8 45 5c 0e 00 callq 77a5e0 0.00 : 69499b: e9 79 fd ff ff jmpq 694719 : SerCommitSeqNo val; : int slotno; : : Assert(TransactionIdIsValid(xid)); : : LWLockAcquire(OldSerXidLock, LW_SHARED); 0.00 : 6949a0: 48 8b 3d 59 90 4e 00 mov 0x4e9059(%rip),%rdi # b7da00 0.00 : 6949a7: be 01 00 00 00 mov $0x1,%esi 0.00 : 6949ac: 48 81 c7 e0 03 00 00 add $0x3e0,%rdi 0.00 : 6949b3: e8 38 b1 ff ff callq 68faf0 : headXid = oldSerXidControl->headXid; 0.00 : 6949b8: 48 8b 05 79 9d 4e 00 mov 0x4e9d79(%rip),%rax # b7e738 : tailXid = oldSerXidControl->tailXid; : LWLockRelease(OldSerXidLock); 0.00 : 6949bf: 48 8b 3d 3a 90 4e 00 mov 0x4e903a(%rip),%rdi # b7da00 : int slotno; : : Assert(TransactionIdIsValid(xid)); : : LWLockAcquire(OldSerXidLock, LW_SHARED); : headXid = oldSerXidControl->headXid; 0.00 : 6949c6: 44 8b 60 04 mov 0x4(%rax),%r12d : tailXid = oldSerXidControl->tailXid; : LWLockRelease(OldSerXidLock); 0.00 : 6949ca: 48 81 c7 e0 03 00 00 add $0x3e0,%rdi : : Assert(TransactionIdIsValid(xid)); : : LWLockAcquire(OldSerXidLock, LW_SHARED); : headXid = oldSerXidControl->headXid; : tailXid = oldSerXidControl->tailXid; 0.00 : 6949d1: 44 8b 68 08 mov 0x8(%rax),%r13d : LWLockRelease(OldSerXidLock); 0.00 : 6949d5: e8 c6 a9 ff ff callq 68f3a0 : : if (!TransactionIdIsValid(headXid)) 0.00 : 6949da: 45 85 e4 test %r12d,%r12d 0.00 : 6949dd: 0f 84 bd fe ff ff je 6948a0 : return 0; : : Assert(TransactionIdIsValid(tailXid)); : : if (TransactionIdPrecedes(xid, tailXid) 0.00 : 6949e3: 44 89 ee mov %r13d,%esi 0.00 : 6949e6: 89 df mov %ebx,%edi 0.00 : 6949e8: e8 f3 b5 e2 ff callq 4bffe0 0.00 : 6949ed: 84 c0 test %al,%al 0.00 : 6949ef: 0f 85 ab fe ff ff jne 6948a0 0.00 : 6949f5: 44 89 e6 mov %r12d,%esi 0.00 : 6949f8: 89 df mov %ebx,%edi 0.00 : 6949fa: e8 41 b6 e2 ff callq 4c0040 0.00 : 6949ff: 84 c0 test %al,%al 0.00 : 694a01: 0f 85 99 fe ff ff jne 6948a0 : : /* : * The following function must be called without holding OldSerXidLock, : * but will return with that lock held, which must then be released. : */ : slotno = SimpleLruReadPage_ReadOnly(OldSerXidSlruCtl, 0.00 : 694a07: 89 de mov %ebx,%esi 0.00 : 694a09: 89 da mov %ebx,%edx 0.00 : 694a0b: bf e0 e6 b7 00 mov $0xb7e6e0,%edi 0.00 : 694a10: c1 ee 0a shr $0xa,%esi 0.00 : 694a13: 81 e6 ff ff 1f 00 and $0x1fffff,%esi 0.00 : 694a19: e8 02 1a e3 ff callq 4c6420 : OldSerXidPage(xid), xid); : val = OldSerXidValue(slotno, xid); 0.00 : 694a1e: 48 8b 15 bb 9c 4e 00 mov 0x4e9cbb(%rip),%rdx # b7e6e0 0.00 : 694a25: 48 98 cltq 0.00 : 694a27: 48 89 d9 mov %rbx,%rcx 0.00 : 694a2a: 81 e1 ff 03 00 00 and $0x3ff,%ecx : LWLockRelease(OldSerXidLock); 0.00 : 694a30: 48 8b 3d c9 8f 4e 00 mov 0x4e8fc9(%rip),%rdi # b7da00 : * The following function must be called without holding OldSerXidLock, : * but will return with that lock held, which must then be released. : */ : slotno = SimpleLruReadPage_ReadOnly(OldSerXidSlruCtl, : OldSerXidPage(xid), xid); : val = OldSerXidValue(slotno, xid); 0.00 : 694a37: 48 8b 52 10 mov 0x10(%rdx),%rdx : LWLockRelease(OldSerXidLock); 0.00 : 694a3b: 48 81 c7 e0 03 00 00 add $0x3e0,%rdi : * The following function must be called without holding OldSerXidLock, : * but will return with that lock held, which must then be released. : */ : slotno = SimpleLruReadPage_ReadOnly(OldSerXidSlruCtl, : OldSerXidPage(xid), xid); : val = OldSerXidValue(slotno, xid); 0.00 : 694a42: 48 8b 04 c2 mov (%rdx,%rax,8),%rax 0.00 : 694a46: 4c 8b 24 c8 mov (%rax,%rcx,8),%r12 : LWLockRelease(OldSerXidLock); 0.00 : 694a4a: e8 51 a9 ff ff callq 68f3a0 : * got pushed out to SLRU storage for "old committed" transactions. : */ : SerCommitSeqNo conflictCommitSeqNo; : : conflictCommitSeqNo = OldSerXidGetMinConflictCommitSeqNo(xid); : if (conflictCommitSeqNo != 0) 0.00 : 694a4f: 4d 85 e4 test %r12,%r12 0.00 : 694a52: 0f 84 48 fe ff ff je 6948a0 : { : if (conflictCommitSeqNo != InvalidSerCommitSeqNo 0.00 : 694a58: 49 83 fc ff cmp $0xffffffffffffffff,%r12 0.00 : 694a5c: 74 77 je 694ad5 0.00 : 694a5e: 48 8b 05 5b 9c 4e 00 mov 0x4e9c5b(%rip),%rax # b7e6c0 0.00 : 694a65: f6 40 7c 20 testb $0x20,0x7c(%rax) 0.00 : 694a69: 74 06 je 694a71 0.00 : 694a6b: 4c 39 60 18 cmp %r12,0x18(%rax) 0.00 : 694a6f: 72 6b jb 694adc : && (!SxactIsReadOnly(MySerializableXact) : || conflictCommitSeqNo : <= MySerializableXact->SeqNo.lastCommitBeforeSnapshot)) : ereport(ERROR, 0.00 : 694a71: 45 31 c0 xor %r8d,%r8d 0.00 : 694a74: b9 e0 da 8a 00 mov $0x8adae0,%ecx 0.00 : 694a79: ba 89 0f 00 00 mov $0xf89,%edx 0.00 : 694a7e: be d3 d1 8a 00 mov $0x8ad1d3,%esi 0.00 : 694a83: bf 14 00 00 00 mov $0x14,%edi 0.00 : 694a88: e8 33 60 0e 00 callq 77aac0 0.00 : 694a8d: 84 c0 test %al,%al 0.00 : 694a8f: 0f 84 84 fc ff ff je 694719 0.00 : 694a95: bf c8 d2 8a 00 mov $0x8ad2c8,%edi 0.00 : 694a9a: 31 c0 xor %eax,%eax 0.00 : 694a9c: e8 ff 71 0e 00 callq 77bca0 0.00 : 694aa1: 89 de mov %ebx,%esi 0.00 : 694aa3: 41 89 c5 mov %eax,%r13d 0.00 : 694aa6: bf e0 d8 8a 00 mov $0x8ad8e0,%edi 0.00 : 694aab: 31 c0 xor %eax,%eax 0.00 : 694aad: e8 ce 78 0e 00 callq 77c380 0.00 : 694ab2: e9 b8 fe ff ff jmpq 69496f : /* : * If this is a read-only transaction and the writing transaction has : * committed, and it doesn't have a rw-conflict to a transaction which : * committed before it, no conflict. : */ : if (SxactIsReadOnly(MySerializableXact) 0.00 : 694ab7: 83 e2 10 and $0x10,%edx 0.00 : 694aba: 0f 84 e0 fd ff ff je 6948a0 0.00 : 694ac0: 49 8b 44 24 18 mov 0x18(%r12),%rax 0.00 : 694ac5: 48 39 41 18 cmp %rax,0x18(%rcx) 0.00 : 694ac9: 0f 83 ff fd ff ff jae 6948ce 0.00 : 694acf: 90 nop 0.00 : 694ad0: e9 cb fd ff ff jmpq 6948a0 0.00 : 694ad5: 48 8b 05 e4 9b 4e 00 mov 0x4e9be4(%rip),%rax # b7e6c0 : (errcode(ERRCODE_T_R_SERIALIZATION_FAILURE), : errmsg("could not serialize access due to read/write dependencies among transactions"), : errdetail_internal("Reason code: Canceled on conflict out to old pivot %u.", xid), : errhint("The transaction might succeed if retried."))); : : if (SxactHasSummaryConflictIn(MySerializableXact) 0.00 : 694adc: f6 40 7d 02 testb $0x2,0x7d(%rax) 0.00 : 694ae0: 75 0d jne 694aef 0.00 : 694ae2: 48 8d 78 30 lea 0x30(%rax),%rdi 0.00 : 694ae6: e8 25 ea fe ff callq 683510 0.00 : 694aeb: 84 c0 test %al,%al 0.00 : 694aed: 75 46 jne 694b35 : || !SHMQueueEmpty(&MySerializableXact->inConflicts)) : ereport(ERROR, 0.00 : 694aef: 45 31 c0 xor %r8d,%r8d 0.00 : 694af2: b9 e0 da 8a 00 mov $0x8adae0,%ecx 0.00 : 694af7: ba 91 0f 00 00 mov $0xf91,%edx 0.00 : 694afc: be d3 d1 8a 00 mov $0x8ad1d3,%esi 0.00 : 694b01: bf 14 00 00 00 mov $0x14,%edi 0.00 : 694b06: e8 b5 5f 0e 00 callq 77aac0 0.00 : 694b0b: 84 c0 test %al,%al 0.00 : 694b0d: 0f 84 06 fc ff ff je 694719 0.00 : 694b13: bf c8 d2 8a 00 mov $0x8ad2c8,%edi 0.00 : 694b18: 31 c0 xor %eax,%eax 0.00 : 694b1a: e8 81 71 0e 00 callq 77bca0 0.00 : 694b1f: 89 de mov %ebx,%esi 0.00 : 694b21: 41 89 c5 mov %eax,%r13d 0.00 : 694b24: bf 18 d9 8a 00 mov $0x8ad918,%edi 0.00 : 694b29: 31 c0 xor %eax,%eax 0.00 : 694b2b: e8 50 78 0e 00 callq 77c380 0.00 : 694b30: e9 3a fe ff ff jmpq 69496f : (errcode(ERRCODE_T_R_SERIALIZATION_FAILURE), : errmsg("could not serialize access due to read/write dependencies among transactions"), : errdetail_internal("Reason code: Canceled on identification as a pivot, with conflict out to old committed transaction %u.", xid), : errhint("The transaction might succeed if retried."))); : : MySerializableXact->flags |= SXACT_FLAG_SUMMARY_CONFLICT_OUT; 0.00 : 694b35: 48 8b 05 84 9b 4e 00 mov 0x4e9b84(%rip),%rax # b7e6c0 0.00 : 694b3c: 81 48 7c 00 04 00 00 orl $0x400,0x7c(%rax) 0.00 : 694b43: e9 58 fd ff ff jmpq 6948a0 : LWLockRelease(SerializableXactHashLock); : return; : } : else : { : LWLockRelease(SerializableXactHashLock); 0.00 : 694b48: 48 8b 3d b1 8e 4e 00 mov 0x4e8eb1(%rip),%rdi # b7da00 0.00 : 694b4f: 48 81 c7 80 03 00 00 add $0x380,%rdi 0.00 : 694b56: e8 45 a8 ff ff callq 68f3a0 : ereport(ERROR, 0.00 : 694b5b: 45 31 c0 xor %r8d,%r8d 0.00 : 694b5e: b9 e0 da 8a 00 mov $0x8adae0,%ecx 0.00 : 694b63: ba b8 0f 00 00 mov $0xfb8,%edx 0.00 : 694b68: be d3 d1 8a 00 mov $0x8ad1d3,%esi 0.00 : 694b6d: bf 14 00 00 00 mov $0x14,%edi 0.00 : 694b72: e8 49 5f 0e 00 callq 77aac0 0.00 : 694b77: 84 c0 test %al,%al 0.00 : 694b79: 0f 84 9a fb ff ff je 694719 0.00 : 694b7f: bf c8 d2 8a 00 mov $0x8ad2c8,%edi 0.00 : 694b84: 31 c0 xor %eax,%eax 0.00 : 694b86: e8 15 71 0e 00 callq 77bca0 0.00 : 694b8b: bf 80 d9 8a 00 mov $0x8ad980,%edi 0.00 : 694b90: 41 89 c5 mov %eax,%r13d 0.00 : 694b93: e9 d0 fd ff ff jmpq 694968 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 66.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:855 33.33 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:881 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000784050 : : hash_search_with_hash_value(HTAB *hashp, : const void *keyPtr, : uint32 hashvalue, : HASHACTION action, : bool *foundPtr) : { 0.00 : 784050: 55 push %rbp 0.00 : 784051: 48 89 e5 mov %rsp,%rbp 0.00 : 784054: 41 57 push %r15 0.00 : 784056: 41 89 d7 mov %edx,%r15d 0.00 : 784059: 41 56 push %r14 0.00 : 78405b: 49 89 fe mov %rdi,%r14 0.00 : 78405e: 41 55 push %r13 0.00 : 784060: 41 54 push %r12 0.00 : 784062: 53 push %rbx 0.00 : 784063: 48 83 ec 68 sub $0x68,%rsp 0.00 : 784067: 89 8d 7c ff ff ff mov %ecx,-0x84(%rbp) 0.00 : 78406d: 48 89 75 80 mov %rsi,-0x80(%rbp) 0.00 : 784071: 4c 89 85 70 ff ff ff mov %r8,-0x90(%rbp) : HASHHDR *hctl = hashp->hctl; 0.00 : 784078: 48 8b 07 mov (%rdi),%rax : * NOTE: failure to expand table is not a fatal error, it just means we : * have to run at higher fill factor than we wanted. However, if we're : * using the palloc allocator then it will throw error anyway on : * out-of-memory, so we must do this before modifying the table. : */ : if (action == HASH_ENTER || action == HASH_ENTER_NULL) 0.00 : 78407b: 83 f9 03 cmp $0x3,%ecx 0.00 : 78407e: 0f 94 45 8f sete -0x71(%rbp) 0.00 : 784082: 83 e9 01 sub $0x1,%ecx : const void *keyPtr, : uint32 hashvalue, : HASHACTION action, : bool *foundPtr) : { : HASHHDR *hctl = hashp->hctl; 0.00 : 784085: 48 89 45 90 mov %rax,-0x70(%rbp) : * NOTE: failure to expand table is not a fatal error, it just means we : * have to run at higher fill factor than we wanted. However, if we're : * using the palloc allocator then it will throw error anyway on : * out-of-memory, so we must do this before modifying the table. : */ : if (action == HASH_ENTER || action == HASH_ENTER_NULL) 0.00 : 784089: 0f 84 d9 00 00 00 je 784168 0.00 : 78408f: 80 7d 8f 00 cmpb $0x0,-0x71(%rbp) 0.00 : 784093: 0f 85 cf 00 00 00 jne 784168 : newlink = &currElement->link; : } : } : /* don't forget to terminate the rebuilt hash chains... */ : *oldlink = NULL; : *newlink = NULL; 0.00 : 784099: 8b 70 28 mov 0x28(%rax),%esi 0.00 : 78409c: 49 8b 46 50 mov 0x50(%r14),%rax 0.00 : 7840a0: 41 8b 4e 58 mov 0x58(%r14),%ecx 0.00 : 7840a4: 4c 8d 68 ff lea -0x1(%rax),%r13 : static inline uint32 : calc_bucket(HASHHDR *hctl, uint32 hash_val) : { : uint32 bucket; : : bucket = hash_val & hctl->high_mask; 0.00 : 7840a8: 48 8b 55 90 mov -0x70(%rbp),%rdx 0.00 : 7840ac: 44 89 fb mov %r15d,%ebx 0.00 : 7840af: 23 5a 2c and 0x2c(%rdx),%ebx : if (bucket > hctl->max_bucket) 0.00 : 7840b2: 39 f3 cmp %esi,%ebx 0.00 : 7840b4: 76 03 jbe 7840b9 : bucket = bucket & hctl->low_mask; 0.00 : 7840b6: 23 5a 30 and 0x30(%rdx),%ebx : bucket = calc_bucket(hctl, hashvalue); : : segment_num = bucket >> hashp->sshift; : segment_ndx = MOD(bucket, hashp->ssize); : : segp = hashp->dir[segment_num]; 0.00 : 7840b9: 89 d8 mov %ebx,%eax 0.00 : 7840bb: 49 8b 56 08 mov 0x8(%r14),%rdx 0.00 : 7840bf: d3 e8 shr %cl,%eax 0.00 : 7840c1: 89 c0 mov %eax,%eax 0.00 : 7840c3: 4c 8b 24 c2 mov (%rdx,%rax,8),%r12 : : if (segp == NULL) 0.00 : 7840c7: 4d 85 e4 test %r12,%r12 0.00 : 7840ca: 0f 84 b7 02 00 00 je 784387 : hash_corrupted(hashp); : : prevBucketPtr = &segp[segment_ndx]; 0.00 : 7840d0: 89 d8 mov %ebx,%eax 0.00 : 7840d2: 44 21 e8 and %r13d,%eax : currBucket = *prevBucketPtr; : : /* : * Follow collision chain looking for matching key : */ : match = hashp->match; /* save one fetch in inner loop */ 0.00 : 7840d5: 4d 8b 6e 18 mov 0x18(%r14),%r13 : segp = hashp->dir[segment_num]; : : if (segp == NULL) : hash_corrupted(hashp); : : prevBucketPtr = &segp[segment_ndx]; 0.00 : 7840d9: 4d 8d 24 c4 lea (%r12,%rax,8),%r12 : : /* : * Follow collision chain looking for matching key : */ : match = hashp->match; /* save one fetch in inner loop */ : keysize = hashp->keysize; /* ditto */ 0.00 : 7840dd: 49 8b 46 48 mov 0x48(%r14),%rax : : if (segp == NULL) : hash_corrupted(hashp); : : prevBucketPtr = &segp[segment_ndx]; : currBucket = *prevBucketPtr; 0.00 : 7840e1: 49 8b 1c 24 mov (%r12),%rbx : : /* : * Follow collision chain looking for matching key : */ : match = hashp->match; /* save one fetch in inner loop */ : keysize = hashp->keysize; /* ditto */ /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:881 33.33 : 7840e5: 48 89 45 98 mov %rax,-0x68(%rbp) : : while (currBucket != NULL) 0.00 : 7840e9: 48 85 db test %rbx,%rbx 0.00 : 7840ec: 75 0d jne 7840fb 0.00 : 7840ee: eb 28 jmp 784118 : { : if (currBucket->hashvalue == hashvalue && : match(ELEMENTKEY(currBucket), keyPtr, keysize) == 0) : break; : prevBucketPtr = &(currBucket->link); 0.00 : 7840f0: 49 89 dc mov %rbx,%r12 : currBucket = *prevBucketPtr; 0.00 : 7840f3: 48 8b 1b mov (%rbx),%rbx : * Follow collision chain looking for matching key : */ : match = hashp->match; /* save one fetch in inner loop */ : keysize = hashp->keysize; /* ditto */ : : while (currBucket != NULL) 0.00 : 7840f6: 48 85 db test %rbx,%rbx 0.00 : 7840f9: 74 1d je 784118 : { : if (currBucket->hashvalue == hashvalue && 0.00 : 7840fb: 44 39 7b 08 cmp %r15d,0x8(%rbx) 0.00 : 7840ff: 90 nop 0.00 : 784100: 75 ee jne 7840f0 0.00 : 784102: 48 8d 7b 10 lea 0x10(%rbx),%rdi 0.00 : 784106: 48 8b 55 98 mov -0x68(%rbp),%rdx 0.00 : 78410a: 48 8b 75 80 mov -0x80(%rbp),%rsi 0.00 : 78410e: 41 ff d5 callq *%r13 0.00 : 784111: 85 c0 test %eax,%eax 0.00 : 784113: 75 db jne 7840f0 0.00 : 784115: 0f 1f 00 nopl (%rax) : hash_collisions++; : hctl->collisions++; : #endif : } : : if (foundPtr) 0.00 : 784118: 48 83 bd 70 ff ff ff cmpq $0x0,-0x90(%rbp) 0.00 : 78411f: 00 0.00 : 784120: 74 0d je 78412f : *foundPtr = (bool) (currBucket != NULL); 0.00 : 784122: 48 8b 95 70 ff ff ff mov -0x90(%rbp),%rdx 0.00 : 784129: 48 85 db test %rbx,%rbx 0.00 : 78412c: 0f 95 02 setne (%rdx) : : /* : * OK, now what? : */ : switch (action) 0.00 : 78412f: 83 bd 7c ff ff ff 01 cmpl $0x1,-0x84(%rbp) 0.00 : 784136: 0f 84 5c 01 00 00 je 784298 0.00 : 78413c: 0f 83 ee 00 00 00 jae 784230 : { : case HASH_FIND: : if (currBucket != NULL) 0.00 : 784142: 48 85 db test %rbx,%rbx 0.00 : 784145: 0f 84 35 02 00 00 je 784380 : /* FALL THRU */ : : case HASH_ENTER: : /* Return existing element if found, else create one */ : if (currBucket != NULL) : return (void *) ELEMENTKEY(currBucket); 0.00 : 78414b: 48 83 c3 10 add $0x10,%rbx : } : : elog(ERROR, "unrecognized hash action code: %d", (int) action); : : return NULL; /* keep compiler quiet */ : } 0.00 : 78414f: 48 83 c4 68 add $0x68,%rsp 0.00 : 784153: 48 89 d8 mov %rbx,%rax 0.00 : 784156: 5b pop %rbx 0.00 : 784157: 41 5c pop %r12 0.00 : 784159: 41 5d pop %r13 0.00 : 78415b: 41 5e pop %r14 0.00 : 78415d: 41 5f pop %r15 0.00 : 78415f: c9 leaveq 0.00 : 784160: c3 retq 0.00 : 784161: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : /* : * Can't split if running in partitioned mode, nor if frozen, nor if : * table is the subject of any active hash_seq_search scans. Strange : * order of these tests is to try to check cheaper conditions first. : */ : if (!IS_PARTITIONED(hctl) && !hashp->frozen && 0.00 : 784168: 48 8b 55 90 mov -0x70(%rbp),%rdx 0.00 : 78416c: 48 83 7a 48 00 cmpq $0x0,0x48(%rdx) 0.00 : 784171: 0f 85 09 01 00 00 jne 784280 0.00 : 784177: 41 80 7e 42 00 cmpb $0x0,0x42(%r14) 0.00 : 78417c: 0f 85 e6 01 00 00 jne 784368 0.00 : 784182: 48 8b 45 90 mov -0x70(%rbp),%rax 0.00 : 784186: 48 8b 5d 90 mov -0x70(%rbp),%rbx 0.00 : 78418a: 8b 70 28 mov 0x28(%rax),%esi 0.00 : 78418d: 8d 56 01 lea 0x1(%rsi),%edx 0.00 : 784190: 41 89 f0 mov %esi,%r8d 0.00 : 784193: 89 55 d4 mov %edx,-0x2c(%rbp) 0.00 : 784196: 41 89 d4 mov %edx,%r12d 0.00 : 784199: 48 8b 50 08 mov 0x8(%rax),%rdx 0.00 : 78419d: 48 89 d0 mov %rdx,%rax 0.00 : 7841a0: 48 c1 fa 3f sar $0x3f,%rdx 0.00 : 7841a4: 49 f7 fc idiv %r12 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:855 66.67 : 7841a7: 48 3b 43 50 cmp 0x50(%rbx),%rax 0.00 : 7841ab: 0f 8c eb fe ff ff jl 78409c : static bool : has_seq_scans(HTAB *hashp) : { : int i; : : for (i = 0; i < num_seq_scans; i++) 0.00 : 7841b1: 8b 3d 09 5a 43 00 mov 0x435a09(%rip),%edi # bb9bc0 0.00 : 7841b7: 85 ff test %edi,%edi 0.00 : 7841b9: 7e 2c jle 7841e7 : { : if (seq_scan_tables[i] == hashp) 0.00 : 7841bb: 31 d2 xor %edx,%edx 0.00 : 7841bd: 4c 3b 35 1c 5a 43 00 cmp 0x435a1c(%rip),%r14 # bb9be0 0.00 : 7841c4: b9 e8 9b bb 00 mov $0xbb9be8,%ecx 0.00 : 7841c9: 75 15 jne 7841e0 0.00 : 7841cb: e9 cc fe ff ff jmpq 78409c 0.00 : 7841d0: 48 8b 01 mov (%rcx),%rax 0.00 : 7841d3: 48 83 c1 08 add $0x8,%rcx 0.00 : 7841d7: 49 39 c6 cmp %rax,%r14 0.00 : 7841da: 0f 84 bc fe ff ff je 78409c : static bool : has_seq_scans(HTAB *hashp) : { : int i; : : for (i = 0; i < num_seq_scans; i++) 0.00 : 7841e0: 83 c2 01 add $0x1,%edx 0.00 : 7841e3: 39 fa cmp %edi,%edx 0.00 : 7841e5: 7c e9 jl 7841d0 : hash_expansions++; : #endif : : new_bucket = hctl->max_bucket + 1; : new_segnum = new_bucket >> hashp->sshift; : new_segndx = MOD(new_bucket, hashp->ssize); 0.00 : 7841e7: 49 8b 46 50 mov 0x50(%r14),%rax : #ifdef HASH_STATISTICS : hash_expansions++; : #endif : : new_bucket = hctl->max_bucket + 1; : new_segnum = new_bucket >> hashp->sshift; 0.00 : 7841eb: 41 8b 4e 58 mov 0x58(%r14),%ecx 0.00 : 7841ef: 4c 89 e3 mov %r12,%rbx : new_segndx = MOD(new_bucket, hashp->ssize); 0.00 : 7841f2: 4c 8d 68 ff lea -0x1(%rax),%r13 : : if (new_segnum >= hctl->nsegs) 0.00 : 7841f6: 48 8b 45 90 mov -0x70(%rbp),%rax : #ifdef HASH_STATISTICS : hash_expansions++; : #endif : : new_bucket = hctl->max_bucket + 1; : new_segnum = new_bucket >> hashp->sshift; 0.00 : 7841fa: 48 d3 fb sar %cl,%rbx 0.00 : 7841fd: 48 89 5d c0 mov %rbx,-0x40(%rbp) : new_segndx = MOD(new_bucket, hashp->ssize); : : if (new_segnum >= hctl->nsegs) 0.00 : 784201: 48 3b 58 20 cmp 0x20(%rax),%rbx 0.00 : 784205: 0f 8c 05 02 00 00 jl 784410 : { : /* Allocate new segment if necessary -- could fail if dir full */ : if (new_segnum >= hctl->dsize) 0.00 : 78420b: 48 8b 45 90 mov -0x70(%rbp),%rax 0.00 : 78420f: 48 8b 58 18 mov 0x18(%rax),%rbx 0.00 : 784213: 48 39 5d c0 cmp %rbx,-0x40(%rbp) 0.00 : 784217: 0f 8c 1d 03 00 00 jl 78453a : HASHSEGMENT *old_p; : long new_dsize; : long old_dirsize; : long new_dirsize; : : if (hashp->hctl->max_dsize != NO_MAX_DSIZE) 0.00 : 78421d: 48 83 78 58 ff cmpq $0xffffffffffffffff,0x58(%rax) 0.00 : 784222: 0f 84 4a 03 00 00 je 784572 : hashp->dir = p; : hashp->hctl->dsize = new_dsize; : : /* XXX assume the allocator is palloc, so we know how to free */ : Assert(hashp->alloc == DynaHashAlloc); : pfree(old_p); 0.00 : 784228: 44 89 c6 mov %r8d,%esi 0.00 : 78422b: e9 78 fe ff ff jmpq 7840a8 : *foundPtr = (bool) (currBucket != NULL); : : /* : * OK, now what? : */ : switch (action) 0.00 : 784230: 83 bd 7c ff ff ff 02 cmpl $0x2,-0x84(%rbp) 0.00 : 784237: 0f 84 d6 00 00 00 je 784313 0.00 : 78423d: 83 bd 7c ff ff ff 03 cmpl $0x3,-0x84(%rbp) 0.00 : 784244: 74 52 je 784298 : */ : : return (void *) ELEMENTKEY(currBucket); : } : : elog(ERROR, "unrecognized hash action code: %d", (int) action); 0.00 : 784246: ba f0 5b 8d 00 mov $0x8d5bf0,%edx 0.00 : 78424b: be df 03 00 00 mov $0x3df,%esi 0.00 : 784250: bf 33 59 8d 00 mov $0x8d5933,%edi 0.00 : 784255: e8 c6 71 ff ff callq 77b420 0.00 : 78425a: 8b 95 7c ff ff ff mov -0x84(%rbp),%edx 0.00 : 784260: be f0 5a 8d 00 mov $0x8d5af0,%esi 0.00 : 784265: bf 14 00 00 00 mov $0x14,%edi 0.00 : 78426a: 31 c0 xor %eax,%eax 0.00 : 78426c: e8 bf 6f ff ff callq 77b230 0.00 : 784271: e8 5a 52 ce ff callq 4694d0 0.00 : 784276: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 78427d: 00 00 00 : /* : * Can't split if running in partitioned mode, nor if frozen, nor if : * table is the subject of any active hash_seq_search scans. Strange : * order of these tests is to try to check cheaper conditions first. : */ : if (!IS_PARTITIONED(hctl) && !hashp->frozen && 0.00 : 784280: 49 8b 46 50 mov 0x50(%r14),%rax 0.00 : 784284: 8b 72 28 mov 0x28(%rdx),%esi 0.00 : 784287: 41 8b 4e 58 mov 0x58(%r14),%ecx 0.00 : 78428b: 4c 8d 68 ff lea -0x1(%rax),%r13 0.00 : 78428f: e9 14 fe ff ff jmpq 7840a8 0.00 : 784294: 0f 1f 40 00 nopl 0x0(%rax) : Assert(hashp->alloc != DynaHashAlloc); : /* FALL THRU */ : : case HASH_ENTER: : /* Return existing element if found, else create one */ : if (currBucket != NULL) 0.00 : 784298: 48 85 db test %rbx,%rbx 0.00 : 78429b: 0f 85 aa fe ff ff jne 78414b : return (void *) ELEMENTKEY(currBucket); : : /* disallow inserts if frozen */ : if (hashp->frozen) 0.00 : 7842a1: 41 80 7e 42 00 cmpb $0x0,0x42(%r14) 0.00 : 7842a6: 0f 85 a3 03 00 00 jne 78464f : */ : static HASHBUCKET : get_hash_entry(HTAB *hashp) : { : /* use volatile pointer to prevent code rearrangement */ : volatile HASHHDR *hctlv = hashp->hctl; 0.00 : 7842ac: 49 8b 1e mov (%r14),%rbx : static __inline__ int : tas(volatile slock_t *lock) : { : register slock_t _res = 1; : : __asm__ __volatile__( 0.00 : 7842af: 41 bd 01 00 00 00 mov $0x1,%r13d 0.00 : 7842b5: eb 35 jmp 7842ec 0.00 : 7842b7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 7842be: 00 00 : /* if partitioned, must lock to touch nentries and freeList */ : if (IS_PARTITIONED(hctlv)) : SpinLockAcquire(&hctlv->mutex); : : /* try to get an entry from the freelist */ : newElement = hctlv->freeList; 0.00 : 7842c0: 48 8b 53 10 mov 0x10(%rbx),%rdx : if (newElement != NULL) 0.00 : 7842c4: 48 85 d2 test %rdx,%rdx 0.00 : 7842c7: 0f 85 04 02 00 00 jne 7844d1 : break; : : /* no free elements. allocate another chunk of buckets */ : if (IS_PARTITIONED(hctlv)) 0.00 : 7842cd: 48 8b 43 48 mov 0x48(%rbx),%rax 0.00 : 7842d1: 48 85 c0 test %rax,%rax 0.00 : 7842d4: 74 03 je 7842d9 : SpinLockRelease(&hctlv->mutex); 0.00 : 7842d6: c6 03 00 movb $0x0,(%rbx) : : if (!element_alloc(hashp, hctlv->nelem_alloc)) 0.00 : 7842d9: 8b 73 6c mov 0x6c(%rbx),%esi 0.00 : 7842dc: 4c 89 f7 mov %r14,%rdi 0.00 : 7842df: e8 dc fb ff ff callq 783ec0 0.00 : 7842e4: 84 c0 test %al,%al 0.00 : 7842e6: 0f 84 be 00 00 00 je 7843aa : HASHBUCKET newElement; : : for (;;) : { : /* if partitioned, must lock to touch nentries and freeList */ : if (IS_PARTITIONED(hctlv)) 0.00 : 7842ec: 48 8b 43 48 mov 0x48(%rbx),%rax 0.00 : 7842f0: 48 85 c0 test %rax,%rax 0.00 : 7842f3: 74 cb je 7842c0 0.00 : 7842f5: 44 89 e8 mov %r13d,%eax 0.00 : 7842f8: f0 86 03 lock xchg %al,(%rbx) : SpinLockAcquire(&hctlv->mutex); 0.00 : 7842fb: 84 c0 test %al,%al 0.00 : 7842fd: 74 c1 je 7842c0 0.00 : 7842ff: ba 87 04 00 00 mov $0x487,%edx 0.00 : 784304: be 33 59 8d 00 mov $0x8d5933,%esi 0.00 : 784309: 48 89 df mov %rbx,%rdi 0.00 : 78430c: e8 2f bd f0 ff callq 690040 0.00 : 784311: eb ad jmp 7842c0 : if (currBucket != NULL) : return (void *) ELEMENTKEY(currBucket); : return NULL; : : case HASH_REMOVE: : if (currBucket != NULL) 0.00 : 784313: 48 85 db test %rbx,%rbx 0.00 : 784316: 74 68 je 784380 : { : /* use volatile pointer to prevent code rearrangement */ : volatile HASHHDR *hctlv = hctl; : : /* if partitioned, must lock to touch nentries and freeList */ : if (IS_PARTITIONED(hctlv)) 0.00 : 784318: 48 8b 55 90 mov -0x70(%rbp),%rdx 0.00 : 78431c: 48 8b 42 48 mov 0x48(%rdx),%rax 0.00 : 784320: 48 85 c0 test %rax,%rax 0.00 : 784323: 74 0c je 784331 0.00 : 784325: b8 01 00 00 00 mov $0x1,%eax 0.00 : 78432a: f0 86 02 lock xchg %al,(%rdx) : SpinLockAcquire(&hctlv->mutex); 0.00 : 78432d: 84 c0 test %al,%al 0.00 : 78432f: 75 64 jne 784395 : : Assert(hctlv->nentries > 0); : hctlv->nentries--; 0.00 : 784331: 48 8b 55 90 mov -0x70(%rbp),%rdx 0.00 : 784335: 48 8b 42 08 mov 0x8(%rdx),%rax 0.00 : 784339: 48 83 e8 01 sub $0x1,%rax 0.00 : 78433d: 48 89 42 08 mov %rax,0x8(%rdx) : : /* remove record from hash bucket's chain. */ : *prevBucketPtr = currBucket->link; 0.00 : 784341: 48 8b 03 mov (%rbx),%rax 0.00 : 784344: 49 89 04 24 mov %rax,(%r12) : : /* add the record to the freelist for this table. */ : currBucket->link = hctlv->freeList; 0.00 : 784348: 48 8b 42 10 mov 0x10(%rdx),%rax 0.00 : 78434c: 48 89 03 mov %rax,(%rbx) : hctlv->freeList = currBucket; 0.00 : 78434f: 48 89 5a 10 mov %rbx,0x10(%rdx) : : if (IS_PARTITIONED(hctlv)) 0.00 : 784353: 48 8b 42 48 mov 0x48(%rdx),%rax 0.00 : 784357: 48 85 c0 test %rax,%rax 0.00 : 78435a: 0f 84 eb fd ff ff je 78414b : SpinLockRelease(&hctlv->mutex); 0.00 : 784360: c6 02 00 movb $0x0,(%rdx) 0.00 : 784363: e9 e3 fd ff ff jmpq 78414b : /* : * Can't split if running in partitioned mode, nor if frozen, nor if : * table is the subject of any active hash_seq_search scans. Strange : * order of these tests is to try to check cheaper conditions first. : */ : if (!IS_PARTITIONED(hctl) && !hashp->frozen && 0.00 : 784368: 48 8b 5d 90 mov -0x70(%rbp),%rbx 0.00 : 78436c: 49 8b 46 50 mov 0x50(%r14),%rax 0.00 : 784370: 41 8b 4e 58 mov 0x58(%r14),%ecx 0.00 : 784374: 8b 73 28 mov 0x28(%rbx),%esi 0.00 : 784377: 4c 8d 68 ff lea -0x1(%rax),%r13 0.00 : 78437b: e9 28 fd ff ff jmpq 7840a8 : */ : : return (void *) ELEMENTKEY(currBucket); : } : : elog(ERROR, "unrecognized hash action code: %d", (int) action); 0.00 : 784380: 31 db xor %ebx,%ebx 0.00 : 784382: e9 c8 fd ff ff jmpq 78414f : segment_ndx = MOD(bucket, hashp->ssize); : : segp = hashp->dir[segment_num]; : : if (segp == NULL) : hash_corrupted(hashp); 0.00 : 784387: 4c 89 f7 mov %r14,%rdi 0.00 : 78438a: e8 01 f8 ff ff callq 783b90 0.00 : 78438f: 90 nop 0.00 : 784390: e9 3b fd ff ff jmpq 7840d0 : /* use volatile pointer to prevent code rearrangement */ : volatile HASHHDR *hctlv = hctl; : : /* if partitioned, must lock to touch nentries and freeList */ : if (IS_PARTITIONED(hctlv)) : SpinLockAcquire(&hctlv->mutex); 0.00 : 784395: 48 8b 7d 90 mov -0x70(%rbp),%rdi 0.00 : 784399: ba 95 03 00 00 mov $0x395,%edx 0.00 : 78439e: be 33 59 8d 00 mov $0x8d5933,%esi 0.00 : 7843a3: e8 98 bc f0 ff callq 690040 0.00 : 7843a8: eb 87 jmp 784331 : : currBucket = get_hash_entry(hashp); : if (currBucket == NULL) : { : /* out of memory */ : if (action == HASH_ENTER_NULL) 0.00 : 7843aa: 80 7d 8f 00 cmpb $0x0,-0x71(%rbp) 0.00 : 7843ae: 75 d0 jne 784380 : return NULL; : /* report a generic message */ : if (hashp->isshared) 0.00 : 7843b0: 41 80 7e 40 00 cmpb $0x0,0x40(%r14) 0.00 : 7843b5: 0f 1f 00 nopl (%rax) 0.00 : 7843b8: 0f 84 4a 02 00 00 je 784608 : ereport(ERROR, 0.00 : 7843be: 45 31 c0 xor %r8d,%r8d 0.00 : 7843c1: bf 14 00 00 00 mov $0x14,%edi 0.00 : 7843c6: b9 f0 5b 8d 00 mov $0x8d5bf0,%ecx 0.00 : 7843cb: ba c6 03 00 00 mov $0x3c6,%edx 0.00 : 7843d0: be 33 59 8d 00 mov $0x8d5933,%esi 0.00 : 7843d5: e8 e6 66 ff ff callq 77aac0 0.00 : 7843da: 84 c0 test %al,%al 0.00 : 7843dc: bf 47 ba 8a 00 mov $0x8aba47,%edi 0.00 : 7843e1: 0f 84 8a fe ff ff je 784271 : (errcode(ERRCODE_OUT_OF_MEMORY), : errmsg("out of shared memory"))); : else : ereport(ERROR, 0.00 : 7843e7: 31 c0 xor %eax,%eax 0.00 : 7843e9: e8 b2 84 ff ff callq 77c8a0 0.00 : 7843ee: bf c5 20 00 00 mov $0x20c5,%edi 0.00 : 7843f3: 89 c3 mov %eax,%ebx 0.00 : 7843f5: e8 56 89 ff ff callq 77cd50 0.00 : 7843fa: 89 de mov %ebx,%esi 0.00 : 7843fc: 89 c7 mov %eax,%edi 0.00 : 7843fe: 31 c0 xor %eax,%eax 0.00 : 784400: e8 db 61 ff ff callq 77a5e0 0.00 : 784405: e9 67 fe ff ff jmpq 784271 0.00 : 78440a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : : new_bucket = hctl->max_bucket + 1; : new_segnum = new_bucket >> hashp->sshift; : new_segndx = MOD(new_bucket, hashp->ssize); : : if (new_segnum >= hctl->nsegs) 0.00 : 784410: 8b 45 d4 mov -0x2c(%rbp),%eax 0.00 : 784413: 48 c1 e3 03 shl $0x3,%rbx 0.00 : 784417: 48 89 5d c8 mov %rbx,-0x38(%rbp) : return false; : hctl->nsegs++; : } : : /* OK, we created a new bucket */ : hctl->max_bucket++; 0.00 : 78441b: 48 8b 5d 90 mov -0x70(%rbp),%rbx : * *Before* changing masks, find old bucket corresponding to same hash : * values; values in that bucket may need to be relocated to new bucket. : * Note that new_bucket is certainly larger than low_mask at this point, : * so we can skip the first step of the regular hash mask calc. : */ : old_bucket = (new_bucket & hctl->low_mask); 0.00 : 78441f: 4d 89 e1 mov %r12,%r9 : return false; : hctl->nsegs++; : } : : /* OK, we created a new bucket */ : hctl->max_bucket++; 0.00 : 784422: 89 43 28 mov %eax,0x28(%rbx) : * *Before* changing masks, find old bucket corresponding to same hash : * values; values in that bucket may need to be relocated to new bucket. : * Note that new_bucket is certainly larger than low_mask at this point, : * so we can skip the first step of the regular hash mask calc. : */ : old_bucket = (new_bucket & hctl->low_mask); 0.00 : 784425: 8b 43 30 mov 0x30(%rbx),%eax 0.00 : 784428: 49 21 c1 and %rax,%r9 : : /* : * If we crossed a power of 2, readjust masks. : */ : if ((uint32) new_bucket > hctl->high_mask) 0.00 : 78442b: 8b 43 2c mov 0x2c(%rbx),%eax 0.00 : 78442e: 39 45 d4 cmp %eax,-0x2c(%rbp) 0.00 : 784431: 76 0c jbe 78443f : { : hctl->low_mask = hctl->high_mask; 0.00 : 784433: 89 43 30 mov %eax,0x30(%rbx) : hctl->high_mask = (uint32) new_bucket | hctl->low_mask; 0.00 : 784436: 09 45 d4 or %eax,-0x2c(%rbp) 0.00 : 784439: 8b 45 d4 mov -0x2c(%rbp),%eax 0.00 : 78443c: 89 43 2c mov %eax,0x2c(%rbx) : old_segndx = MOD(old_bucket, hashp->ssize); : : old_seg = hashp->dir[old_segnum]; : new_seg = hashp->dir[new_segnum]; : : oldlink = &old_seg[old_segndx]; 0.00 : 78443f: 49 8b 46 50 mov 0x50(%r14),%rax 0.00 : 784443: 41 8b 4e 58 mov 0x58(%r14),%ecx 0.00 : 784447: 4c 89 ca mov %r9,%rdx : * that might not be true! : */ : old_segnum = old_bucket >> hashp->sshift; : old_segndx = MOD(old_bucket, hashp->ssize); : : old_seg = hashp->dir[old_segnum]; 0.00 : 78444a: 49 8b 76 08 mov 0x8(%r14),%rsi : new_seg = hashp->dir[new_segnum]; : : oldlink = &old_seg[old_segndx]; : newlink = &new_seg[new_segndx]; 0.00 : 78444e: 4d 21 ec and %r13,%r12 0.00 : 784451: 4a 8d 3c e5 00 00 00 lea 0x0(,%r12,8),%rdi 0.00 : 784458: 00 : old_segndx = MOD(old_bucket, hashp->ssize); : : old_seg = hashp->dir[old_segnum]; : new_seg = hashp->dir[new_segnum]; : : oldlink = &old_seg[old_segndx]; 0.00 : 784459: 48 83 e8 01 sub $0x1,%rax 0.00 : 78445d: 48 d3 fa sar %cl,%rdx 0.00 : 784460: 4c 21 c8 and %r9,%rax 0.00 : 784463: 4c 8d 04 c5 00 00 00 lea 0x0(,%rax,8),%r8 0.00 : 78446a: 00 0.00 : 78446b: 4c 03 04 d6 add (%rsi,%rdx,8),%r8 : newlink = &new_seg[new_segndx]; 0.00 : 78446f: 48 8b 55 c8 mov -0x38(%rbp),%rdx 0.00 : 784473: 48 03 3c 16 add (%rsi,%rdx,1),%rdi : : for (currElement = *oldlink; 0.00 : 784477: 49 8b 10 mov (%r8),%rdx : currElement != NULL; 0.00 : 78447a: 48 85 d2 test %rdx,%rdx 0.00 : 78447d: 75 17 jne 784496 0.00 : 78447f: eb 39 jmp 7844ba 0.00 : 784481: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : *oldlink = currElement; : oldlink = &currElement->link; : } : else : { : *newlink = currElement; 0.00 : 784488: 48 89 17 mov %rdx,(%rdi) : newlink = &currElement->link; 0.00 : 78448b: 48 89 d7 mov %rdx,%rdi : : oldlink = &old_seg[old_segndx]; : newlink = &new_seg[new_segndx]; : : for (currElement = *oldlink; : currElement != NULL; 0.00 : 78448e: 48 85 c9 test %rcx,%rcx 0.00 : 784491: 74 27 je 7844ba 0.00 : 784493: 48 89 ca mov %rcx,%rdx : static inline uint32 : calc_bucket(HASHHDR *hctl, uint32 hash_val) : { : uint32 bucket; : : bucket = hash_val & hctl->high_mask; 0.00 : 784496: 48 8b 5d 90 mov -0x70(%rbp),%rbx : : for (currElement = *oldlink; : currElement != NULL; : currElement = nextElement) : { : nextElement = currElement->link; 0.00 : 78449a: 48 8b 0a mov (%rdx),%rcx : static inline uint32 : calc_bucket(HASHHDR *hctl, uint32 hash_val) : { : uint32 bucket; : : bucket = hash_val & hctl->high_mask; 0.00 : 78449d: 8b 43 2c mov 0x2c(%rbx),%eax 0.00 : 7844a0: 23 42 08 and 0x8(%rdx),%eax : if (bucket > hctl->max_bucket) 0.00 : 7844a3: 3b 43 28 cmp 0x28(%rbx),%eax 0.00 : 7844a6: 76 03 jbe 7844ab : bucket = bucket & hctl->low_mask; 0.00 : 7844a8: 23 43 30 and 0x30(%rbx),%eax : for (currElement = *oldlink; : currElement != NULL; : currElement = nextElement) : { : nextElement = currElement->link; : if ((long) calc_bucket(hctl, currElement->hashvalue) == old_bucket) 0.00 : 7844ab: 89 c0 mov %eax,%eax 0.00 : 7844ad: 49 39 c1 cmp %rax,%r9 0.00 : 7844b0: 75 d6 jne 784488 : { : *oldlink = currElement; 0.00 : 7844b2: 49 89 10 mov %rdx,(%r8) : oldlink = &currElement->link; 0.00 : 7844b5: 49 89 d0 mov %rdx,%r8 0.00 : 7844b8: eb d4 jmp 78448e : *newlink = currElement; : newlink = &currElement->link; : } : } : /* don't forget to terminate the rebuilt hash chains... */ : *oldlink = NULL; 0.00 : 7844ba: 49 c7 00 00 00 00 00 movq $0x0,(%r8) : *newlink = NULL; 0.00 : 7844c1: 48 c7 07 00 00 00 00 movq $0x0,(%rdi) 0.00 : 7844c8: 48 8b 45 90 mov -0x70(%rbp),%rax 0.00 : 7844cc: e9 c8 fb ff ff jmpq 784099 : return NULL; : } : } : : /* remove entry from freelist, bump nentries */ : hctlv->freeList = newElement->link; 0.00 : 7844d1: 48 8b 02 mov (%rdx),%rax 0.00 : 7844d4: 48 89 43 10 mov %rax,0x10(%rbx) : hctlv->nentries++; 0.00 : 7844d8: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 7844dc: 48 83 c0 01 add $0x1,%rax 0.00 : 7844e0: 48 89 43 08 mov %rax,0x8(%rbx) : : if (IS_PARTITIONED(hctlv)) 0.00 : 7844e4: 48 8b 43 48 mov 0x48(%rbx),%rax 0.00 : 7844e8: 48 85 c0 test %rax,%rax 0.00 : 7844eb: 74 03 je 7844f0 : SpinLockRelease(&hctlv->mutex); 0.00 : 7844ed: c6 03 00 movb $0x0,(%rbx) : *prevBucketPtr = currBucket; : currBucket->link = NULL; : : /* copy key into record */ : currBucket->hashvalue = hashvalue; : hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, keysize); 0.00 : 7844f0: 48 8d 5a 10 lea 0x10(%rdx),%rbx : (errcode(ERRCODE_OUT_OF_MEMORY), : errmsg("out of memory"))); : } : : /* link into hashbucket chain */ : *prevBucketPtr = currBucket; 0.00 : 7844f4: 49 89 14 24 mov %rdx,(%r12) : currBucket->link = NULL; : : /* copy key into record */ : currBucket->hashvalue = hashvalue; 0.00 : 7844f8: 44 89 7a 08 mov %r15d,0x8(%rdx) : errmsg("out of memory"))); : } : : /* link into hashbucket chain */ : *prevBucketPtr = currBucket; : currBucket->link = NULL; 0.00 : 7844fc: 48 c7 02 00 00 00 00 movq $0x0,(%rdx) : : /* copy key into record */ : currBucket->hashvalue = hashvalue; : hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, keysize); 0.00 : 784503: 48 8b 55 98 mov -0x68(%rbp),%rdx 0.00 : 784507: 48 8b 75 80 mov -0x80(%rbp),%rsi 0.00 : 78450b: 48 89 df mov %rbx,%rdi 0.00 : 78450e: 41 ff 56 20 callq *0x20(%r14) : } : : elog(ERROR, "unrecognized hash action code: %d", (int) action); : : return NULL; /* keep compiler quiet */ : } 0.00 : 784512: e9 38 fc ff ff jmpq 78414f : p = (HASHSEGMENT *) hashp->alloc((Size) new_dirsize); : : if (p != NULL) : { : memcpy(p, old_p, old_dirsize); : MemSet(((char *) p) + old_dirsize, 0, new_dirsize - old_dirsize); 0.00 : 784517: 31 f6 xor %esi,%esi 0.00 : 784519: e8 02 4f ce ff callq 469420 : hashp->dir = p; 0.00 : 78451e: 48 8b 45 a8 mov -0x58(%rbp),%rax : hashp->hctl->dsize = new_dsize; 0.00 : 784522: 48 8b 55 b8 mov -0x48(%rbp),%rdx : : if (p != NULL) : { : memcpy(p, old_p, old_dirsize); : MemSet(((char *) p) + old_dirsize, 0, new_dirsize - old_dirsize); : hashp->dir = p; 0.00 : 784526: 49 89 46 08 mov %rax,0x8(%r14) : hashp->hctl->dsize = new_dsize; 0.00 : 78452a: 49 8b 06 mov (%r14),%rax 0.00 : 78452d: 48 89 50 18 mov %rdx,0x18(%rax) : : /* XXX assume the allocator is palloc, so we know how to free */ : Assert(hashp->alloc == DynaHashAlloc); : pfree(old_p); 0.00 : 784531: 48 8b 7d b0 mov -0x50(%rbp),%rdi 0.00 : 784535: e8 46 46 01 00 callq 798b80 : { : /* Allocate new segment if necessary -- could fail if dir full */ : if (new_segnum >= hctl->dsize) : if (!dir_realloc(hashp)) : return false; : if (!(hashp->dir[new_segnum] = seg_alloc(hashp))) 0.00 : 78453a: 48 8b 5d c0 mov -0x40(%rbp),%rbx 0.00 : 78453e: 4c 89 f7 mov %r14,%rdi 0.00 : 784541: 48 c1 e3 03 shl $0x3,%rbx 0.00 : 784545: 48 89 5d c8 mov %rbx,-0x38(%rbp) 0.00 : 784549: 49 03 5e 08 add 0x8(%r14),%rbx 0.00 : 78454d: e8 7e fa ff ff callq 783fd0 0.00 : 784552: 48 85 c0 test %rax,%rax 0.00 : 784555: 48 89 03 mov %rax,(%rbx) 0.00 : 784558: 0f 84 1f 01 00 00 je 78467d : return false; : hctl->nsegs++; 0.00 : 78455e: 48 8b 55 90 mov -0x70(%rbp),%rdx 0.00 : 784562: 8b 42 28 mov 0x28(%rdx),%eax 0.00 : 784565: 48 83 42 20 01 addq $0x1,0x20(%rdx) 0.00 : 78456a: 83 c0 01 add $0x1,%eax 0.00 : 78456d: e9 a9 fe ff ff jmpq 78441b : : if (hashp->hctl->max_dsize != NO_MAX_DSIZE) : return false; : : /* Reallocate directory */ : new_dsize = hashp->hctl->dsize << 1; 0.00 : 784572: 48 8d 14 1b lea (%rbx,%rbx,1),%rdx : old_dirsize = hashp->hctl->dsize * sizeof(HASHSEGMENT); : new_dirsize = new_dsize * sizeof(HASHSEGMENT); 0.00 : 784576: 48 89 d8 mov %rbx,%rax 0.00 : 784579: 48 c1 e0 04 shl $0x4,%rax 0.00 : 78457d: 48 89 45 a0 mov %rax,-0x60(%rbp) : : if (hashp->hctl->max_dsize != NO_MAX_DSIZE) : return false; : : /* Reallocate directory */ : new_dsize = hashp->hctl->dsize << 1; 0.00 : 784581: 48 89 55 b8 mov %rdx,-0x48(%rbp) : old_dirsize = hashp->hctl->dsize * sizeof(HASHSEGMENT); : new_dirsize = new_dsize * sizeof(HASHSEGMENT); : : old_p = hashp->dir; : CurrentDynaHashCxt = hashp->hcxt; 0.00 : 784585: 49 8b 46 30 mov 0x30(%r14),%rax : /* Reallocate directory */ : new_dsize = hashp->hctl->dsize << 1; : old_dirsize = hashp->hctl->dsize * sizeof(HASHSEGMENT); : new_dirsize = new_dsize * sizeof(HASHSEGMENT); : : old_p = hashp->dir; 0.00 : 784589: 49 8b 56 08 mov 0x8(%r14),%rdx : CurrentDynaHashCxt = hashp->hcxt; : p = (HASHSEGMENT *) hashp->alloc((Size) new_dirsize); 0.00 : 78458d: 48 8b 7d a0 mov -0x60(%rbp),%rdi : /* Reallocate directory */ : new_dsize = hashp->hctl->dsize << 1; : old_dirsize = hashp->hctl->dsize * sizeof(HASHSEGMENT); : new_dirsize = new_dsize * sizeof(HASHSEGMENT); : : old_p = hashp->dir; 0.00 : 784591: 48 89 55 b0 mov %rdx,-0x50(%rbp) : CurrentDynaHashCxt = hashp->hcxt; 0.00 : 784595: 48 89 05 2c 56 43 00 mov %rax,0x43562c(%rip) # bb9bc8 : p = (HASHSEGMENT *) hashp->alloc((Size) new_dirsize); 0.00 : 78459c: 41 ff 56 28 callq *0x28(%r14) : : if (p != NULL) 0.00 : 7845a0: 48 85 c0 test %rax,%rax : old_dirsize = hashp->hctl->dsize * sizeof(HASHSEGMENT); : new_dirsize = new_dsize * sizeof(HASHSEGMENT); : : old_p = hashp->dir; : CurrentDynaHashCxt = hashp->hcxt; : p = (HASHSEGMENT *) hashp->alloc((Size) new_dirsize); 0.00 : 7845a3: 48 89 45 a8 mov %rax,-0x58(%rbp) : : if (p != NULL) 0.00 : 7845a7: 0f 84 89 00 00 00 je 784636 : { : memcpy(p, old_p, old_dirsize); 0.00 : 7845ad: 48 8b 7d a8 mov -0x58(%rbp),%rdi 0.00 : 7845b1: 48 8b 75 b0 mov -0x50(%rbp),%rsi : if (hashp->hctl->max_dsize != NO_MAX_DSIZE) : return false; : : /* Reallocate directory */ : new_dsize = hashp->hctl->dsize << 1; : old_dirsize = hashp->hctl->dsize * sizeof(HASHSEGMENT); 0.00 : 7845b5: 48 c1 e3 03 shl $0x3,%rbx : CurrentDynaHashCxt = hashp->hcxt; : p = (HASHSEGMENT *) hashp->alloc((Size) new_dirsize); : : if (p != NULL) : { : memcpy(p, old_p, old_dirsize); 0.00 : 7845b9: 48 89 da mov %rbx,%rdx 0.00 : 7845bc: e8 2f 56 ce ff callq 469bf0 : MemSet(((char *) p) + old_dirsize, 0, new_dirsize - old_dirsize); 0.00 : 7845c1: 48 8b 7d a8 mov -0x58(%rbp),%rdi 0.00 : 7845c5: 48 8b 55 a0 mov -0x60(%rbp),%rdx 0.00 : 7845c9: 48 01 df add %rbx,%rdi 0.00 : 7845cc: 48 29 da sub %rbx,%rdx 0.00 : 7845cf: 40 f6 c7 07 test $0x7,%dil 0.00 : 7845d3: 0f 85 3e ff ff ff jne 784517 0.00 : 7845d9: 48 81 fa 00 04 00 00 cmp $0x400,%rdx 0.00 : 7845e0: 0f 87 31 ff ff ff ja 784517 0.00 : 7845e6: 48 8d 04 17 lea (%rdi,%rdx,1),%rax 0.00 : 7845ea: 48 39 c7 cmp %rax,%rdi 0.00 : 7845ed: 0f 83 2b ff ff ff jae 78451e 0.00 : 7845f3: 48 c7 07 00 00 00 00 movq $0x0,(%rdi) 0.00 : 7845fa: 48 83 c7 08 add $0x8,%rdi 0.00 : 7845fe: 48 39 f8 cmp %rdi,%rax 0.00 : 784601: 77 f0 ja 7845f3 0.00 : 784603: e9 16 ff ff ff jmpq 78451e : if (hashp->isshared) : ereport(ERROR, : (errcode(ERRCODE_OUT_OF_MEMORY), : errmsg("out of shared memory"))); : else : ereport(ERROR, 0.00 : 784608: 45 31 c0 xor %r8d,%r8d 0.00 : 78460b: b9 f0 5b 8d 00 mov $0x8d5bf0,%ecx 0.00 : 784610: ba ca 03 00 00 mov $0x3ca,%edx 0.00 : 784615: be 33 59 8d 00 mov $0x8d5933,%esi 0.00 : 78461a: bf 14 00 00 00 mov $0x14,%edi 0.00 : 78461f: e8 9c 64 ff ff callq 77aac0 0.00 : 784624: 84 c0 test %al,%al 0.00 : 784626: 0f 84 45 fc ff ff je 784271 0.00 : 78462c: bf 04 9c 7b 00 mov $0x7b9c04,%edi 0.00 : 784631: e9 b1 fd ff ff jmpq 7843e7 : : old_p = hashp->dir; : CurrentDynaHashCxt = hashp->hcxt; : p = (HASHSEGMENT *) hashp->alloc((Size) new_dirsize); : : if (p != NULL) 0.00 : 784636: 49 8b 46 50 mov 0x50(%r14),%rax 0.00 : 78463a: 48 8b 5d 90 mov -0x70(%rbp),%rbx 0.00 : 78463e: 41 8b 4e 58 mov 0x58(%r14),%ecx 0.00 : 784642: 4c 8d 68 ff lea -0x1(%rax),%r13 0.00 : 784646: 44 8b 43 28 mov 0x28(%rbx),%r8d 0.00 : 78464a: e9 d9 fb ff ff jmpq 784228 : if (currBucket != NULL) : return (void *) ELEMENTKEY(currBucket); : : /* disallow inserts if frozen */ : if (hashp->frozen) : elog(ERROR, "cannot insert into frozen hashtable \"%s\"", 0.00 : 78464f: ba f0 5b 8d 00 mov $0x8d5bf0,%edx 0.00 : 784654: be ba 03 00 00 mov $0x3ba,%esi 0.00 : 784659: bf 33 59 8d 00 mov $0x8d5933,%edi 0.00 : 78465e: e8 bd 6d ff ff callq 77b420 0.00 : 784663: 49 8b 56 38 mov 0x38(%r14),%rdx 0.00 : 784667: be c0 5a 8d 00 mov $0x8d5ac0,%esi 0.00 : 78466c: bf 14 00 00 00 mov $0x14,%edi 0.00 : 784671: 31 c0 xor %eax,%eax 0.00 : 784673: e8 b8 6b ff ff callq 77b230 0.00 : 784678: e8 53 4e ce ff callq 4694d0 : { : /* Allocate new segment if necessary -- could fail if dir full */ : if (new_segnum >= hctl->dsize) : if (!dir_realloc(hashp)) : return false; : if (!(hashp->dir[new_segnum] = seg_alloc(hashp))) 0.00 : 78467d: 48 8b 45 90 mov -0x70(%rbp),%rax 0.00 : 784681: 41 8b 4e 58 mov 0x58(%r14),%ecx 0.00 : 784685: 8b 70 28 mov 0x28(%rax),%esi 0.00 : 784688: 49 8b 46 50 mov 0x50(%r14),%rax 0.00 : 78468c: 4c 8d 68 ff lea -0x1(%rax),%r13 0.00 : 784690: e9 13 fa ff ff jmpq 7840a8 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 66.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:147 33.33 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:158 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000007989b0 : : * The type-specific reset routine handles the context itself, but we : * have to do the recursion for the children. : */ : void : MemoryContextReset(MemoryContext context) : { 0.00 : 7989b0: 55 push %rbp 0.00 : 7989b1: 48 89 e5 mov %rsp,%rbp 0.00 : 7989b4: 53 push %rbx 0.00 : 7989b5: 48 89 fb mov %rdi,%rbx 0.00 : 7989b8: 48 83 ec 08 sub $0x8,%rsp : AssertArg(MemoryContextIsValid(context)); : : /* save a function call in common case where there are no children */ : if (context->firstchild != NULL) 0.00 : 7989bc: 48 83 7f 18 00 cmpq $0x0,0x18(%rdi) /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:147 66.67 : 7989c1: 74 05 je 7989c8 : MemoryContextResetChildren(context); 0.00 : 7989c3: e8 b8 ff ff ff callq 798980 : : /* Nothing to do if no pallocs since startup or last reset */ : if (!context->isReset) 0.00 : 7989c8: 80 7b 30 00 cmpb $0x0,0x30(%rbx) 0.00 : 7989cc: 75 0e jne 7989dc : { : (*context->methods->reset) (context); 0.00 : 7989ce: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 7989d2: 48 89 df mov %rbx,%rdi 0.00 : 7989d5: ff 50 20 callq *0x20(%rax) : context->isReset = true; 0.00 : 7989d8: c6 43 30 01 movb $0x1,0x30(%rbx) : VALGRIND_DESTROY_MEMPOOL(context); : VALGRIND_CREATE_MEMPOOL(context, 0, false); : } : } /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:158 33.33 : 7989dc: 48 83 c4 08 add $0x8,%rsp 0.00 : 7989e0: 5b pop %rbx 0.00 : 7989e1: c9 leaveq Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .plt: : : 0000000000469bf0 : ??:0 100.00 : 469bf0: ff 25 6a d8 6f 00 jmpq *0x6fd86a(%rip) # b67460 <_GLOBAL_OFFSET_TABLE_+0x460> 0.00 : 469bf6: 68 89 00 00 00 pushq $0x89 0.00 : 469bfb: e9 50 f7 ff ff jmpq 469350 <_init+0x20> Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1445 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1472 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bbbb0 : : * or INVALID_SKEW_BUCKET_NO if the hashvalue is not : * associated with any active skew bucket. : */ : int : ExecHashGetSkewBucket(HashJoinTable hashtable, uint32 hashvalue) : { 0.00 : 5bbbb0: 55 push %rbp : : /* : * Always return INVALID_SKEW_BUCKET_NO if not doing skew optimization (in : * particular, this happens after the initial batch is done). : */ : if (!hashtable->skewEnabled) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1445 50.00 : 5bbbb1: 80 7f 21 00 cmpb $0x0,0x21(%rdi) : * or INVALID_SKEW_BUCKET_NO if the hashvalue is not : * associated with any active skew bucket. : */ : int : ExecHashGetSkewBucket(HashJoinTable hashtable, uint32 hashvalue) : { 0.00 : 5bbbb5: 48 89 e5 mov %rsp,%rbp : : /* : * Always return INVALID_SKEW_BUCKET_NO if not doing skew optimization (in : * particular, this happens after the initial batch is done). : */ : if (!hashtable->skewEnabled) 0.00 : 5bbbb8: 74 46 je 5bbc00 : return INVALID_SKEW_BUCKET_NO; : : /* : * Since skewBucketLen is a power of 2, we can do a modulo by ANDing. : */ : bucket = hashvalue & (hashtable->skewBucketLen - 1); 0.00 : 5bbbba: 8b 47 30 mov 0x30(%rdi),%eax 0.00 : 5bbbbd: 89 f2 mov %esi,%edx : /* : * While we have not hit a hole in the hashtable and have not hit the : * desired bucket, we have collided with some other hash value, so try the : * next bucket location. : */ : while (hashtable->skewBucket[bucket] != NULL && 0.00 : 5bbbbf: 48 8b 4f 28 mov 0x28(%rdi),%rcx : return INVALID_SKEW_BUCKET_NO; : : /* : * Since skewBucketLen is a power of 2, we can do a modulo by ANDing. : */ : bucket = hashvalue & (hashtable->skewBucketLen - 1); 0.00 : 5bbbc3: 44 8d 40 ff lea -0x1(%rax),%r8d 0.00 : 5bbbc7: 44 21 c2 and %r8d,%edx : /* : * While we have not hit a hole in the hashtable and have not hit the : * desired bucket, we have collided with some other hash value, so try the : * next bucket location. : */ : while (hashtable->skewBucket[bucket] != NULL && 0.00 : 5bbbca: 48 63 c2 movslq %edx,%rax 0.00 : 5bbbcd: 48 8b 04 c1 mov (%rcx,%rax,8),%rax 0.00 : 5bbbd1: 48 85 c0 test %rax,%rax 0.00 : 5bbbd4: 75 1c jne 5bbbf2 0.00 : 5bbbd6: eb 28 jmp 5bbc00 0.00 : 5bbbd8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5bbbdf: 00 : hashtable->skewBucket[bucket]->hashvalue != hashvalue) : bucket = (bucket + 1) & (hashtable->skewBucketLen - 1); 0.00 : 5bbbe0: 83 c2 01 add $0x1,%edx 0.00 : 5bbbe3: 44 21 c2 and %r8d,%edx : /* : * While we have not hit a hole in the hashtable and have not hit the : * desired bucket, we have collided with some other hash value, so try the : * next bucket location. : */ : while (hashtable->skewBucket[bucket] != NULL && 0.00 : 5bbbe6: 48 63 c2 movslq %edx,%rax 0.00 : 5bbbe9: 48 8b 04 c1 mov (%rcx,%rax,8),%rax 0.00 : 5bbbed: 48 85 c0 test %rax,%rax 0.00 : 5bbbf0: 74 0e je 5bbc00 0.00 : 5bbbf2: 39 30 cmp %esi,(%rax) 0.00 : 5bbbf4: 75 ea jne 5bbbe0 : : /* : * There must not be any hashtable entry for this hash value. : */ : return INVALID_SKEW_BUCKET_NO; : } 0.00 : 5bbbf6: 89 d0 mov %edx,%eax 0.00 : 5bbbf8: c9 leaveq 0.00 : 5bbbf9: c3 retq 0.00 : 5bbbfa: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : /* : * While we have not hit a hole in the hashtable and have not hit the : * desired bucket, we have collided with some other hash value, so try the : * next bucket location. : */ : while (hashtable->skewBucket[bucket] != NULL && 0.00 : 5bbc00: ba ff ff ff ff mov $0xffffffff,%edx : : /* : * There must not be any hashtable entry for this hash value. : */ : return INVALID_SKEW_BUCKET_NO; : } 0.00 : 5bbc05: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1472 50.00 : 5bbc06: 89 d0 mov %edx,%eax Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/varlena.c:1604 50.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/varlena.c:1604 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000075e600 : : * need to be so careful. : */ : : Datum : texteq(PG_FUNCTION_ARGS) : { 0.00 : 75e600: 55 push %rbp 0.00 : 75e601: 48 89 e5 mov %rsp,%rbp 0.00 : 75e604: 4c 89 65 e8 mov %r12,-0x18(%rbp) 0.00 : 75e608: 4c 89 75 f8 mov %r14,-0x8(%rbp) 0.00 : 75e60c: 49 89 fc mov %rdi,%r12 0.00 : 75e60f: 48 89 5d e0 mov %rbx,-0x20(%rbp) 0.00 : 75e613: 4c 89 6d f0 mov %r13,-0x10(%rbp) 0.00 : 75e617: 48 83 ec 20 sub $0x20,%rsp : Datum arg1 = PG_GETARG_DATUM(0); 0.00 : 75e61b: 48 8b 5f 20 mov 0x20(%rdi),%rbx : Datum arg2 = PG_GETARG_DATUM(1); 0.00 : 75e61f: 4c 8b 6f 28 mov 0x28(%rdi),%r13 : * expense of strcoll() here, and just do bitwise comparison. In fact, we : * don't even have to do a bitwise comparison if we can show the lengths : * of the strings are unequal; which might save us from having to detoast : * one or both values. : */ : len1 = toast_raw_datum_size(arg1); 0.00 : 75e623: 48 89 df mov %rbx,%rdi 0.00 : 75e626: e8 75 2e d4 ff callq 4a14a0 : len2 = toast_raw_datum_size(arg2); 0.00 : 75e62b: 4c 89 ef mov %r13,%rdi : * expense of strcoll() here, and just do bitwise comparison. In fact, we : * don't even have to do a bitwise comparison if we can show the lengths : * of the strings are unequal; which might save us from having to detoast : * one or both values. : */ : len1 = toast_raw_datum_size(arg1); 0.00 : 75e62e: 49 89 c6 mov %rax,%r14 : len2 = toast_raw_datum_size(arg2); 0.00 : 75e631: e8 6a 2e d4 ff callq 4a14a0 : if (len1 != len2) 0.00 : 75e636: 31 d2 xor %edx,%edx 0.00 : 75e638: 49 39 c6 cmp %rax,%r14 0.00 : 75e63b: 74 1b je 75e658 : PG_FREE_IF_COPY(targ1, 0); : PG_FREE_IF_COPY(targ2, 1); : } : : PG_RETURN_BOOL(result); : } 0.00 : 75e63d: 48 89 d0 mov %rdx,%rax 0.00 : 75e640: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 75e644: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 75e649: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 75e64e: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 0.00 : 75e653: c9 leaveq 0.00 : 75e654: c3 retq 0.00 : 75e655: 0f 1f 00 nopl (%rax) : len2 = toast_raw_datum_size(arg2); : if (len1 != len2) : result = false; : else : { : text *targ1 = DatumGetTextPP(arg1); 0.00 : 75e658: 48 89 df mov %rbx,%rdi 0.00 : 75e65b: e8 80 06 02 00 callq 77ece0 : text *targ2 = DatumGetTextPP(arg2); 0.00 : 75e660: 4c 89 ef mov %r13,%rdi : len2 = toast_raw_datum_size(arg2); : if (len1 != len2) : result = false; : else : { : text *targ1 = DatumGetTextPP(arg1); 0.00 : 75e663: 48 89 c3 mov %rax,%rbx : text *targ2 = DatumGetTextPP(arg2); 0.00 : 75e666: e8 75 06 02 00 callq 77ece0 0.00 : 75e66b: 49 89 c5 mov %rax,%r13 : : result = (memcmp(VARDATA_ANY(targ1), VARDATA_ANY(targ2), 0.00 : 75e66e: 48 8d 78 01 lea 0x1(%rax),%rdi 0.00 : 75e672: 48 8d 40 04 lea 0x4(%rax),%rax 0.00 : 75e676: 41 f6 45 00 01 testb $0x1,0x0(%r13) 0.00 : 75e67b: 49 8d 4e fc lea -0x4(%r14),%rcx 0.00 : 75e67f: 48 8d 73 01 lea 0x1(%rbx),%rsi 0.00 : 75e683: 48 0f 44 f8 cmove %rax,%rdi 0.00 : 75e687: f6 03 01 testb $0x1,(%rbx) 0.00 : 75e68a: 48 8d 43 04 lea 0x4(%rbx),%rax 0.00 : 75e68e: 48 0f 44 f0 cmove %rax,%rsi 0.00 : 75e692: 48 39 c9 cmp %rcx,%rcx 50.00 : 75e695: f3 a6 repz cmpsb %es:(%rdi),%ds:(%rsi) 50.00 : 75e697: 41 0f 94 c6 sete %r14b : len1 - VARHDRSZ) == 0); : : PG_FREE_IF_COPY(targ1, 0); 0.00 : 75e69b: 49 3b 5c 24 20 cmp 0x20(%r12),%rbx 0.00 : 75e6a0: 74 08 je 75e6aa 0.00 : 75e6a2: 48 89 df mov %rbx,%rdi 0.00 : 75e6a5: e8 d6 a4 03 00 callq 798b80 : PG_FREE_IF_COPY(targ2, 1); 0.00 : 75e6aa: 4d 3b 6c 24 28 cmp 0x28(%r12),%r13 0.00 : 75e6af: 74 08 je 75e6b9 0.00 : 75e6b1: 4c 89 ef mov %r13,%rdi 0.00 : 75e6b4: e8 c7 a4 03 00 callq 798b80 0.00 : 75e6b9: 4c 89 f2 mov %r14,%rdx 0.00 : 75e6bc: 83 e2 01 and $0x1,%edx 0.00 : 75e6bf: e9 79 ff ff ff jmpq 75e63d Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:735 50.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:756 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000798b80 : : * pfree : * Release an allocated chunk. : */ : void : pfree(void *pointer) : { 0.00 : 798b80: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:735 50.00 : 798b81: 48 89 f8 mov %rdi,%rax : Assert(pointer == (void *) MAXALIGN(pointer)); : : /* : * OK, it's probably safe to look at the chunk header. : */ : context = ((StandardChunkHeader *) 0.00 : 798b84: 48 8b 7f f0 mov -0x10(%rdi),%rdi : ((char *) pointer - STANDARDCHUNKHEADERSIZE))->context; : : AssertArg(MemoryContextIsValid(context)); : : (*context->methods->free_p) (context, pointer); 0.00 : 798b88: 48 89 c6 mov %rax,%rsi : * pfree : * Release an allocated chunk. : */ : void : pfree(void *pointer) : { 0.00 : 798b8b: 48 89 e5 mov %rsp,%rbp : context = ((StandardChunkHeader *) : ((char *) pointer - STANDARDCHUNKHEADERSIZE))->context; : : AssertArg(MemoryContextIsValid(context)); : : (*context->methods->free_p) (context, pointer); 0.00 : 798b8e: 48 8b 57 08 mov 0x8(%rdi),%rdx 0.00 : 798b92: 4c 8b 5a 08 mov 0x8(%rdx),%r11 : VALGRIND_MEMPOOL_FREE(context, pointer); : } /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:756 50.00 : 798b96: c9 leaveq : context = ((StandardChunkHeader *) : ((char *) pointer - STANDARDCHUNKHEADERSIZE))->context; : : AssertArg(MemoryContextIsValid(context)); : : (*context->methods->free_p) (context, pointer); 0.00 : 798b97: 41 ff e3 jmpq *%r11 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/resowner/resowner.c:617 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000079a1a0 : : * We allow the case owner == NULL because the bufmgr is sometimes invoked : * outside any transaction (for example, during WAL recovery). : */ : void : ResourceOwnerRememberBuffer(ResourceOwner owner, Buffer buffer) : { 0.00 : 79a1a0: 55 push %rbp : if (owner != NULL) 0.00 : 79a1a1: 48 85 ff test %rdi,%rdi : * We allow the case owner == NULL because the bufmgr is sometimes invoked : * outside any transaction (for example, during WAL recovery). : */ : void : ResourceOwnerRememberBuffer(ResourceOwner owner, Buffer buffer) : { 0.00 : 79a1a4: 48 89 e5 mov %rsp,%rbp : if (owner != NULL) 0.00 : 79a1a7: 74 0f je 79a1b8 : { : Assert(owner->nbuffers < owner->maxbuffers); : owner->buffers[owner->nbuffers] = buffer; 0.00 : 79a1a9: 48 63 57 20 movslq 0x20(%rdi),%rdx 0.00 : 79a1ad: 48 8b 47 28 mov 0x28(%rdi),%rax 0.00 : 79a1b1: 89 34 90 mov %esi,(%rax,%rdx,4) : owner->nbuffers++; 0.00 : 79a1b4: 83 47 20 01 addl $0x1,0x20(%rdi) : } : } /home/Computational/mark/src/postgres-andres/src/backend/utils/resowner/resowner.c:617 100.00 : 79a1b8: c9 leaveq Sorted summary for file /lib64/libc-2.11.3.so ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /lib64/libc-2.11.3.so ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000099390 <__gettimeofday>: 0.00 : 99390: 48 83 ec 08 sub $0x8,%rsp 0.00 : 99394: 48 8b 05 ad de 2d 00 mov 0x2ddead(%rip),%rax # 377248 <__vdso_gettimeofday> 0.00 : 9939b: 48 c1 c8 11 ror $0x11,%rax ??:0 100.00 : 9939f: 64 48 33 04 25 30 00 xor %fs:0x30,%rax 0.00 : 993a6: 00 00 0.00 : 993a8: ff d0 callq *%rax 0.00 : 993aa: 3d 01 f0 ff ff cmp $0xfffff001,%eax 0.00 : 993af: 73 05 jae 993b6 <__gettimeofday+0x26> 0.00 : 993b1: 48 83 c4 08 add $0x8,%rsp 0.00 : 993b5: c3 retq 0.00 : 993b6: 48 8b 0d 7b 8a 2d 00 mov 0x2d8a7b(%rip),%rcx # 371e38 <_DYNAMIC+0x2d8> 0.00 : 993bd: 31 d2 xor %edx,%edx 0.00 : 993bf: 48 29 c2 sub %rax,%rdx 0.00 : 993c2: 64 89 11 mov %edx,%fs:(%rcx) 0.00 : 993c5: 48 83 c8 ff or $0xffffffffffffffff,%rax 0.00 : 993c9: eb e6 jmp 993b1 <__gettimeofday+0x21> Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .plt: : : 0000000000469420 : ??:0 100.00 : 469420: ff 25 52 dc 6f 00 jmpq *0x6fdc52(%rip) # b67078 <_GLOBAL_OFFSET_TABLE_+0x78> 0.00 : 469426: 68 0c 00 00 00 pushq $0xc 0.00 : 46942b: e9 20 ff ff ff jmpq 469350 <_init+0x20> Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .plt: : : 00000000004695c0 : 100.00 : 4695c0: ff 25 82 db 6f 00 jmpq *0x6fdb82(%rip) # b67148 <_GLOBAL_OFFSET_TABLE_+0x148> 0.00 : 4695c6: 68 26 00 00 00 pushq $0x26 0.00 : 4695cb: e9 80 fd ff ff jmpq 469350 <_init+0x20> Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/indextuple.c:390 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000470b60 : : */ : Datum : nocache_index_getattr(IndexTuple tup, : int attnum, : TupleDesc tupleDesc) : { 0.00 : 470b60: 55 push %rbp 0.00 : 470b61: 49 89 f9 mov %rdi,%r9 0.00 : 470b64: 48 89 d7 mov %rdx,%rdi 0.00 : 470b67: 48 89 e5 mov %rsp,%rbp 0.00 : 470b6a: 41 57 push %r15 0.00 : 470b6c: 41 56 push %r14 0.00 : 470b6e: 41 55 push %r13 0.00 : 470b70: 41 54 push %r12 0.00 : 470b72: 53 push %rbx 0.00 : 470b73: 48 83 ec 28 sub $0x28,%rsp : * 2: Has a null or a var-width AFTER att. : * 3: Has nulls or var-widths BEFORE att. : * ---------------- : */ : : data_off = IndexInfoFindDataOffset(tup->t_info); 0.00 : 470b77: 45 0f b7 41 06 movzwl 0x6(%r9),%r8d : Datum : nocache_index_getattr(IndexTuple tup, : int attnum, : TupleDesc tupleDesc) : { : Form_pg_attribute *att = tupleDesc->attrs; 0.00 : 470b7c: 4c 8b 7a 08 mov 0x8(%rdx),%r15 : * 2: Has a null or a var-width AFTER att. : * 3: Has nulls or var-widths BEFORE att. : * ---------------- : */ : : data_off = IndexInfoFindDataOffset(tup->t_info); 0.00 : 470b80: 66 45 85 c0 test %r8w,%r8w 0.00 : 470b84: 78 6a js 470bf0 : : attnum--; 0.00 : 470b86: 44 8d 56 ff lea -0x1(%rsi),%r10d 0.00 : 470b8a: 48 c7 45 d0 00 00 00 movq $0x0,-0x30(%rbp) 0.00 : 470b91: 00 0.00 : 470b92: b8 08 00 00 00 mov $0x8,%eax : } : } : } : } : : tp = (char *) tup + data_off; 0.00 : 470b97: 4d 8d 1c 01 lea (%r9,%rax,1),%r11 : { : /* : * If we get here, there are no nulls up to and including the target : * attribute. If we have a cached offset, we can use it. : */ : if (att[attnum]->attcacheoff >= 0) 0.00 : 470b9b: 49 63 c2 movslq %r10d,%rax 0.00 : 470b9e: 49 8d 1c c7 lea (%r15,%rax,8),%rbx 0.00 : 470ba2: 48 8b 13 mov (%rbx),%rdx 0.00 : 470ba5: 8b 42 54 mov 0x54(%rdx),%eax 0.00 : 470ba8: 85 c0 test %eax,%eax 0.00 : 470baa: 0f 88 8c 03 00 00 js 470f3c : { : return fetchatt(att[attnum], 0.00 : 470bb0: 80 7a 5c 00 cmpb $0x0,0x5c(%rdx) 0.00 : 470bb4: 0f 84 c6 02 00 00 je 470e80 0.00 : 470bba: 0f b7 52 4c movzwl 0x4c(%rdx),%edx 0.00 : 470bbe: 66 83 fa 08 cmp $0x8,%dx 0.00 : 470bc2: 0f 84 e8 04 00 00 je 4710b0 0.00 : 470bc8: 66 83 fa 04 cmp $0x4,%dx 0.00 : 470bcc: 0f 84 1c 05 00 00 je 4710ee 0.00 : 470bd2: 66 83 fa 02 cmp $0x2,%dx 0.00 : 470bd6: 0f 84 1d 05 00 00 je 4710f9 0.00 : 470bdc: 48 98 cltq 0.00 : 470bde: 41 0f b6 04 03 movzbl (%r11,%rax,1),%eax 0.00 : 470be3: e9 6f 02 00 00 jmpq 470e57 0.00 : 470be8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 470bef: 00 : * ---------------- : */ : : data_off = IndexInfoFindDataOffset(tup->t_info); : : attnum--; 0.00 : 470bf0: 44 8d 56 ff lea -0x1(%rsi),%r10d : * : * check to see if desired att is null : */ : : /* XXX "knows" t_bits are just after fixed tuple header! */ : bp = (bits8 *) ((char *) tup + sizeof(IndexTupleData)); 0.00 : 470bf4: 49 8d 41 08 lea 0x8(%r9),%rax : : /* : * Now check to see if any preceding bits are null... : */ : { : int byte = attnum >> 3; 0.00 : 470bf8: 44 89 d6 mov %r10d,%esi : * : * check to see if desired att is null : */ : : /* XXX "knows" t_bits are just after fixed tuple header! */ : bp = (bits8 *) ((char *) tup + sizeof(IndexTupleData)); 0.00 : 470bfb: 48 89 45 d0 mov %rax,-0x30(%rbp) : { : int byte = attnum >> 3; : int finalbit = attnum & 0x07; : : /* check for nulls "before" final bit of last byte */ : if ((~bp[byte]) & ((1 << finalbit) - 1)) 0.00 : 470bff: 44 89 d1 mov %r10d,%ecx : : /* : * Now check to see if any preceding bits are null... : */ : { : int byte = attnum >> 3; 0.00 : 470c02: c1 fe 03 sar $0x3,%esi : int finalbit = attnum & 0x07; : : /* check for nulls "before" final bit of last byte */ : if ((~bp[byte]) & ((1 << finalbit) - 1)) 0.00 : 470c05: 83 e1 07 and $0x7,%ecx 0.00 : 470c08: 48 63 c6 movslq %esi,%rax 0.00 : 470c0b: 41 0f b6 54 01 08 movzbl 0x8(%r9,%rax,1),%edx 0.00 : 470c11: b8 01 00 00 00 mov $0x1,%eax 0.00 : 470c16: d3 e0 shl %cl,%eax 0.00 : 470c18: 83 e8 01 sub $0x1,%eax 0.00 : 470c1b: f7 d2 not %edx 0.00 : 470c1d: 85 c2 test %eax,%edx 0.00 : 470c1f: 0f 84 8b 02 00 00 je 470eb0 : } : } : } : } : : tp = (char *) tup + data_off; 0.00 : 470c25: 4d 8d 59 10 lea 0x10(%r9),%r11 : */ : if (IndexTupleHasVarwidths(tup)) : { : int j; : : for (j = 0; j <= attnum; j++) 0.00 : 470c29: 31 f6 xor %esi,%esi 0.00 : 470c2b: 41 be 01 00 00 00 mov $0x1,%r14d 0.00 : 470c31: 45 31 ed xor %r13d,%r13d 0.00 : 470c34: eb 78 jmp 470cae 0.00 : 470c36: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 470c3d: 00 00 00 : usecache = false; : continue; /* this cannot be the target att */ : } : : /* If we know the next offset, we can skip the rest */ : if (usecache && att[i]->attcacheoff >= 0) 0.00 : 470c40: 49 63 fd movslq %r13d,%rdi 0.00 : 470c43: 49 8b 14 ff mov (%r15,%rdi,8),%rdx : off = att[i]->attcacheoff; : else if (att[i]->attlen == -1) 0.00 : 470c47: 66 83 7a 4c ff cmpw $0xffff,0x4c(%rdx) 0.00 : 470c4c: 0f 84 2e 01 00 00 je 470d80 : } : } : else : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, att[i]->attalign); /home/Computational/mark/src/postgres-andres/src/backend/access/common/indextuple.c:390 100.00 : 470c52: 0f b6 42 5e movzbl 0x5e(%rdx),%eax 0.00 : 470c56: 3c 69 cmp $0x69,%al 0.00 : 470c58: 0f 84 a2 01 00 00 je 470e00 0.00 : 470c5e: 3c 63 cmp $0x63,%al 0.00 : 470c60: 74 0e je 470c70 0.00 : 470c62: 3c 64 cmp $0x64,%al 0.00 : 470c64: 0f 84 06 02 00 00 je 470e70 0.00 : 470c6a: 83 c6 01 add $0x1,%esi 0.00 : 470c6d: 83 e6 fe and $0xfffffffe,%esi : : if (usecache) 0.00 : 470c70: 45 84 f6 test %r14b,%r14b 0.00 : 470c73: 74 03 je 470c78 : att[i]->attcacheoff = off; 0.00 : 470c75: 89 72 54 mov %esi,0x54(%rdx) : } : : if (i == attnum) 0.00 : 470c78: 45 39 d5 cmp %r10d,%r13d 0.00 : 470c7b: 74 57 je 470cd4 : break; : : off = att_addlength_pointer(off, att[i]->attlen, tp + off); 0.00 : 470c7d: 49 8b 04 ff mov (%r15,%rdi,8),%rax 0.00 : 470c81: 44 0f b7 60 4c movzwl 0x4c(%rax),%r12d 0.00 : 470c86: 66 45 85 e4 test %r12w,%r12w 0.00 : 470c8a: 0f 8e c0 00 00 00 jle 470d50 0.00 : 470c90: 41 0f bf c4 movswl %r12w,%eax 0.00 : 470c94: 01 c6 add %eax,%esi : : if (usecache && att[i]->attlen <= 0) 0.00 : 470c96: 45 84 f6 test %r14b,%r14b 0.00 : 470c99: 74 0a je 470ca5 0.00 : 470c9b: 66 45 85 e4 test %r12w,%r12w 0.00 : 470c9f: 0f 8e 9b 01 00 00 jle 470e40 0.00 : 470ca5: 45 0f b7 41 06 movzwl 0x6(%r9),%r8d : * then advance over the attr based on its length. Nulls have no : * storage and no alignment padding either. We can use/set : * attcacheoff until we reach either a null or a var-width attribute. : */ : off = 0; : for (i = 0;; i++) /* loop exit is at "break" */ 0.00 : 470caa: 41 83 c5 01 add $0x1,%r13d : { : if (IndexTupleHasNulls(tup) && att_isnull(i, bp)) 0.00 : 470cae: 66 45 85 c0 test %r8w,%r8w 0.00 : 470cb2: 78 6c js 470d20 : usecache = false; : continue; /* this cannot be the target att */ : } : : /* If we know the next offset, we can skip the rest */ : if (usecache && att[i]->attcacheoff >= 0) 0.00 : 470cb4: 45 84 f6 test %r14b,%r14b 0.00 : 470cb7: 74 87 je 470c40 0.00 : 470cb9: 49 63 fd movslq %r13d,%rdi 0.00 : 470cbc: 49 8b 14 ff mov (%r15,%rdi,8),%rdx 0.00 : 470cc0: 8b 42 54 mov 0x54(%rdx),%eax 0.00 : 470cc3: 85 c0 test %eax,%eax 0.00 : 470cc5: 78 80 js 470c47 : : if (usecache) : att[i]->attcacheoff = off; : } : : if (i == attnum) 0.00 : 470cc7: 45 39 d5 cmp %r10d,%r13d : usecache = false; : continue; /* this cannot be the target att */ : } : : /* If we know the next offset, we can skip the rest */ : if (usecache && att[i]->attcacheoff >= 0) 0.00 : 470cca: 89 c6 mov %eax,%esi 0.00 : 470ccc: 41 be 01 00 00 00 mov $0x1,%r14d : : if (usecache) : att[i]->attcacheoff = off; : } : : if (i == attnum) 0.00 : 470cd2: 75 a9 jne 470c7d : : off = att_addlength_pointer(off, att[i]->attlen, tp + off); : : if (usecache && att[i]->attlen <= 0) : usecache = false; : } 0.00 : 470cd4: 49 8b 04 ff mov (%r15,%rdi,8),%rax : } : : return fetchatt(att[attnum], tp + off); 0.00 : 470cd8: 80 78 5c 00 cmpb $0x0,0x5c(%rax) 0.00 : 470cdc: 0f 84 6e 01 00 00 je 470e50 0.00 : 470ce2: 0f b7 40 4c movzwl 0x4c(%rax),%eax 0.00 : 470ce6: 66 83 f8 08 cmp $0x8,%ax 0.00 : 470cea: 0f 84 80 03 00 00 je 471070 0.00 : 470cf0: 66 83 f8 04 cmp $0x4,%ax 0.00 : 470cf4: 0f 84 06 02 00 00 je 470f00 0.00 : 470cfa: 66 83 f8 02 cmp $0x2,%ax 0.00 : 470cfe: 66 90 xchg %ax,%ax 0.00 : 470d00: 0f 84 ca 03 00 00 je 4710d0 0.00 : 470d06: 48 63 c6 movslq %esi,%rax 0.00 : 470d09: 41 0f b6 04 03 movzbl (%r11,%rax,1),%eax : } 0.00 : 470d0e: 48 83 c4 28 add $0x28,%rsp 0.00 : 470d12: 5b pop %rbx 0.00 : 470d13: 41 5c pop %r12 0.00 : 470d15: 41 5d pop %r13 0.00 : 470d17: 41 5e pop %r14 0.00 : 470d19: 41 5f pop %r15 0.00 : 470d1b: c9 leaveq 0.00 : 470d1c: c3 retq 0.00 : 470d1d: 0f 1f 00 nopl (%rax) : * attcacheoff until we reach either a null or a var-width attribute. : */ : off = 0; : for (i = 0;; i++) /* loop exit is at "break" */ : { : if (IndexTupleHasNulls(tup) && att_isnull(i, bp)) 0.00 : 470d20: 44 89 e8 mov %r13d,%eax 0.00 : 470d23: 48 8b 55 d0 mov -0x30(%rbp),%rdx 0.00 : 470d27: 44 89 e9 mov %r13d,%ecx 0.00 : 470d2a: c1 f8 03 sar $0x3,%eax 0.00 : 470d2d: 83 e1 07 and $0x7,%ecx 0.00 : 470d30: 48 98 cltq 0.00 : 470d32: 0f b6 04 02 movzbl (%rdx,%rax,1),%eax 0.00 : 470d36: d3 f8 sar %cl,%eax 0.00 : 470d38: a8 01 test $0x1,%al 0.00 : 470d3a: 0f 85 74 ff ff ff jne 470cb4 : if (i == attnum) : break; : : off = att_addlength_pointer(off, att[i]->attlen, tp + off); : : if (usecache && att[i]->attlen <= 0) 0.00 : 470d40: 45 31 f6 xor %r14d,%r14d 0.00 : 470d43: e9 62 ff ff ff jmpq 470caa 0.00 : 470d48: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 470d4f: 00 : } : : if (i == attnum) : break; : : off = att_addlength_pointer(off, att[i]->attlen, tp + off); 0.00 : 470d50: 66 41 83 fc ff cmp $0xffff,%r12w 0.00 : 470d55: 0f 85 b5 00 00 00 jne 470e10 0.00 : 470d5b: 48 63 d6 movslq %esi,%rdx 0.00 : 470d5e: 41 0f b6 04 13 movzbl (%r11,%rdx,1),%eax 0.00 : 470d63: 3c 01 cmp $0x1,%al 0.00 : 470d65: 0f 84 a5 01 00 00 je 470f10 0.00 : 470d6b: a8 01 test $0x1,%al 0.00 : 470d6d: 0f 84 25 01 00 00 je 470e98 0.00 : 470d73: d0 e8 shr %al 0.00 : 470d75: 0f b6 c0 movzbl %al,%eax 0.00 : 470d78: 8d 34 30 lea (%rax,%rsi,1),%esi 0.00 : 470d7b: e9 16 ff ff ff jmpq 470c96 : * We can only cache the offset for a varlena attribute if the : * offset is already suitably aligned, so that there would be : * no pad bytes in any case: then the offset will be valid for : * either an aligned or unaligned value. : */ : if (usecache && 0.00 : 470d80: 45 84 f6 test %r14b,%r14b 0.00 : 470d83: 48 63 c6 movslq %esi,%rax 0.00 : 470d86: 74 30 je 470db8 0.00 : 470d88: 0f b6 4a 5e movzbl 0x5e(%rdx),%ecx 0.00 : 470d8c: 80 f9 69 cmp $0x69,%cl 0.00 : 470d8f: 0f 84 cb 02 00 00 je 471060 0.00 : 470d95: 80 f9 63 cmp $0x63,%cl 0.00 : 470d98: 0f 84 52 01 00 00 je 470ef0 0.00 : 470d9e: 80 f9 64 cmp $0x64,%cl 0.00 : 470da1: 0f 84 19 03 00 00 je 4710c0 0.00 : 470da7: 48 8d 48 01 lea 0x1(%rax),%rcx 0.00 : 470dab: 48 83 e1 fe and $0xfffffffffffffffe,%rcx 0.00 : 470daf: 48 39 c1 cmp %rax,%rcx 0.00 : 470db2: 0f 84 38 01 00 00 je 470ef0 : off == att_align_nominal(off, att[i]->attalign)) : att[i]->attcacheoff = off; : else : { : off = att_align_pointer(off, att[i]->attalign, -1, 0.00 : 470db8: 41 80 3c 03 00 cmpb $0x0,(%r11,%rax,1) 0.00 : 470dbd: 75 31 jne 470df0 0.00 : 470dbf: 0f b6 52 5e movzbl 0x5e(%rdx),%edx 0.00 : 470dc3: 80 fa 69 cmp $0x69,%dl 0.00 : 470dc6: 0f 84 c4 02 00 00 je 471090 0.00 : 470dcc: 80 fa 63 cmp $0x63,%dl 0.00 : 470dcf: 90 nop 0.00 : 470dd0: 74 1e je 470df0 0.00 : 470dd2: 80 fa 64 cmp $0x64,%dl 0.00 : 470dd5: 0f 84 05 03 00 00 je 4710e0 0.00 : 470ddb: 48 83 c0 01 add $0x1,%rax 0.00 : 470ddf: 45 31 f6 xor %r14d,%r14d 0.00 : 470de2: 89 c6 mov %eax,%esi 0.00 : 470de4: 83 e6 fe and $0xfffffffe,%esi 0.00 : 470de7: e9 8c fe ff ff jmpq 470c78 0.00 : 470dec: 0f 1f 40 00 nopl 0x0(%rax) : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, att[i]->attalign); : : if (usecache) : att[i]->attcacheoff = off; 0.00 : 470df0: 45 31 f6 xor %r14d,%r14d 0.00 : 470df3: e9 80 fe ff ff jmpq 470c78 0.00 : 470df8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 470dff: 00 : } : } : else : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, att[i]->attalign); 0.00 : 470e00: 83 c6 03 add $0x3,%esi 0.00 : 470e03: 83 e6 fc and $0xfffffffc,%esi 0.00 : 470e06: e9 65 fe ff ff jmpq 470c70 0.00 : 470e0b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : } : : if (i == attnum) : break; : : off = att_addlength_pointer(off, att[i]->attlen, tp + off); 0.00 : 470e10: 48 63 de movslq %esi,%rbx 0.00 : 470e13: 4c 89 4d c8 mov %r9,-0x38(%rbp) 0.00 : 470e17: 44 89 55 c0 mov %r10d,-0x40(%rbp) 0.00 : 470e1b: 49 8d 3c 1b lea (%r11,%rbx,1),%rdi 0.00 : 470e1f: 4c 89 5d b8 mov %r11,-0x48(%rbp) 0.00 : 470e23: e8 28 8a ff ff callq 469850 0.00 : 470e28: 4c 8b 5d b8 mov -0x48(%rbp),%r11 0.00 : 470e2c: 8d 74 03 01 lea 0x1(%rbx,%rax,1),%esi 0.00 : 470e30: 44 8b 55 c0 mov -0x40(%rbp),%r10d 0.00 : 470e34: 4c 8b 4d c8 mov -0x38(%rbp),%r9 0.00 : 470e38: e9 59 fe ff ff jmpq 470c96 0.00 : 470e3d: 0f 1f 00 nopl (%rax) 0.00 : 470e40: 45 0f b7 41 06 movzwl 0x6(%r9),%r8d 0.00 : 470e45: e9 f6 fe ff ff jmpq 470d40 0.00 : 470e4a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : if (usecache && att[i]->attlen <= 0) : usecache = false; : } : } : : return fetchatt(att[attnum], tp + off); 0.00 : 470e50: 48 63 c6 movslq %esi,%rax 0.00 : 470e53: 49 8d 04 03 lea (%r11,%rax,1),%rax : } 0.00 : 470e57: 48 83 c4 28 add $0x28,%rsp 0.00 : 470e5b: 5b pop %rbx 0.00 : 470e5c: 41 5c pop %r12 0.00 : 470e5e: 41 5d pop %r13 0.00 : 470e60: 41 5e pop %r14 0.00 : 470e62: 41 5f pop %r15 0.00 : 470e64: c9 leaveq 0.00 : 470e65: c3 retq 0.00 : 470e66: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 470e6d: 00 00 00 : } : } : else : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, att[i]->attalign); 0.00 : 470e70: 83 c6 07 add $0x7,%esi 0.00 : 470e73: 83 e6 f8 and $0xfffffff8,%esi 0.00 : 470e76: e9 f5 fd ff ff jmpq 470c70 0.00 : 470e7b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : usecache = false; : } : } : : return fetchatt(att[attnum], tp + off); : } 0.00 : 470e80: 48 83 c4 28 add $0x28,%rsp : * If we get here, there are no nulls up to and including the target : * attribute. If we have a cached offset, we can use it. : */ : if (att[attnum]->attcacheoff >= 0) : { : return fetchatt(att[attnum], 0.00 : 470e84: 48 98 cltq : usecache = false; : } : } : : return fetchatt(att[attnum], tp + off); : } 0.00 : 470e86: 5b pop %rbx 0.00 : 470e87: 41 5c pop %r12 0.00 : 470e89: 41 5d pop %r13 0.00 : 470e8b: 41 5e pop %r14 : * If we get here, there are no nulls up to and including the target : * attribute. If we have a cached offset, we can use it. : */ : if (att[attnum]->attcacheoff >= 0) : { : return fetchatt(att[attnum], 0.00 : 470e8d: 49 8d 04 03 lea (%r11,%rax,1),%rax : usecache = false; : } : } : : return fetchatt(att[attnum], tp + off); : } 0.00 : 470e91: 41 5f pop %r15 0.00 : 470e93: c9 leaveq 0.00 : 470e94: c3 retq 0.00 : 470e95: 0f 1f 00 nopl (%rax) : } : : if (i == attnum) : break; : : off = att_addlength_pointer(off, att[i]->attlen, tp + off); 0.00 : 470e98: 41 8b 04 13 mov (%r11,%rdx,1),%eax 0.00 : 470e9c: c1 e8 02 shr $0x2,%eax 0.00 : 470e9f: 8d 34 30 lea (%rax,%rsi,1),%esi 0.00 : 470ea2: e9 ef fd ff ff jmpq 470c96 0.00 : 470ea7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 470eae: 00 00 : else : { : /* check for nulls in any "earlier" bytes */ : int i; : : for (i = 0; i < byte; i++) 0.00 : 470eb0: 85 f6 test %esi,%esi 0.00 : 470eb2: 7e 2b jle 470edf : { : if (bp[i] != 0xFF) 0.00 : 470eb4: 31 d2 xor %edx,%edx 0.00 : 470eb6: 41 80 79 08 ff cmpb $0xff,0x8(%r9) 0.00 : 470ebb: 4c 89 c9 mov %r9,%rcx 0.00 : 470ebe: 74 18 je 470ed8 0.00 : 470ec0: e9 60 fd ff ff jmpq 470c25 0.00 : 470ec5: 0f 1f 00 nopl (%rax) 0.00 : 470ec8: 0f b6 41 09 movzbl 0x9(%rcx),%eax 0.00 : 470ecc: 48 83 c1 01 add $0x1,%rcx 0.00 : 470ed0: 04 01 add $0x1,%al 0.00 : 470ed2: 0f 85 4d fd ff ff jne 470c25 : else : { : /* check for nulls in any "earlier" bytes */ : int i; : : for (i = 0; i < byte; i++) 0.00 : 470ed8: 83 c2 01 add $0x1,%edx 0.00 : 470edb: 39 d6 cmp %edx,%esi 0.00 : 470edd: 7f e9 jg 470ec8 0.00 : 470edf: b8 10 00 00 00 mov $0x10,%eax 0.00 : 470ee4: e9 ae fc ff ff jmpq 470b97 0.00 : 470ee9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * no pad bytes in any case: then the offset will be valid for : * either an aligned or unaligned value. : */ : if (usecache && : off == att_align_nominal(off, att[i]->attalign)) : att[i]->attcacheoff = off; 0.00 : 470ef0: 89 72 54 mov %esi,0x54(%rdx) 0.00 : 470ef3: 41 be 01 00 00 00 mov $0x1,%r14d : * We can only cache the offset for a varlena attribute if the : * offset is already suitably aligned, so that there would be : * no pad bytes in any case: then the offset will be valid for : * either an aligned or unaligned value. : */ : if (usecache && 0.00 : 470ef9: e9 7a fd ff ff jmpq 470c78 0.00 : 470efe: 66 90 xchg %ax,%ax : if (usecache && att[i]->attlen <= 0) : usecache = false; : } : } : : return fetchatt(att[attnum], tp + off); 0.00 : 470f00: 48 63 c6 movslq %esi,%rax 0.00 : 470f03: 41 8b 04 03 mov (%r11,%rax,1),%eax 0.00 : 470f07: e9 4b ff ff ff jmpq 470e57 0.00 : 470f0c: 0f 1f 40 00 nopl 0x0(%rax) : } : : if (i == attnum) : break; : : off = att_addlength_pointer(off, att[i]->attlen, tp + off); 0.00 : 470f10: 41 0f b6 54 13 01 movzbl 0x1(%r11,%rdx,1),%edx 0.00 : 470f16: b8 0a 00 00 00 mov $0xa,%eax 0.00 : 470f1b: 80 fa 01 cmp $0x1,%dl 0.00 : 470f1e: 0f 84 54 fe ff ff je 470d78 0.00 : 470f24: 80 fa 12 cmp $0x12,%dl 0.00 : 470f27: b8 03 00 00 00 mov $0x3,%eax 0.00 : 470f2c: ba 12 00 00 00 mov $0x12,%edx 0.00 : 470f31: 0f 44 c2 cmove %edx,%eax 0.00 : 470f34: 8d 34 30 lea (%rax,%rsi,1),%esi 0.00 : 470f37: e9 5a fd ff ff jmpq 470c96 : /* : * Otherwise, check for non-fixed-length attrs up to and including : * target. If there aren't any, it's safe to cheaply initialize the : * cached offsets for these attrs. : */ : if (IndexTupleHasVarwidths(tup)) 0.00 : 470f3c: 66 41 f7 c0 00 40 test $0x4000,%r8w 0.00 : 470f42: 0f 84 58 01 00 00 je 4710a0 : { : int j; : : for (j = 0; j <= attnum; j++) 0.00 : 470f48: 45 85 d2 test %r10d,%r10d 0.00 : 470f4b: 0f 88 4f 01 00 00 js 4710a0 : { : if (att[j]->attlen <= 0) 0.00 : 470f51: 49 8b 0f mov (%r15),%rcx 0.00 : 470f54: 31 d2 xor %edx,%edx 0.00 : 470f56: 66 83 79 4c 00 cmpw $0x0,0x4c(%rcx) 0.00 : 470f5b: 7f 1d jg 470f7a 0.00 : 470f5d: 0f 1f 00 nopl (%rax) 0.00 : 470f60: e9 c4 fc ff ff jmpq 470c29 0.00 : 470f65: 0f 1f 00 nopl (%rax) 0.00 : 470f68: 48 63 c2 movslq %edx,%rax 0.00 : 470f6b: 49 8b 04 c7 mov (%r15,%rax,8),%rax 0.00 : 470f6f: 66 83 78 4c 00 cmpw $0x0,0x4c(%rax) 0.00 : 470f74: 0f 8e af fc ff ff jle 470c29 : */ : if (IndexTupleHasVarwidths(tup)) : { : int j; : : for (j = 0; j <= attnum; j++) 0.00 : 470f7a: 83 c2 01 add $0x1,%edx 0.00 : 470f7d: 41 39 d2 cmp %edx,%r10d 0.00 : 470f80: 7d e6 jge 470f68 : } : } : : if (!slow) : { : int natts = tupleDesc->natts; 0.00 : 470f82: 44 8b 0f mov (%rdi),%r9d : * it's cheap to compute offsets for fixed-width columns, we take the : * opportunity to initialize the cached offsets for *all* the leading : * fixed-width columns, in hope of avoiding future visits to this : * routine. : */ : att[0]->attcacheoff = 0; 0.00 : 470f85: c7 41 54 00 00 00 00 movl $0x0,0x54(%rcx) : : /* we might have set some offsets in the slow path previously */ : while (j < natts && att[j]->attcacheoff > 0) 0.00 : 470f8c: 41 83 f9 01 cmp $0x1,%r9d 0.00 : 470f90: 7e 35 jle 470fc7 0.00 : 470f92: 49 8b 47 08 mov 0x8(%r15),%rax 0.00 : 470f96: 8b 50 54 mov 0x54(%rax),%edx 0.00 : 470f99: 85 d2 test %edx,%edx 0.00 : 470f9b: 0f 8e 64 01 00 00 jle 471105 0.00 : 470fa1: 4c 89 fa mov %r15,%rdx 0.00 : 470fa4: be 01 00 00 00 mov $0x1,%esi 0.00 : 470fa9: eb 14 jmp 470fbf 0.00 : 470fab: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 470fb0: 48 8b 42 10 mov 0x10(%rdx),%rax 0.00 : 470fb4: 48 83 c2 08 add $0x8,%rdx 0.00 : 470fb8: 8b 40 54 mov 0x54(%rax),%eax 0.00 : 470fbb: 85 c0 test %eax,%eax 0.00 : 470fbd: 7e 19 jle 470fd8 : j++; 0.00 : 470fbf: 83 c6 01 add $0x1,%esi : * routine. : */ : att[0]->attcacheoff = 0; : : /* we might have set some offsets in the slow path previously */ : while (j < natts && att[j]->attcacheoff > 0) 0.00 : 470fc2: 41 39 f1 cmp %esi,%r9d 0.00 : 470fc5: 7f e9 jg 470fb0 : off += att[j]->attlen; : } : : Assert(j > attnum); : : off = att[attnum]->attcacheoff; 0.00 : 470fc7: 48 8b 03 mov (%rbx),%rax 0.00 : 470fca: 8b 70 54 mov 0x54(%rax),%esi 0.00 : 470fcd: e9 06 fd ff ff jmpq 470cd8 0.00 : 470fd2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * routine. : */ : att[0]->attcacheoff = 0; : : /* we might have set some offsets in the slow path previously */ : while (j < natts && att[j]->attcacheoff > 0) 0.00 : 470fd8: 89 f0 mov %esi,%eax : j++; : : off = att[j - 1]->attcacheoff + att[j - 1]->attlen; 0.00 : 470fda: 48 63 d0 movslq %eax,%rdx 0.00 : 470fdd: 49 8b 44 d7 f8 mov -0x8(%r15,%rdx,8),%rax : : for (; j < natts; j++) : { : if (att[j]->attlen <= 0) 0.00 : 470fe2: 49 8d 14 d7 lea (%r15,%rdx,8),%rdx 0.00 : 470fe6: 48 8b 3a mov (%rdx),%rdi : : /* we might have set some offsets in the slow path previously */ : while (j < natts && att[j]->attcacheoff > 0) : j++; : : off = att[j - 1]->attcacheoff + att[j - 1]->attlen; 0.00 : 470fe9: 8b 48 54 mov 0x54(%rax),%ecx 0.00 : 470fec: 0f b7 40 4c movzwl 0x4c(%rax),%eax : : for (; j < natts; j++) : { : if (att[j]->attlen <= 0) 0.00 : 470ff0: 66 83 7f 4c 00 cmpw $0x0,0x4c(%rdi) : : /* we might have set some offsets in the slow path previously */ : while (j < natts && att[j]->attcacheoff > 0) : j++; : : off = att[j - 1]->attcacheoff + att[j - 1]->attlen; 0.00 : 470ff5: 98 cwtl 0.00 : 470ff6: 8d 0c 08 lea (%rax,%rcx,1),%ecx : : for (; j < natts; j++) : { : if (att[j]->attlen <= 0) 0.00 : 470ff9: 7f 3f jg 47103a 0.00 : 470ffb: eb ca jmp 470fc7 0.00 : 470ffd: 0f 1f 00 nopl (%rax) : break; : : off = att_align_nominal(off, att[j]->attalign); 0.00 : 471000: 3c 63 cmp $0x63,%al 0.00 : 471002: 74 0c je 471010 0.00 : 471004: 3c 64 cmp $0x64,%al 0.00 : 471006: 66 90 xchg %ax,%ax 0.00 : 471008: 74 46 je 471050 0.00 : 47100a: 83 c1 01 add $0x1,%ecx 0.00 : 47100d: 83 e1 fe and $0xfffffffe,%ecx : : att[j]->attcacheoff = off; 0.00 : 471010: 89 4f 54 mov %ecx,0x54(%rdi) : : off += att[j]->attlen; 0.00 : 471013: 48 8b 02 mov (%rdx),%rax : while (j < natts && att[j]->attcacheoff > 0) : j++; : : off = att[j - 1]->attcacheoff + att[j - 1]->attlen; : : for (; j < natts; j++) 0.00 : 471016: 83 c6 01 add $0x1,%esi 0.00 : 471019: 41 39 f1 cmp %esi,%r9d : : off = att_align_nominal(off, att[j]->attalign); : : att[j]->attcacheoff = off; : : off += att[j]->attlen; 0.00 : 47101c: 44 0f b7 40 4c movzwl 0x4c(%rax),%r8d : while (j < natts && att[j]->attcacheoff > 0) : j++; : : off = att[j - 1]->attcacheoff + att[j - 1]->attlen; : : for (; j < natts; j++) 0.00 : 471021: 7e a4 jle 470fc7 : { : if (att[j]->attlen <= 0) 0.00 : 471023: 48 63 c6 movslq %esi,%rax 0.00 : 471026: 49 8d 14 c7 lea (%r15,%rax,8),%rdx 0.00 : 47102a: 48 8b 3a mov (%rdx),%rdi 0.00 : 47102d: 66 83 7f 4c 00 cmpw $0x0,0x4c(%rdi) 0.00 : 471032: 7e 93 jle 470fc7 : : off = att_align_nominal(off, att[j]->attalign); : : att[j]->attcacheoff = off; : : off += att[j]->attlen; 0.00 : 471034: 41 0f bf c0 movswl %r8w,%eax 0.00 : 471038: 01 c1 add %eax,%ecx : for (; j < natts; j++) : { : if (att[j]->attlen <= 0) : break; : : off = att_align_nominal(off, att[j]->attalign); 0.00 : 47103a: 0f b6 47 5e movzbl 0x5e(%rdi),%eax 0.00 : 47103e: 3c 69 cmp $0x69,%al 0.00 : 471040: 75 be jne 471000 0.00 : 471042: 83 c1 03 add $0x3,%ecx 0.00 : 471045: 83 e1 fc and $0xfffffffc,%ecx 0.00 : 471048: eb c6 jmp 471010 0.00 : 47104a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 471050: 83 c1 07 add $0x7,%ecx 0.00 : 471053: 83 e1 f8 and $0xfffffff8,%ecx 0.00 : 471056: eb b8 jmp 471010 0.00 : 471058: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 47105f: 00 : * We can only cache the offset for a varlena attribute if the : * offset is already suitably aligned, so that there would be : * no pad bytes in any case: then the offset will be valid for : * either an aligned or unaligned value. : */ : if (usecache && 0.00 : 471060: 48 8d 48 03 lea 0x3(%rax),%rcx 0.00 : 471064: 48 83 e1 fc and $0xfffffffffffffffc,%rcx 0.00 : 471068: e9 42 fd ff ff jmpq 470daf 0.00 : 47106d: 0f 1f 00 nopl (%rax) : if (usecache && att[i]->attlen <= 0) : usecache = false; : } : } : : return fetchatt(att[attnum], tp + off); 0.00 : 471070: 48 63 c6 movslq %esi,%rax 0.00 : 471073: 49 8b 04 03 mov (%r11,%rax,1),%rax : } 0.00 : 471077: 48 83 c4 28 add $0x28,%rsp 0.00 : 47107b: 5b pop %rbx 0.00 : 47107c: 41 5c pop %r12 0.00 : 47107e: 41 5d pop %r13 0.00 : 471080: 41 5e pop %r14 0.00 : 471082: 41 5f pop %r15 0.00 : 471084: c9 leaveq 0.00 : 471085: c3 retq 0.00 : 471086: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 47108d: 00 00 00 : if (usecache && : off == att_align_nominal(off, att[i]->attalign)) : att[i]->attcacheoff = off; : else : { : off = att_align_pointer(off, att[i]->attalign, -1, 0.00 : 471090: 83 c6 03 add $0x3,%esi 0.00 : 471093: 45 31 f6 xor %r14d,%r14d 0.00 : 471096: 83 e6 fc and $0xfffffffc,%esi 0.00 : 471099: e9 da fb ff ff jmpq 470c78 0.00 : 47109e: 66 90 xchg %ax,%ax : */ : if (IndexTupleHasVarwidths(tup)) : { : int j; : : for (j = 0; j <= attnum; j++) 0.00 : 4710a0: 49 8b 0f mov (%r15),%rcx 0.00 : 4710a3: e9 da fe ff ff jmpq 470f82 0.00 : 4710a8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 4710af: 00 : * If we get here, there are no nulls up to and including the target : * attribute. If we have a cached offset, we can use it. : */ : if (att[attnum]->attcacheoff >= 0) : { : return fetchatt(att[attnum], 0.00 : 4710b0: 48 98 cltq 0.00 : 4710b2: 49 8b 04 03 mov (%r11,%rax,1),%rax 0.00 : 4710b6: e9 9c fd ff ff jmpq 470e57 0.00 : 4710bb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : * We can only cache the offset for a varlena attribute if the : * offset is already suitably aligned, so that there would be : * no pad bytes in any case: then the offset will be valid for : * either an aligned or unaligned value. : */ : if (usecache && 0.00 : 4710c0: 48 8d 48 07 lea 0x7(%rax),%rcx 0.00 : 4710c4: 48 83 e1 f8 and $0xfffffffffffffff8,%rcx 0.00 : 4710c8: e9 e2 fc ff ff jmpq 470daf 0.00 : 4710cd: 0f 1f 00 nopl (%rax) : if (usecache && att[i]->attlen <= 0) : usecache = false; : } : } : : return fetchatt(att[attnum], tp + off); 0.00 : 4710d0: 48 63 c6 movslq %esi,%rax 0.00 : 4710d3: 41 0f b7 04 03 movzwl (%r11,%rax,1),%eax 0.00 : 4710d8: e9 7a fd ff ff jmpq 470e57 0.00 : 4710dd: 0f 1f 00 nopl (%rax) : if (usecache && : off == att_align_nominal(off, att[i]->attalign)) : att[i]->attcacheoff = off; : else : { : off = att_align_pointer(off, att[i]->attalign, -1, 0.00 : 4710e0: 83 c6 07 add $0x7,%esi 0.00 : 4710e3: 45 31 f6 xor %r14d,%r14d 0.00 : 4710e6: 83 e6 f8 and $0xfffffff8,%esi 0.00 : 4710e9: e9 8a fb ff ff jmpq 470c78 : * If we get here, there are no nulls up to and including the target : * attribute. If we have a cached offset, we can use it. : */ : if (att[attnum]->attcacheoff >= 0) : { : return fetchatt(att[attnum], 0.00 : 4710ee: 48 98 cltq 0.00 : 4710f0: 41 8b 04 03 mov (%r11,%rax,1),%eax 0.00 : 4710f4: e9 5e fd ff ff jmpq 470e57 0.00 : 4710f9: 48 98 cltq 0.00 : 4710fb: 41 0f b7 04 03 movzwl (%r11,%rax,1),%eax 0.00 : 471100: e9 52 fd ff ff jmpq 470e57 : } : } : } : } : : tp = (char *) tup + data_off; 0.00 : 471105: b8 01 00 00 00 mov $0x1,%eax 0.00 : 47110a: be 01 00 00 00 mov $0x1,%esi 0.00 : 47110f: e9 c6 fe ff ff jmpq 470fda Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/access/transam/transam.c:312 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000004bffe0 : : /* : * TransactionIdPrecedes --- is id1 logically < id2? : */ : bool : TransactionIdPrecedes(TransactionId id1, TransactionId id2) : { 0.00 : 4bffe0: 55 push %rbp : * If either ID is a permanent XID then we can just do unsigned : * comparison. If both are normal, do a modulo-2^32 comparison. : */ : int32 diff; : : if (!TransactionIdIsNormal(id1) || !TransactionIdIsNormal(id2)) 0.00 : 4bffe1: 83 ff 02 cmp $0x2,%edi : /* : * TransactionIdPrecedes --- is id1 logically < id2? : */ : bool : TransactionIdPrecedes(TransactionId id1, TransactionId id2) : { 0.00 : 4bffe4: 48 89 e5 mov %rsp,%rbp : * If either ID is a permanent XID then we can just do unsigned : * comparison. If both are normal, do a modulo-2^32 comparison. : */ : int32 diff; : : if (!TransactionIdIsNormal(id1) || !TransactionIdIsNormal(id2)) 0.00 : 4bffe7: 76 17 jbe 4c0000 0.00 : 4bffe9: 83 fe 02 cmp $0x2,%esi 0.00 : 4bffec: 76 12 jbe 4c0000 : return (id1 < id2); : : diff = (int32) (id1 - id2); : return (diff < 0); /home/Computational/mark/src/postgres-andres/src/backend/access/transam/transam.c:312 100.00 : 4bffee: 29 f7 sub %esi,%edi : } 0.00 : 4bfff0: c9 leaveq : : if (!TransactionIdIsNormal(id1) || !TransactionIdIsNormal(id2)) : return (id1 < id2); : : diff = (int32) (id1 - id2); : return (diff < 0); 0.00 : 4bfff1: 89 f8 mov %edi,%eax 0.00 : 4bfff3: c1 e8 1f shr $0x1f,%eax : } 0.00 : 4bfff6: c3 retq 0.00 : 4bfff7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 4bfffe: 00 00 : * comparison. If both are normal, do a modulo-2^32 comparison. : */ : int32 diff; : : if (!TransactionIdIsNormal(id1) || !TransactionIdIsNormal(id2)) : return (id1 < id2); 0.00 : 4c0000: 39 f7 cmp %esi,%edi : : diff = (int32) (id1 - id2); : return (diff < 0); : } 0.00 : 4c0002: c9 leaveq : * comparison. If both are normal, do a modulo-2^32 comparison. : */ : int32 diff; : : if (!TransactionIdIsNormal(id1) || !TransactionIdIsNormal(id2)) : return (id1 < id2); 0.00 : 4c0003: 0f 92 c0 setb %al Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:695 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b16a0 : : * ---------------------------------------------------------------- : */ : static Datum : ExecEvalScalarVarFast(ExprState *exprstate, ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { 0.00 : 5b16a0: 55 push %rbp : Var *variable = (Var *) exprstate->expr; : TupleTableSlot *slot; : AttrNumber attnum; : : if (isDone) 0.00 : 5b16a1: 48 85 c9 test %rcx,%rcx : */ : static Datum : ExecEvalScalarVarFast(ExprState *exprstate, ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { : Var *variable = (Var *) exprstate->expr; 0.00 : 5b16a4: 4c 8b 47 08 mov 0x8(%rdi),%r8 : * ---------------------------------------------------------------- : */ : static Datum : ExecEvalScalarVarFast(ExprState *exprstate, ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { 0.00 : 5b16a8: 48 89 e5 mov %rsp,%rbp : Var *variable = (Var *) exprstate->expr; : TupleTableSlot *slot; : AttrNumber attnum; : : if (isDone) 0.00 : 5b16ab: 74 06 je 5b16b3 : *isDone = ExprSingleResult; 0.00 : 5b16ad: c7 01 00 00 00 00 movl $0x0,(%rcx) : : /* Get the input slot and attribute number we want */ : switch (variable->varno) 0.00 : 5b16b3: 41 8b 40 04 mov 0x4(%r8),%eax 0.00 : 5b16b7: 3d e8 fd 00 00 cmp $0xfde8,%eax 0.00 : 5b16bc: 74 1a je 5b16d8 0.00 : 5b16be: 3d e9 fd 00 00 cmp $0xfde9,%eax 0.00 : 5b16c3: 74 2b je 5b16f0 : : /* INDEX_VAR is handled by default case */ : : default: /* get the tuple from the relation being : * scanned */ : slot = econtext->ecxt_scantuple; 0.00 : 5b16c5: 48 8b 7e 08 mov 0x8(%rsi),%rdi : } : : attnum = variable->varattno; : : /* Fetch the value from the slot */ : return slot_getattr(slot, attnum, isNull); 0.00 : 5b16c9: 41 0f bf 70 08 movswl 0x8(%r8),%esi : } 0.00 : 5b16ce: c9 leaveq : } : : attnum = variable->varattno; : : /* Fetch the value from the slot */ : return slot_getattr(slot, attnum, isNull); 0.00 : 5b16cf: e9 2c dd eb ff jmpq 46f400 0.00 : 5b16d4: 0f 1f 40 00 nopl 0x0(%rax) : : /* Get the input slot and attribute number we want */ : switch (variable->varno) : { : case INNER_VAR: /* get the tuple from the inner node */ : slot = econtext->ecxt_innertuple; 0.00 : 5b16d8: 48 8b 7e 10 mov 0x10(%rsi),%rdi : } : : attnum = variable->varattno; : : /* Fetch the value from the slot */ : return slot_getattr(slot, attnum, isNull); 0.00 : 5b16dc: 41 0f bf 70 08 movswl 0x8(%r8),%esi : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:695 100.00 : 5b16e1: c9 leaveq : } : : attnum = variable->varattno; : : /* Fetch the value from the slot */ : return slot_getattr(slot, attnum, isNull); 0.00 : 5b16e2: e9 19 dd eb ff jmpq 46f400 0.00 : 5b16e7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5b16ee: 00 00 : case INNER_VAR: /* get the tuple from the inner node */ : slot = econtext->ecxt_innertuple; : break; : : case OUTER_VAR: /* get the tuple from the outer node */ : slot = econtext->ecxt_outertuple; 0.00 : 5b16f0: 48 8b 7e 18 mov 0x18(%rsi),%rdi : } : : attnum = variable->varattno; : : /* Fetch the value from the slot */ : return slot_getattr(slot, attnum, isNull); 0.00 : 5b16f4: 41 0f bf 70 08 movswl 0x8(%r8),%esi : } 0.00 : 5b16f9: c9 leaveq : } : : attnum = variable->varattno; : : /* Fetch the value from the slot */ : return slot_getattr(slot, attnum, isNull); 0.00 : 5b16fa: e9 01 dd eb ff jmpq 46f400 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:444 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b9790 : : */ : static void : advance_transition_function(AggState *aggstate, : AggStatePerAgg peraggstate, : AggStatePerGroup pergroupstate) : { 0.00 : 5b9790: 55 push %rbp 0.00 : 5b9791: 48 89 e5 mov %rsp,%rbp 0.00 : 5b9794: 4c 89 65 e0 mov %r12,-0x20(%rbp) 0.00 : 5b9798: 4c 89 6d e8 mov %r13,-0x18(%rbp) 0.00 : 5b979c: 49 89 f4 mov %rsi,%r12 0.00 : 5b979f: 4c 89 75 f0 mov %r14,-0x10(%rbp) 0.00 : 5b97a3: 48 89 5d d8 mov %rbx,-0x28(%rbp) 0.00 : 5b97a7: 49 89 fe mov %rdi,%r14 0.00 : 5b97aa: 4c 89 7d f8 mov %r15,-0x8(%rbp) 0.00 : 5b97ae: 48 83 ec 30 sub $0x30,%rsp : FunctionCallInfo fcinfo = &peraggstate->transfn_fcinfo; : MemoryContext oldContext; : Datum newVal; : : if (peraggstate->transfn.fn_strict) 0.00 : 5b97b2: 80 7e 36 00 cmpb $0x0,0x36(%rsi) : */ : static void : advance_transition_function(AggState *aggstate, : AggStatePerAgg peraggstate, : AggStatePerGroup pergroupstate) : { 0.00 : 5b97b6: 49 89 d5 mov %rdx,%r13 : FunctionCallInfo fcinfo = &peraggstate->transfn_fcinfo; : MemoryContext oldContext; : Datum newVal; : : if (peraggstate->transfn.fn_strict) 0.00 : 5b97b9: 74 4c je 5b9807 : { : /* : * For a strict transfn, nothing happens when there's a NULL input; we : * just keep the prior transValue. : */ : int numTransInputs = peraggstate->numTransInputs; 0.00 : 5b97bb: 8b 4e 18 mov 0x18(%rsi),%ecx : int i; : : for (i = 1; i <= numTransInputs; i++) 0.00 : 5b97be: 85 c9 test %ecx,%ecx 0.00 : 5b97c0: 7e 2f jle 5b97f1 : { : if (fcinfo->argnull[i]) 0.00 : 5b97c2: 80 be 41 04 00 00 00 cmpb $0x0,0x441(%rsi) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:444 100.00 : 5b97c9: ba 01 00 00 00 mov $0x1,%edx 0.00 : 5b97ce: 74 1a je 5b97ea 0.00 : 5b97d0: e9 e3 00 00 00 jmpq 5b98b8 0.00 : 5b97d5: 0f 1f 00 nopl (%rax) 0.00 : 5b97d8: 48 63 c2 movslq %edx,%rax 0.00 : 5b97db: 41 80 bc 04 40 04 00 cmpb $0x0,0x440(%r12,%rax,1) 0.00 : 5b97e2: 00 00 0.00 : 5b97e4: 0f 85 ce 00 00 00 jne 5b98b8 : * just keep the prior transValue. : */ : int numTransInputs = peraggstate->numTransInputs; : int i; : : for (i = 1; i <= numTransInputs; i++) 0.00 : 5b97ea: 83 c2 01 add $0x1,%edx 0.00 : 5b97ed: 39 d1 cmp %edx,%ecx 0.00 : 5b97ef: 7d e7 jge 5b97d8 : { : if (fcinfo->argnull[i]) : return; : } : if (pergroupstate->noTransValue) 0.00 : 5b97f1: 41 80 7d 09 00 cmpb $0x0,0x9(%r13) 0.00 : 5b97f6: 0f 85 d4 00 00 00 jne 5b98d0 : pergroupstate->transValueIsNull = false; : pergroupstate->noTransValue = false; : MemoryContextSwitchTo(oldContext); : return; : } : if (pergroupstate->transValueIsNull) 0.00 : 5b97fc: 41 80 7d 08 00 cmpb $0x0,0x8(%r13) 0.00 : 5b9801: 0f 85 b1 00 00 00 jne 5b98b8 : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; : : CurrentMemoryContext = context; 0.00 : 5b9807: 49 8b 86 c0 00 00 00 mov 0xc0(%r14),%rax : #endif /* !PG_USE_INLINE */ : #if defined(PG_USE_INLINE) || defined(MCXT_INCLUDE_DEFINITIONS) : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; 0.00 : 5b980e: 4c 8b 3d 4b 10 60 00 mov 0x60104b(%rip),%r15 # bba860 : */ : fcinfo->arg[0] = pergroupstate->transValue; : fcinfo->argnull[0] = pergroupstate->transValueIsNull; : fcinfo->isnull = false; /* just in case transfn doesn't set it */ : : newVal = FunctionCallInvoke(fcinfo); 0.00 : 5b9815: 49 8d bc 24 00 01 00 lea 0x100(%r12),%rdi 0.00 : 5b981c: 00 : : CurrentMemoryContext = context; 0.00 : 5b981d: 48 8b 40 28 mov 0x28(%rax),%rax 0.00 : 5b9821: 48 89 05 38 10 60 00 mov %rax,0x601038(%rip) # bba860 : : /* We run the transition functions in per-input-tuple memory context */ : oldContext = MemoryContextSwitchTo(aggstate->tmpcontext->ecxt_per_tuple_memory); : : /* set up aggstate->curperagg for AggGetAggref() */ : aggstate->curperagg = peraggstate; 0.00 : 5b9828: 4d 89 a6 c8 00 00 00 mov %r12,0xc8(%r14) : : /* : * OK to call the transition function : */ : fcinfo->arg[0] = pergroupstate->transValue; 0.00 : 5b982f: 49 8b 45 00 mov 0x0(%r13),%rax 0.00 : 5b9833: 49 89 84 24 20 01 00 mov %rax,0x120(%r12) 0.00 : 5b983a: 00 : fcinfo->argnull[0] = pergroupstate->transValueIsNull; 0.00 : 5b983b: 41 0f b6 45 08 movzbl 0x8(%r13),%eax : fcinfo->isnull = false; /* just in case transfn doesn't set it */ 0.00 : 5b9840: 41 c6 84 24 1c 01 00 movb $0x0,0x11c(%r12) 0.00 : 5b9847: 00 00 : : /* : * OK to call the transition function : */ : fcinfo->arg[0] = pergroupstate->transValue; : fcinfo->argnull[0] = pergroupstate->transValueIsNull; 0.00 : 5b9849: 41 88 84 24 40 04 00 mov %al,0x440(%r12) 0.00 : 5b9850: 00 : fcinfo->isnull = false; /* just in case transfn doesn't set it */ : : newVal = FunctionCallInvoke(fcinfo); 0.00 : 5b9851: 49 8b 84 24 00 01 00 mov 0x100(%r12),%rax 0.00 : 5b9858: 00 0.00 : 5b9859: ff 10 callq *(%rax) : : aggstate->curperagg = NULL; 0.00 : 5b985b: 49 c7 86 c8 00 00 00 movq $0x0,0xc8(%r14) 0.00 : 5b9862: 00 00 00 00 : /* : * If pass-by-ref datatype, must copy the new value into aggcontext and : * pfree the prior transValue. But if transfn returned a pointer to its : * first input, we don't need to do anything. : */ : if (!peraggstate->transtypeByVal && 0.00 : 5b9866: 41 80 bc 24 d2 00 00 cmpb $0x0,0xd2(%r12) 0.00 : 5b986d: 00 00 : */ : fcinfo->arg[0] = pergroupstate->transValue; : fcinfo->argnull[0] = pergroupstate->transValueIsNull; : fcinfo->isnull = false; /* just in case transfn doesn't set it */ : : newVal = FunctionCallInvoke(fcinfo); 0.00 : 5b986f: 48 89 c3 mov %rax,%rbx : /* : * If pass-by-ref datatype, must copy the new value into aggcontext and : * pfree the prior transValue. But if transfn returned a pointer to its : * first input, we don't need to do anything. : */ : if (!peraggstate->transtypeByVal && 0.00 : 5b9872: 75 2c jne 5b98a0 0.00 : 5b9874: 49 3b 45 00 cmp 0x0(%r13),%rax 0.00 : 5b9878: 74 26 je 5b98a0 : DatumGetPointer(newVal) != DatumGetPointer(pergroupstate->transValue)) : { : if (!fcinfo->isnull) 0.00 : 5b987a: 41 80 bc 24 1c 01 00 cmpb $0x0,0x11c(%r12) 0.00 : 5b9881: 00 00 0.00 : 5b9883: 0f 84 92 00 00 00 je 5b991b : MemoryContextSwitchTo(aggstate->aggcontext); : newVal = datumCopy(newVal, : peraggstate->transtypeByVal, : peraggstate->transtypeLen); : } : if (!pergroupstate->transValueIsNull) 0.00 : 5b9889: 41 80 7d 08 00 cmpb $0x0,0x8(%r13) 0.00 : 5b988e: 66 90 xchg %ax,%ax 0.00 : 5b9890: 75 0e jne 5b98a0 : pfree(DatumGetPointer(pergroupstate->transValue)); 0.00 : 5b9892: 49 8b 7d 00 mov 0x0(%r13),%rdi 0.00 : 5b9896: e8 e5 f2 1d 00 callq 798b80 0.00 : 5b989b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : } : : pergroupstate->transValue = newVal; 0.00 : 5b98a0: 49 89 5d 00 mov %rbx,0x0(%r13) : pergroupstate->transValueIsNull = fcinfo->isnull; 0.00 : 5b98a4: 41 0f b6 84 24 1c 01 movzbl 0x11c(%r12),%eax 0.00 : 5b98ab: 00 00 0.00 : 5b98ad: 41 88 45 08 mov %al,0x8(%r13) 0.00 : 5b98b1: 4c 89 3d a8 0f 60 00 mov %r15,0x600fa8(%rip) # bba860 : : MemoryContextSwitchTo(oldContext); : } 0.00 : 5b98b8: 48 8b 5d d8 mov -0x28(%rbp),%rbx 0.00 : 5b98bc: 4c 8b 65 e0 mov -0x20(%rbp),%r12 0.00 : 5b98c0: 4c 8b 6d e8 mov -0x18(%rbp),%r13 0.00 : 5b98c4: 4c 8b 75 f0 mov -0x10(%rbp),%r14 0.00 : 5b98c8: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 5b98cc: c9 leaveq 0.00 : 5b98cd: c3 retq 0.00 : 5b98ce: 66 90 xchg %ax,%ax 0.00 : 5b98d0: 49 8b 86 b8 00 00 00 mov 0xb8(%r14),%rax : #endif /* !PG_USE_INLINE */ : #if defined(PG_USE_INLINE) || defined(MCXT_INCLUDE_DEFINITIONS) : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; 0.00 : 5b98d7: 48 8b 1d 82 0f 60 00 mov 0x600f82(%rip),%rbx # bba860 : : CurrentMemoryContext = context; 0.00 : 5b98de: 48 89 05 7b 0f 60 00 mov %rax,0x600f7b(%rip) # bba860 : * : * We must copy the datum into aggcontext if it is pass-by-ref. We : * do not need to pfree the old transValue, since it's NULL. : */ : oldContext = MemoryContextSwitchTo(aggstate->aggcontext); : pergroupstate->transValue = datumCopy(fcinfo->arg[1], 0.00 : 5b98e5: 41 0f bf 94 24 ce 00 movswl 0xce(%r12),%edx 0.00 : 5b98ec: 00 00 0.00 : 5b98ee: 41 0f be b4 24 d2 00 movsbl 0xd2(%r12),%esi 0.00 : 5b98f5: 00 00 0.00 : 5b98f7: 49 8b bc 24 28 01 00 mov 0x128(%r12),%rdi 0.00 : 5b98fe: 00 0.00 : 5b98ff: e8 6c 66 11 00 callq 6cff70 : peraggstate->transtypeByVal, : peraggstate->transtypeLen); : pergroupstate->transValueIsNull = false; 0.00 : 5b9904: 41 c6 45 08 00 movb $0x0,0x8(%r13) : * : * We must copy the datum into aggcontext if it is pass-by-ref. We : * do not need to pfree the old transValue, since it's NULL. : */ : oldContext = MemoryContextSwitchTo(aggstate->aggcontext); : pergroupstate->transValue = datumCopy(fcinfo->arg[1], 0.00 : 5b9909: 49 89 45 00 mov %rax,0x0(%r13) : peraggstate->transtypeByVal, : peraggstate->transtypeLen); : pergroupstate->transValueIsNull = false; : pergroupstate->noTransValue = false; 0.00 : 5b990d: 41 c6 45 09 00 movb $0x0,0x9(%r13) 0.00 : 5b9912: 48 89 1d 47 0f 60 00 mov %rbx,0x600f47(%rip) # bba860 0.00 : 5b9919: eb 9d jmp 5b98b8 0.00 : 5b991b: 49 8b 86 b8 00 00 00 mov 0xb8(%r14),%rax : DatumGetPointer(newVal) != DatumGetPointer(pergroupstate->transValue)) : { : if (!fcinfo->isnull) : { : MemoryContextSwitchTo(aggstate->aggcontext); : newVal = datumCopy(newVal, 0.00 : 5b9922: 48 89 df mov %rbx,%rdi 0.00 : 5b9925: 48 89 05 34 0f 60 00 mov %rax,0x600f34(%rip) # bba860 0.00 : 5b992c: 41 0f bf 94 24 ce 00 movswl 0xce(%r12),%edx 0.00 : 5b9933: 00 00 0.00 : 5b9935: 41 0f be b4 24 d2 00 movsbl 0xd2(%r12),%esi 0.00 : 5b993c: 00 00 0.00 : 5b993e: e8 2d 66 11 00 callq 6cff70 0.00 : 5b9943: 48 89 c3 mov %rax,%rbx 0.00 : 5b9946: e9 3e ff ff ff jmpq 5b9889 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:1022 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005e34f0 : : * qsort comparator to handle PagetableEntry pointers. : */ : static int : tbm_comparator(const void *left, const void *right) : { : BlockNumber l = (*((PagetableEntry *const *) left))->blockno; 0.00 : 5e34f0: 48 8b 17 mov (%rdi),%rdx : BlockNumber r = (*((PagetableEntry *const *) right))->blockno; 0.00 : 5e34f3: 48 8b 06 mov (%rsi),%rax : : if (l < r) 0.00 : 5e34f6: b9 ff ff ff ff mov $0xffffffff,%ecx : /* : * qsort comparator to handle PagetableEntry pointers. : */ : static int : tbm_comparator(const void *left, const void *right) : { 0.00 : 5e34fb: 55 push %rbp : BlockNumber l = (*((PagetableEntry *const *) left))->blockno; : BlockNumber r = (*((PagetableEntry *const *) right))->blockno; 0.00 : 5e34fc: 8b 00 mov (%rax),%eax : : if (l < r) 0.00 : 5e34fe: 39 02 cmp %eax,(%rdx) : /* : * qsort comparator to handle PagetableEntry pointers. : */ : static int : tbm_comparator(const void *left, const void *right) : { 0.00 : 5e3500: 48 89 e5 mov %rsp,%rbp : BlockNumber l = (*((PagetableEntry *const *) left))->blockno; : BlockNumber r = (*((PagetableEntry *const *) right))->blockno; : : if (l < r) 0.00 : 5e3503: 72 06 jb 5e350b 0.00 : 5e3505: 0f 97 c0 seta %al 0.00 : 5e3508: 0f b6 c8 movzbl %al,%ecx : return -1; : else if (l > r) : return 1; : return 0; : } 0.00 : 5e350b: 89 c8 mov %ecx,%eax /home/Computational/mark/src/postgres-andres/src/backend/nodes/tidbitmap.c:1022 100.00 : 5e350d: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:164 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000674520 : : * : * Only works for shared buffers. : */ : static PrivateRefCountEntry* : GetPrivateRefCountEntry(Buffer buffer, bool create, bool do_move) : { 0.00 : 674520: 55 push %rbp 0.00 : 674521: 48 89 e5 mov %rsp,%rbp 0.00 : 674524: 41 57 push %r15 0.00 : 674526: 41 89 f7 mov %esi,%r15d : */ : for (i = 0; i < REFCOUNT_ARRAY_ENTRIES; i++) : { : res = &PrivateRefCountArray[i]; : : if (res->buffer == buffer) 0.00 : 674529: 89 fe mov %edi,%esi : * : * Only works for shared buffers. : */ : static PrivateRefCountEntry* : GetPrivateRefCountEntry(Buffer buffer, bool create, bool do_move) : { 0.00 : 67452b: 41 56 push %r14 0.00 : 67452d: 41 55 push %r13 0.00 : 67452f: 41 54 push %r12 0.00 : 674531: 41 89 d4 mov %edx,%r12d : */ : for (i = 0; i < REFCOUNT_ARRAY_ENTRIES; i++) : { : res = &PrivateRefCountArray[i]; : : if (res->buffer == buffer) 0.00 : 674534: ba c0 d0 b7 00 mov $0xb7d0c0,%edx : * : * Only works for shared buffers. : */ : static PrivateRefCountEntry* : GetPrivateRefCountEntry(Buffer buffer, bool create, bool do_move) : { 0.00 : 674539: 53 push %rbx : */ : for (i = 0; i < REFCOUNT_ARRAY_ENTRIES; i++) : { : res = &PrivateRefCountArray[i]; : : if (res->buffer == buffer) /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:164 100.00 : 67453a: 31 db xor %ebx,%ebx : * : * Only works for shared buffers. : */ : static PrivateRefCountEntry* : GetPrivateRefCountEntry(Buffer buffer, bool create, bool do_move) : { 0.00 : 67453c: 48 83 ec 18 sub $0x18,%rsp 0.00 : 674540: 89 7d c4 mov %edi,-0x3c(%rbp) : PrivateRefCountEntry *res; : PrivateRefCountEntry *free = NULL; : bool found = false; 0.00 : 674543: c6 45 d7 00 movb $0x0,-0x29(%rbp) 0.00 : 674547: eb 14 jmp 67455d 0.00 : 674549: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : : if (res->buffer == buffer) : return res; : : /* Remember where to put a new refcount, should it become necessary. */ : if (free == NULL && res->buffer == InvalidBuffer) 0.00 : 674550: 48 83 c2 08 add $0x8,%rdx : : /* : * First search for references in the array, that'll be sufficient in the : * majority of cases. : */ : for (i = 0; i < REFCOUNT_ARRAY_ENTRIES; i++) 0.00 : 674554: 48 81 fa 00 d1 b7 00 cmp $0xb7d100,%rdx 0.00 : 67455b: 74 2b je 674588 : { : res = &PrivateRefCountArray[i]; : : if (res->buffer == buffer) 0.00 : 67455d: 8b 0a mov (%rdx),%ecx 0.00 : 67455f: 48 89 d0 mov %rdx,%rax 0.00 : 674562: 39 f1 cmp %esi,%ecx 0.00 : 674564: 0f 84 c8 00 00 00 je 674632 : return res; : : /* Remember where to put a new refcount, should it become necessary. */ : if (free == NULL && res->buffer == InvalidBuffer) 0.00 : 67456a: 48 85 db test %rbx,%rbx 0.00 : 67456d: 75 e1 jne 674550 0.00 : 67456f: 85 c9 test %ecx,%ecx 0.00 : 674571: 48 0f 44 da cmove %rdx,%rbx 0.00 : 674575: 48 83 c2 08 add $0x8,%rdx : : /* : * First search for references in the array, that'll be sufficient in the : * majority of cases. : */ : for (i = 0; i < REFCOUNT_ARRAY_ENTRIES; i++) 0.00 : 674579: 48 81 fa 00 d1 b7 00 cmp $0xb7d100,%rdx 0.00 : 674580: 75 db jne 67455d 0.00 : 674582: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : : /* : * Look up the buffer in the hashtable if we've previously overflowed into : * it. : */ : if (PrivateRefCountOverflowed > 0) 0.00 : 674588: 8b 05 e2 8a 50 00 mov 0x508ae2(%rip),%eax # b7d070 : /* : * By here we know that the buffer, if already pinned, isn't residing in : * the array. : */ : res = NULL; : found = false; 0.00 : 67458e: c6 45 d7 00 movb $0x0,-0x29(%rbp) : : /* : * Look up the buffer in the hashtable if we've previously overflowed into : * it. : */ : if (PrivateRefCountOverflowed > 0) 0.00 : 674592: 85 c0 test %eax,%eax 0.00 : 674594: 0f 8e ee 00 00 00 jle 674688 : { : res = hash_search(PrivateRefCountHash, 0.00 : 67459a: 4c 8d 75 d7 lea -0x29(%rbp),%r14 0.00 : 67459e: 48 8b 3d d3 8a 50 00 mov 0x508ad3(%rip),%rdi # b7d078 0.00 : 6745a5: 48 8d 75 c4 lea -0x3c(%rbp),%rsi 0.00 : 6745a9: 31 d2 xor %edx,%edx 0.00 : 6745ab: 4c 89 f1 mov %r14,%rcx 0.00 : 6745ae: e8 ed 00 11 00 callq 7846a0 : (void *) &buffer, : HASH_FIND, : &found); : } : : if (!found) 0.00 : 6745b3: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) : * Look up the buffer in the hashtable if we've previously overflowed into : * it. : */ : if (PrivateRefCountOverflowed > 0) : { : res = hash_search(PrivateRefCountHash, 0.00 : 6745b7: 49 89 c5 mov %rax,%r13 : (void *) &buffer, : HASH_FIND, : &found); : } : : if (!found) 0.00 : 6745ba: 0f 84 c8 00 00 00 je 674688 : : } : } : else : { : if (!do_move) 0.00 : 6745c0: 45 84 e4 test %r12b,%r12b 0.00 : 6745c3: 74 6d je 674632 : { : return res; : } : else if (found && free != NULL) 0.00 : 6745c5: 48 85 db test %rbx,%rbx 0.00 : 6745c8: 75 7e jne 674648 : */ : PrivateRefCountEntry *arrayent; : PrivateRefCountEntry *hashent; : : /* select victim slot */ : arrayent = &PrivateRefCountArray[ 0.00 : 6745ca: 8b 05 b0 8a 50 00 mov 0x508ab0(%rip),%eax # b7d080 : PrivateRefCountClock++ % REFCOUNT_ARRAY_ENTRIES]; : Assert(arrayent->buffer != InvalidBuffer); : : /* enter victim entry into the hashtable */ : hashent = hash_search(PrivateRefCountHash, 0.00 : 6745d0: 48 8b 3d a1 8a 50 00 mov 0x508aa1(%rip),%rdi # b7d078 0.00 : 6745d7: 4c 89 f1 mov %r14,%rcx 0.00 : 6745da: ba 01 00 00 00 mov $0x1,%edx : */ : PrivateRefCountEntry *arrayent; : PrivateRefCountEntry *hashent; : : /* select victim slot */ : arrayent = &PrivateRefCountArray[ 0.00 : 6745df: 49 89 c4 mov %rax,%r12 0.00 : 6745e2: 83 c0 01 add $0x1,%eax 0.00 : 6745e5: 41 83 e4 07 and $0x7,%r12d 0.00 : 6745e9: 89 05 91 8a 50 00 mov %eax,0x508a91(%rip) # b7d080 0.00 : 6745ef: 4a 8d 1c e5 c0 d0 b7 lea 0xb7d0c0(,%r12,8),%rbx 0.00 : 6745f6: 00 : PrivateRefCountClock++ % REFCOUNT_ARRAY_ENTRIES]; : Assert(arrayent->buffer != InvalidBuffer); : : /* enter victim entry into the hashtable */ : hashent = hash_search(PrivateRefCountHash, 0.00 : 6745f7: 48 89 de mov %rbx,%rsi 0.00 : 6745fa: e8 a1 00 11 00 callq 7846a0 : (void *) &arrayent->buffer, : HASH_ENTER, : &found); : Assert(!found); : hashent->refcount = arrayent->refcount; 0.00 : 6745ff: 8b 53 04 mov 0x4(%rbx),%edx : /* fill now free array entry with previously searched entry */ : arrayent->buffer = res->buffer; : arrayent->refcount = res->refcount; : : /* and remove the old entry */ : hash_search(PrivateRefCountHash, 0.00 : 674602: 4c 89 f1 mov %r14,%rcx 0.00 : 674605: 48 89 de mov %rbx,%rsi : hashent = hash_search(PrivateRefCountHash, : (void *) &arrayent->buffer, : HASH_ENTER, : &found); : Assert(!found); : hashent->refcount = arrayent->refcount; 0.00 : 674608: 89 50 04 mov %edx,0x4(%rax) : : /* fill now free array entry with previously searched entry */ : arrayent->buffer = res->buffer; 0.00 : 67460b: 41 8b 45 00 mov 0x0(%r13),%eax : arrayent->refcount = res->refcount; : : /* and remove the old entry */ : hash_search(PrivateRefCountHash, 0.00 : 67460f: ba 02 00 00 00 mov $0x2,%edx : &found); : Assert(!found); : hashent->refcount = arrayent->refcount; : : /* fill now free array entry with previously searched entry */ : arrayent->buffer = res->buffer; 0.00 : 674614: 42 89 04 e5 c0 d0 b7 mov %eax,0xb7d0c0(,%r12,8) 0.00 : 67461b: 00 : arrayent->refcount = res->refcount; 0.00 : 67461c: 41 8b 45 04 mov 0x4(%r13),%eax 0.00 : 674620: 89 43 04 mov %eax,0x4(%rbx) : : /* and remove the old entry */ : hash_search(PrivateRefCountHash, 0.00 : 674623: 48 8b 3d 4e 8a 50 00 mov 0x508a4e(%rip),%rdi # b7d078 0.00 : 67462a: e8 71 00 11 00 callq 7846a0 0.00 : 67462f: 48 89 d8 mov %rbx,%rax : } : } : : Assert(false); /* unreachable */ : return NULL; : } 0.00 : 674632: 48 83 c4 18 add $0x18,%rsp 0.00 : 674636: 5b pop %rbx 0.00 : 674637: 41 5c pop %r12 0.00 : 674639: 41 5d pop %r13 0.00 : 67463b: 41 5e pop %r14 0.00 : 67463d: 41 5f pop %r15 0.00 : 67463f: c9 leaveq 0.00 : 674640: c3 retq 0.00 : 674641: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : else if (found && free != NULL) : { : /* move buffer from hashtable into the free array slot */ : : /* fill array slot */ : free->buffer = buffer; 0.00 : 674648: 8b 45 c4 mov -0x3c(%rbp),%eax : free->refcount = res->refcount; : : /* delete from hashtable */ : hash_search(PrivateRefCountHash, 0.00 : 67464b: 48 8d 75 c4 lea -0x3c(%rbp),%rsi 0.00 : 67464f: 4c 89 f1 mov %r14,%rcx 0.00 : 674652: ba 02 00 00 00 mov $0x2,%edx : else if (found && free != NULL) : { : /* move buffer from hashtable into the free array slot */ : : /* fill array slot */ : free->buffer = buffer; 0.00 : 674657: 89 03 mov %eax,(%rbx) : free->refcount = res->refcount; 0.00 : 674659: 41 8b 45 04 mov 0x4(%r13),%eax 0.00 : 67465d: 89 43 04 mov %eax,0x4(%rbx) : : /* delete from hashtable */ : hash_search(PrivateRefCountHash, 0.00 : 674660: 48 8b 3d 11 8a 50 00 mov 0x508a11(%rip),%rdi # b7d078 0.00 : 674667: e8 34 00 11 00 callq 7846a0 : (void *) &buffer, : HASH_REMOVE, : &found); : Assert(found); : Assert(PrivateRefCountOverflowed > 0); : PrivateRefCountOverflowed--; 0.00 : 67466c: 83 2d fd 89 50 00 01 subl $0x1,0x5089fd(%rip) # b7d070 0.00 : 674673: 48 89 d8 mov %rbx,%rax : } : } : : Assert(false); /* unreachable */ : return NULL; : } 0.00 : 674676: 48 83 c4 18 add $0x18,%rsp 0.00 : 67467a: 5b pop %rbx 0.00 : 67467b: 41 5c pop %r12 0.00 : 67467d: 41 5d pop %r13 0.00 : 67467f: 41 5e pop %r14 0.00 : 674681: 41 5f pop %r15 0.00 : 674683: c9 leaveq 0.00 : 674684: c3 retq 0.00 : 674685: 0f 1f 00 nopl (%rax) : &found); : } : : if (!found) : { : if (!create) 0.00 : 674688: 31 c0 xor %eax,%eax 0.00 : 67468a: 45 84 ff test %r15b,%r15b 0.00 : 67468d: 74 a3 je 674632 : { : /* Neither array nor hash have an entry and no new entry is needed */ : return NULL; : } : else if (free != NULL) 0.00 : 67468f: 48 85 db test %rbx,%rbx 0.00 : 674692: 74 11 je 6746a5 : { : /* add entry into the free array slot */ : free->buffer = buffer; 0.00 : 674694: 8b 45 c4 mov -0x3c(%rbp),%eax : free->refcount = 0; 0.00 : 674697: c7 43 04 00 00 00 00 movl $0x0,0x4(%rbx) : return NULL; : } : else if (free != NULL) : { : /* add entry into the free array slot */ : free->buffer = buffer; 0.00 : 67469e: 89 03 mov %eax,(%rbx) : free->refcount = 0; 0.00 : 6746a0: 48 89 d8 mov %rbx,%rax : } : } : : Assert(false); /* unreachable */ : return NULL; : } 0.00 : 6746a3: eb 8d jmp 674632 : */ : PrivateRefCountEntry *arrayent; : PrivateRefCountEntry *hashent; : : /* select victim slot */ : arrayent = &PrivateRefCountArray[ 0.00 : 6746a5: 8b 05 d5 89 50 00 mov 0x5089d5(%rip),%eax # b7d080 : PrivateRefCountClock++ % REFCOUNT_ARRAY_ENTRIES]; : Assert(arrayent->buffer != InvalidBuffer); : : /* enter victim array entry into hashtable */ : hashent = hash_search(PrivateRefCountHash, 0.00 : 6746ab: 48 8b 3d c6 89 50 00 mov 0x5089c6(%rip),%rdi # b7d078 0.00 : 6746b2: 48 8d 4d d7 lea -0x29(%rbp),%rcx 0.00 : 6746b6: ba 01 00 00 00 mov $0x1,%edx : */ : PrivateRefCountEntry *arrayent; : PrivateRefCountEntry *hashent; : : /* select victim slot */ : arrayent = &PrivateRefCountArray[ 0.00 : 6746bb: 49 89 c4 mov %rax,%r12 0.00 : 6746be: 83 c0 01 add $0x1,%eax 0.00 : 6746c1: 41 83 e4 07 and $0x7,%r12d 0.00 : 6746c5: 89 05 b5 89 50 00 mov %eax,0x5089b5(%rip) # b7d080 0.00 : 6746cb: 4a 8d 1c e5 c0 d0 b7 lea 0xb7d0c0(,%r12,8),%rbx 0.00 : 6746d2: 00 : PrivateRefCountClock++ % REFCOUNT_ARRAY_ENTRIES]; : Assert(arrayent->buffer != InvalidBuffer); : : /* enter victim array entry into hashtable */ : hashent = hash_search(PrivateRefCountHash, 0.00 : 6746d3: 48 89 de mov %rbx,%rsi 0.00 : 6746d6: e8 c5 ff 10 00 callq 7846a0 : (void *) &arrayent->buffer, : HASH_ENTER, : &found); : Assert(!found); : hashent->refcount = arrayent->refcount; 0.00 : 6746db: 8b 53 04 mov 0x4(%rbx),%edx 0.00 : 6746de: 89 50 04 mov %edx,0x4(%rax) : : /* fill the now free array slot */ : arrayent->buffer = buffer; 0.00 : 6746e1: 8b 45 c4 mov -0x3c(%rbp),%eax 0.00 : 6746e4: 42 89 04 e5 c0 d0 b7 mov %eax,0xb7d0c0(,%r12,8) 0.00 : 6746eb: 00 : arrayent->refcount = 0; 0.00 : 6746ec: c7 43 04 00 00 00 00 movl $0x0,0x4(%rbx) : : PrivateRefCountOverflowed++; 0.00 : 6746f3: 48 89 d8 mov %rbx,%rax 0.00 : 6746f6: 83 05 73 89 50 00 01 addl $0x1,0x508973(%rip) # b7d070 : } : } : : Assert(false); /* unreachable */ : return NULL; : } 0.00 : 6746fd: e9 30 ff ff ff jmpq 674632 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1360 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000674d30 : : * Most but not all callers want CurrentResourceOwner to be adjusted. : * Those that don't should pass fixOwner = FALSE. : */ : static void : UnpinBuffer(volatile BufferDesc *buf, bool fixOwner) : { 0.00 : 674d30: 55 push %rbp : PrivateRefCountEntry *ref; : int b = buf->buf_id; : : ref = GetPrivateRefCountEntry(b + 1, false, false); 0.00 : 674d31: 31 d2 xor %edx,%edx : * Most but not all callers want CurrentResourceOwner to be adjusted. : * Those that don't should pass fixOwner = FALSE. : */ : static void : UnpinBuffer(volatile BufferDesc *buf, bool fixOwner) : { 0.00 : 674d33: 48 89 e5 mov %rsp,%rbp 0.00 : 674d36: 48 89 5d e8 mov %rbx,-0x18(%rbp) 0.00 : 674d3a: 4c 89 65 f0 mov %r12,-0x10(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1360 100.00 : 674d3e: 48 89 fb mov %rdi,%rbx 0.00 : 674d41: 4c 89 6d f8 mov %r13,-0x8(%rbp) 0.00 : 674d45: 48 83 ec 30 sub $0x30,%rsp : PrivateRefCountEntry *ref; : int b = buf->buf_id; 0.00 : 674d49: 8b 7f 24 mov 0x24(%rdi),%edi : * Most but not all callers want CurrentResourceOwner to be adjusted. : * Those that don't should pass fixOwner = FALSE. : */ : static void : UnpinBuffer(volatile BufferDesc *buf, bool fixOwner) : { 0.00 : 674d4c: 41 89 f4 mov %esi,%r12d : PrivateRefCountEntry *ref; : int b = buf->buf_id; : : ref = GetPrivateRefCountEntry(b + 1, false, false); 0.00 : 674d4f: 31 f6 xor %esi,%esi 0.00 : 674d51: 83 c7 01 add $0x1,%edi 0.00 : 674d54: e8 c7 f7 ff ff callq 674520 : Assert(ref != NULL); : : if (fixOwner) 0.00 : 674d59: 45 84 e4 test %r12b,%r12b : UnpinBuffer(volatile BufferDesc *buf, bool fixOwner) : { : PrivateRefCountEntry *ref; : int b = buf->buf_id; : : ref = GetPrivateRefCountEntry(b + 1, false, false); 0.00 : 674d5c: 49 89 c5 mov %rax,%r13 : Assert(ref != NULL); : : if (fixOwner) 0.00 : 674d5f: 0f 85 b3 00 00 00 jne 674e18 : ResourceOwnerForgetBuffer(CurrentResourceOwner, : BufferDescriptorGetBuffer(buf)); : : Assert(ref->refcount > 0); : ref->refcount--; 0.00 : 674d65: 41 8b 45 04 mov 0x4(%r13),%eax 0.00 : 674d69: 83 e8 01 sub $0x1,%eax : if (ref->refcount == 0) 0.00 : 674d6c: 85 c0 test %eax,%eax : if (fixOwner) : ResourceOwnerForgetBuffer(CurrentResourceOwner, : BufferDescriptorGetBuffer(buf)); : : Assert(ref->refcount > 0); : ref->refcount--; 0.00 : 674d6e: 41 89 45 04 mov %eax,0x4(%r13) : if (ref->refcount == 0) 0.00 : 674d72: 75 66 jne 674dda : { : /* I'd better not still hold any locks on the buffer */ : Assert(!LWLockHeldByMe(buf->content_lock)); : Assert(!LWLockHeldByMe(buf->io_in_progress_lock)); : : LockBufHdr(buf); 0.00 : 674d74: 48 8d 7b 20 lea 0x20(%rbx),%rdi : static __inline__ int : tas(volatile slock_t *lock) : { : register slock_t _res = 1; : : __asm__ __volatile__( 0.00 : 674d78: b8 01 00 00 00 mov $0x1,%eax 0.00 : 674d7d: f0 86 07 lock xchg %al,(%rdi) 0.00 : 674d80: 84 c0 test %al,%al 0.00 : 674d82: 0f 85 a8 00 00 00 jne 674e30 : : /* Decrement the shared reference count */ : Assert(buf->refcount > 0); : buf->refcount--; 0.00 : 674d88: 8b 43 18 mov 0x18(%rbx),%eax 0.00 : 674d8b: 83 e8 01 sub $0x1,%eax 0.00 : 674d8e: 89 43 18 mov %eax,0x18(%rbx) : : /* Support LockBufferForCleanup() */ : if ((buf->flags & BM_PIN_COUNT_WAITER) && 0.00 : 674d91: 0f b7 43 14 movzwl 0x14(%rbx),%eax 0.00 : 674d95: a8 40 test $0x40,%al 0.00 : 674d97: 75 57 jne 674df0 : buf->flags &= ~BM_PIN_COUNT_WAITER; : UnlockBufHdr(buf); : ProcSendSignal(wait_backend_pid); : } : else : UnlockBufHdr(buf); 0.00 : 674d99: c6 43 20 00 movb $0x0,0x20(%rbx) : static void : ForgetPrivateRefCountEntry(PrivateRefCountEntry *ref) : { : Assert(ref->refcount == 0); : : if (ref >= &PrivateRefCountArray[0] && 0.00 : 674d9d: 49 81 fd c0 d0 b7 00 cmp $0xb7d0c0,%r13 0.00 : 674da4: 72 0d jb 674db3 0.00 : 674da6: 49 81 fd 00 d1 b7 00 cmp $0xb7d100,%r13 0.00 : 674dad: 0f 82 95 00 00 00 jb 674e48 : ref->buffer = InvalidBuffer; : } : else : { : bool found; : Buffer buffer = ref->buffer; 0.00 : 674db3: 41 8b 45 00 mov 0x0(%r13),%eax : hash_search(PrivateRefCountHash, 0.00 : 674db7: 48 8b 3d ba 82 50 00 mov 0x5082ba(%rip),%rdi # b7d078 0.00 : 674dbe: 48 8d 4d e7 lea -0x19(%rbp),%rcx 0.00 : 674dc2: 48 8d 75 e0 lea -0x20(%rbp),%rsi 0.00 : 674dc6: ba 02 00 00 00 mov $0x2,%edx : ref->buffer = InvalidBuffer; : } : else : { : bool found; : Buffer buffer = ref->buffer; 0.00 : 674dcb: 89 45 e0 mov %eax,-0x20(%rbp) : hash_search(PrivateRefCountHash, 0.00 : 674dce: e8 cd f8 10 00 callq 7846a0 : (void *) &buffer, : HASH_REMOVE, : &found); : Assert(found); : Assert(PrivateRefCountOverflowed > 0); : PrivateRefCountOverflowed--; 0.00 : 674dd3: 83 2d 96 82 50 00 01 subl $0x1,0x508296(%rip) # b7d070 : else : UnlockBufHdr(buf); : : ForgetPrivateRefCountEntry(ref); : } : } 0.00 : 674dda: 48 8b 5d e8 mov -0x18(%rbp),%rbx 0.00 : 674dde: 4c 8b 65 f0 mov -0x10(%rbp),%r12 0.00 : 674de2: 4c 8b 6d f8 mov -0x8(%rbp),%r13 0.00 : 674de6: c9 leaveq 0.00 : 674de7: c3 retq 0.00 : 674de8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 674def: 00 : /* Decrement the shared reference count */ : Assert(buf->refcount > 0); : buf->refcount--; : : /* Support LockBufferForCleanup() */ : if ((buf->flags & BM_PIN_COUNT_WAITER) && 0.00 : 674df0: 8b 43 18 mov 0x18(%rbx),%eax 0.00 : 674df3: 83 e8 01 sub $0x1,%eax 0.00 : 674df6: 75 a1 jne 674d99 : buf->refcount == 1) : { : /* we just released the last pin other than the waiter's */ : int wait_backend_pid = buf->wait_backend_pid; 0.00 : 674df8: 8b 7b 1c mov 0x1c(%rbx),%edi : : buf->flags &= ~BM_PIN_COUNT_WAITER; 0.00 : 674dfb: 0f b7 43 14 movzwl 0x14(%rbx),%eax 0.00 : 674dff: 83 e0 bf and $0xffffffbf,%eax 0.00 : 674e02: 66 89 43 14 mov %ax,0x14(%rbx) : UnlockBufHdr(buf); 0.00 : 674e06: c6 43 20 00 movb $0x0,0x20(%rbx) : ProcSendSignal(wait_backend_pid); 0.00 : 674e0a: e8 b1 76 01 00 callq 68c4c0 : /* Decrement the shared reference count */ : Assert(buf->refcount > 0); : buf->refcount--; : : /* Support LockBufferForCleanup() */ : if ((buf->flags & BM_PIN_COUNT_WAITER) && 0.00 : 674e0f: eb 8c jmp 674d9d 0.00 : 674e11: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : : ref = GetPrivateRefCountEntry(b + 1, false, false); : Assert(ref != NULL); : : if (fixOwner) : ResourceOwnerForgetBuffer(CurrentResourceOwner, 0.00 : 674e18: 8b 73 24 mov 0x24(%rbx),%esi 0.00 : 674e1b: 48 8b 3d 9e 5a 54 00 mov 0x545a9e(%rip),%rdi # bba8c0 0.00 : 674e22: 83 c6 01 add $0x1,%esi 0.00 : 674e25: e8 d6 5a 12 00 callq 79a900 0.00 : 674e2a: e9 36 ff ff ff jmpq 674d65 0.00 : 674e2f: 90 nop : { : /* I'd better not still hold any locks on the buffer */ : Assert(!LWLockHeldByMe(buf->content_lock)); : Assert(!LWLockHeldByMe(buf->io_in_progress_lock)); : : LockBufHdr(buf); 0.00 : 674e30: ba 63 05 00 00 mov $0x563,%edx 0.00 : 674e35: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 674e3a: e8 01 b2 01 00 callq 690040 0.00 : 674e3f: e9 44 ff ff ff jmpq 674d88 0.00 : 674e44: 0f 1f 40 00 nopl 0x0(%rax) : Assert(ref->refcount == 0); : : if (ref >= &PrivateRefCountArray[0] && : ref < &PrivateRefCountArray[REFCOUNT_ARRAY_ENTRIES]) : { : ref->buffer = InvalidBuffer; 0.00 : 674e48: 41 c7 45 00 00 00 00 movl $0x0,0x0(%r13) 0.00 : 674e4f: 00 0.00 : 674e50: eb 88 jmp 674dda Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:2780 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000674e60 : : /* : * ReleaseBuffer -- release the pin on a buffer : */ : void : ReleaseBuffer(Buffer buffer) : { 0.00 : 674e60: 55 push %rbp 0.00 : 674e61: 48 89 e5 mov %rsp,%rbp 0.00 : 674e64: 48 89 5d f0 mov %rbx,-0x10(%rbp) 0.00 : 674e68: 4c 89 65 f8 mov %r12,-0x8(%rbp) 0.00 : 674e6c: 48 83 ec 10 sub $0x10,%rsp : volatile BufferDesc *bufHdr; : PrivateRefCountEntry *ref; : : if (!BufferIsValid(buffer)) 0.00 : 674e70: 85 ff test %edi,%edi : /* : * ReleaseBuffer -- release the pin on a buffer : */ : void : ReleaseBuffer(Buffer buffer) : { 0.00 : 674e72: 89 fb mov %edi,%ebx : volatile BufferDesc *bufHdr; : PrivateRefCountEntry *ref; : : if (!BufferIsValid(buffer)) 0.00 : 674e74: 74 7f je 674ef5 : elog(ERROR, "bad buffer ID: %d", buffer); : : ResourceOwnerForgetBuffer(CurrentResourceOwner, buffer); 0.00 : 674e76: 89 fe mov %edi,%esi 0.00 : 674e78: 48 8b 3d 41 5a 54 00 mov 0x545a41(%rip),%rdi # bba8c0 0.00 : 674e7f: e8 7c 5a 12 00 callq 79a900 : : if (BufferIsLocal(buffer)) 0.00 : 674e84: 85 db test %ebx,%ebx 0.00 : 674e86: 78 38 js 674ec0 : return; : } : : bufHdr = &BufferDescriptors[buffer - 1]; : : ref = GetPrivateRefCountEntry(buffer, false, false); 0.00 : 674e88: 31 d2 xor %edx,%edx 0.00 : 674e8a: 31 f6 xor %esi,%esi 0.00 : 674e8c: 89 df mov %ebx,%edi : Assert(LocalRefCount[-buffer - 1] > 0); : LocalRefCount[-buffer - 1]--; : return; : } : : bufHdr = &BufferDescriptors[buffer - 1]; 0.00 : 674e8e: 4c 8b 25 6b ac 54 00 mov 0x54ac6b(%rip),%r12 # bbfb00 : : ref = GetPrivateRefCountEntry(buffer, false, false); 0.00 : 674e95: e8 86 f6 ff ff callq 674520 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:2780 100.00 : 674e9a: 48 89 c2 mov %rax,%rdx : Assert(ref != NULL); : Assert(ref->refcount > 0); : : if (ref->refcount > 1) 0.00 : 674e9d: 8b 40 04 mov 0x4(%rax),%eax 0.00 : 674ea0: 83 f8 01 cmp $0x1,%eax 0.00 : 674ea3: 7e 33 jle 674ed8 : ref->refcount--; 0.00 : 674ea5: 83 e8 01 sub $0x1,%eax 0.00 : 674ea8: 89 42 04 mov %eax,0x4(%rdx) : else : UnpinBuffer(bufHdr, false); : } 0.00 : 674eab: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 674eaf: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 674eb4: c9 leaveq 0.00 : 674eb5: c3 retq 0.00 : 674eb6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 674ebd: 00 00 00 : ResourceOwnerForgetBuffer(CurrentResourceOwner, buffer); : : if (BufferIsLocal(buffer)) : { : Assert(LocalRefCount[-buffer - 1] > 0); : LocalRefCount[-buffer - 1]--; 0.00 : 674ec0: f7 d3 not %ebx 0.00 : 674ec2: 48 63 c3 movslq %ebx,%rax 0.00 : 674ec5: 48 c1 e0 02 shl $0x2,%rax 0.00 : 674ec9: 48 03 05 50 82 50 00 add 0x508250(%rip),%rax # b7d120 0.00 : 674ed0: 83 28 01 subl $0x1,(%rax) : : if (ref->refcount > 1) : ref->refcount--; : else : UnpinBuffer(bufHdr, false); : } 0.00 : 674ed3: eb d6 jmp 674eab 0.00 : 674ed5: 0f 1f 00 nopl (%rax) : Assert(ref->refcount > 0); : : if (ref->refcount > 1) : ref->refcount--; : else : UnpinBuffer(bufHdr, false); 0.00 : 674ed8: 48 63 c3 movslq %ebx,%rax : } 0.00 : 674edb: 48 8b 1c 24 mov (%rsp),%rbx : Assert(ref->refcount > 0); : : if (ref->refcount > 1) : ref->refcount--; : else : UnpinBuffer(bufHdr, false); 0.00 : 674edf: 31 f6 xor %esi,%esi 0.00 : 674ee1: 48 c1 e0 06 shl $0x6,%rax 0.00 : 674ee5: 49 8d 7c 04 c0 lea -0x40(%r12,%rax,1),%rdi : } 0.00 : 674eea: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 674eef: c9 leaveq : Assert(ref->refcount > 0); : : if (ref->refcount > 1) : ref->refcount--; : else : UnpinBuffer(bufHdr, false); 0.00 : 674ef0: e9 3b fe ff ff jmpq 674d30 : { : volatile BufferDesc *bufHdr; : PrivateRefCountEntry *ref; : : if (!BufferIsValid(buffer)) : elog(ERROR, "bad buffer ID: %d", buffer); 0.00 : 674ef5: ba 34 a0 8a 00 mov $0x8aa034,%edx 0.00 : 674efa: be cf 0a 00 00 mov $0xacf,%esi 0.00 : 674eff: bf 53 9d 8a 00 mov $0x8a9d53,%edi 0.00 : 674f04: e8 17 65 10 00 callq 77b420 0.00 : 674f09: 31 d2 xor %edx,%edx 0.00 : 674f0b: be 5c 9d 8a 00 mov $0x8a9d5c,%esi 0.00 : 674f10: bf 14 00 00 00 mov $0x14,%edi 0.00 : 674f15: 31 c0 xor %eax,%eax 0.00 : 674f17: e8 14 63 10 00 callq 77b230 0.00 : 674f1c: e8 af 45 df ff callq 4694d0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:509 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000676570 : : * See buffer/README for details. : */ : Buffer : ReadBufferExtended(Relation reln, ForkNumber forkNum, BlockNumber blockNum, : ReadBufferMode mode, BufferAccessStrategy strategy) : { 0.00 : 676570: 55 push %rbp 0.00 : 676571: 48 89 e5 mov %rsp,%rbp 0.00 : 676574: 48 89 5d d8 mov %rbx,-0x28(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:509 100.00 : 676578: 4c 89 65 e0 mov %r12,-0x20(%rbp) 0.00 : 67657c: 48 89 fb mov %rdi,%rbx 0.00 : 67657f: 4c 89 6d e8 mov %r13,-0x18(%rbp) 0.00 : 676583: 4c 89 75 f0 mov %r14,-0x10(%rbp) 0.00 : 676587: 41 89 cd mov %ecx,%r13d 0.00 : 67658a: 4c 89 7d f8 mov %r15,-0x8(%rbp) 0.00 : 67658e: 48 83 ec 40 sub $0x40,%rsp : bool hit; : Buffer buf; : : /* Open it at the smgr level if not already done */ : RelationOpenSmgr(reln); 0.00 : 676592: 48 83 7f 10 00 cmpq $0x0,0x10(%rdi) : * See buffer/README for details. : */ : Buffer : ReadBufferExtended(Relation reln, ForkNumber forkNum, BlockNumber blockNum, : ReadBufferMode mode, BufferAccessStrategy strategy) : { 0.00 : 676597: 41 89 f7 mov %esi,%r15d 0.00 : 67659a: 41 89 d6 mov %edx,%r14d 0.00 : 67659d: 4d 89 c4 mov %r8,%r12 : bool hit; : Buffer buf; : : /* Open it at the smgr level if not already done */ : RelationOpenSmgr(reln); 0.00 : 6765a0: 0f 84 aa 00 00 00 je 676650 : /* : * Reject attempts to read non-local temporary relations; we would be : * likely to get wrong data since we have no visibility into the owning : * session's local buffers. : */ : if (RELATION_IS_OTHER_TEMP(reln)) 0.00 : 6765a6: 48 8b 43 30 mov 0x30(%rbx),%rax 0.00 : 6765aa: 0f b6 50 6e movzbl 0x6e(%rax),%edx 0.00 : 6765ae: 80 fa 74 cmp $0x74,%dl 0.00 : 6765b1: 74 6d je 676620 : : /* : * Read the buffer, and update pgstat counters to reflect a cache hit or : * miss. : */ : pgstat_count_buffer_read(reln); 0.00 : 6765b3: 48 8b 83 38 01 00 00 mov 0x138(%rbx),%rax 0.00 : 6765ba: 48 85 c0 test %rax,%rax 0.00 : 6765bd: 74 0d je 6765cc 0.00 : 6765bf: 48 83 40 60 01 addq $0x1,0x60(%rax) 0.00 : 6765c4: 48 8b 43 30 mov 0x30(%rbx),%rax 0.00 : 6765c8: 0f b6 50 6e movzbl 0x6e(%rax),%edx : buf = ReadBuffer_common(reln->rd_smgr, reln->rd_rel->relpersistence, 0.00 : 6765cc: 48 8b 7b 10 mov 0x10(%rbx),%rdi 0.00 : 6765d0: 48 8d 45 d7 lea -0x29(%rbp),%rax 0.00 : 6765d4: 0f be f2 movsbl %dl,%esi 0.00 : 6765d7: 4d 89 e1 mov %r12,%r9 0.00 : 6765da: 45 89 e8 mov %r13d,%r8d 0.00 : 6765dd: 44 89 f1 mov %r14d,%ecx 0.00 : 6765e0: 44 89 fa mov %r15d,%edx 0.00 : 6765e3: 48 89 04 24 mov %rax,(%rsp) 0.00 : 6765e7: e8 b4 f6 ff ff callq 675ca0 : forkNum, blockNum, mode, strategy, &hit); : if (hit) 0.00 : 6765ec: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) 0.00 : 6765f0: 74 11 je 676603 : pgstat_count_buffer_hit(reln); 0.00 : 6765f2: 48 8b 93 38 01 00 00 mov 0x138(%rbx),%rdx 0.00 : 6765f9: 48 85 d2 test %rdx,%rdx 0.00 : 6765fc: 74 05 je 676603 0.00 : 6765fe: 48 83 42 68 01 addq $0x1,0x68(%rdx) : return buf; : } 0.00 : 676603: 48 8b 5d d8 mov -0x28(%rbp),%rbx 0.00 : 676607: 4c 8b 65 e0 mov -0x20(%rbp),%r12 0.00 : 67660b: 4c 8b 6d e8 mov -0x18(%rbp),%r13 0.00 : 67660f: 4c 8b 75 f0 mov -0x10(%rbp),%r14 0.00 : 676613: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 676617: c9 leaveq 0.00 : 676618: c3 retq 0.00 : 676619: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : /* : * Reject attempts to read non-local temporary relations; we would be : * likely to get wrong data since we have no visibility into the owning : * session's local buffers. : */ : if (RELATION_IS_OTHER_TEMP(reln)) 0.00 : 676620: 80 7b 20 00 cmpb $0x0,0x20(%rbx) 0.00 : 676624: 75 8d jne 6765b3 : ereport(ERROR, 0.00 : 676626: 45 31 c0 xor %r8d,%r8d 0.00 : 676629: b9 c0 a0 8a 00 mov $0x8aa0c0,%ecx 0.00 : 67662e: ba 0c 02 00 00 mov $0x20c,%edx 0.00 : 676633: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 676638: bf 14 00 00 00 mov $0x14,%edi 0.00 : 67663d: e8 7e 44 10 00 callq 77aac0 0.00 : 676642: 84 c0 test %al,%al 0.00 : 676644: 75 29 jne 67666f 0.00 : 676646: e8 85 2e df ff callq 4694d0 0.00 : 67664b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : { : bool hit; : Buffer buf; : : /* Open it at the smgr level if not already done */ : RelationOpenSmgr(reln); 0.00 : 676650: 8b 57 1c mov 0x1c(%rdi),%edx 0.00 : 676653: 8b 73 08 mov 0x8(%rbx),%esi 0.00 : 676656: 48 8b 3f mov (%rdi),%rdi 0.00 : 676659: e8 d2 33 02 00 callq 699a30 0.00 : 67665e: 48 8d 7b 10 lea 0x10(%rbx),%rdi 0.00 : 676662: 48 89 c6 mov %rax,%rsi 0.00 : 676665: e8 96 2c 02 00 callq 699300 0.00 : 67666a: e9 37 ff ff ff jmpq 6765a6 : * Reject attempts to read non-local temporary relations; we would be : * likely to get wrong data since we have no visibility into the owning : * session's local buffers. : */ : if (RELATION_IS_OTHER_TEMP(reln)) : ereport(ERROR, 0.00 : 67666f: bf 08 9f 8a 00 mov $0x8a9f08,%edi 0.00 : 676674: 31 c0 xor %eax,%eax 0.00 : 676676: e8 25 62 10 00 callq 77c8a0 0.00 : 67667b: bf 40 04 00 00 mov $0x440,%edi 0.00 : 676680: 89 c3 mov %eax,%ebx 0.00 : 676682: e8 c9 66 10 00 callq 77cd50 0.00 : 676687: 89 de mov %ebx,%esi 0.00 : 676689: 89 c7 mov %eax,%edi 0.00 : 67668b: 31 c0 xor %eax,%eax 0.00 : 67668d: e8 4e 3f 10 00 callq 77a5e0 0.00 : 676692: eb b2 jmp 676646 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/../../../../src/include/port/atomics/generic.h:247 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000068f3a0 : : /* : * LWLockRelease - release a previously acquired lock : */ : void : LWLockRelease(LWLock *lock) : { 0.00 : 68f3a0: 55 push %rbp 0.00 : 68f3a1: 48 89 e5 mov %rsp,%rbp 0.00 : 68f3a4: 41 55 push %r13 0.00 : 68f3a6: 41 54 push %r12 0.00 : 68f3a8: 49 89 fc mov %rdi,%r12 0.00 : 68f3ab: 53 push %rbx 0.00 : 68f3ac: 48 83 ec 18 sub $0x18,%rsp : : /* : * Remove lock from list of locks held. Usually, but not always, it will : * be the latest-acquired lock; so search array backwards. : */ : for (i = num_held_lwlocks; --i >= 0;) 0.00 : 68f3b0: 8b 35 52 e6 4e 00 mov 0x4ee652(%rip),%esi # b7da08 0.00 : 68f3b6: 89 f0 mov %esi,%eax 0.00 : 68f3b8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 68f3bf: 00 0.00 : 68f3c0: 83 e8 01 sub $0x1,%eax 0.00 : 68f3c3: 0f 88 1f 02 00 00 js 68f5e8 : { : if (lock == held_lwlocks[i].lock) 0.00 : 68f3c9: 48 63 d0 movslq %eax,%rdx 0.00 : 68f3cc: 41 b9 40 da b7 00 mov $0xb7da40,%r9d 0.00 : 68f3d2: 48 89 d1 mov %rdx,%rcx 0.00 : 68f3d5: 48 c1 e1 04 shl $0x4,%rcx 0.00 : 68f3d9: 48 8b 99 40 da b7 00 mov 0xb7da40(%rcx),%rbx 0.00 : 68f3e0: 4c 39 e3 cmp %r12,%rbx 0.00 : 68f3e3: 75 db jne 68f3c0 : break; : } : } : if (i < 0) : elog(ERROR, "lock %s %d is not held", T_NAME(lock), T_ID(lock)); : num_held_lwlocks--; 0.00 : 68f3e5: 44 8d 46 ff lea -0x1(%rsi),%r8d : */ : for (i = num_held_lwlocks; --i >= 0;) : { : if (lock == held_lwlocks[i].lock) : { : mode = held_lwlocks[i].mode; 0.00 : 68f3e9: 44 8b 91 48 da b7 00 mov 0xb7da48(%rcx),%r10d : } : } : if (i < 0) : elog(ERROR, "lock %s %d is not held", T_NAME(lock), T_ID(lock)); : num_held_lwlocks--; : for (; i < num_held_lwlocks; i++) 0.00 : 68f3f0: 41 39 c0 cmp %eax,%r8d : break; : } : } : if (i < 0) : elog(ERROR, "lock %s %d is not held", T_NAME(lock), T_ID(lock)); : num_held_lwlocks--; 0.00 : 68f3f3: 44 89 05 0e e6 4e 00 mov %r8d,0x4ee60e(%rip) # b7da08 : for (; i < num_held_lwlocks; i++) 0.00 : 68f3fa: 7f 09 jg 68f405 0.00 : 68f3fc: eb 3a jmp 68f438 0.00 : 68f3fe: 66 90 xchg %ax,%ax : : /* : * Remove lock from list of locks held. Usually, but not always, it will : * be the latest-acquired lock; so search array backwards. : */ : for (i = num_held_lwlocks; --i >= 0;) 0.00 : 68f400: 89 f0 mov %esi,%eax 0.00 : 68f402: 48 89 fa mov %rdi,%rdx : } : if (i < 0) : elog(ERROR, "lock %s %d is not held", T_NAME(lock), T_ID(lock)); : num_held_lwlocks--; : for (; i < num_held_lwlocks; i++) : held_lwlocks[i] = held_lwlocks[i + 1]; 0.00 : 68f405: 8d 70 01 lea 0x1(%rax),%esi 0.00 : 68f408: 48 89 d1 mov %rdx,%rcx 0.00 : 68f40b: 48 c1 e1 04 shl $0x4,%rcx 0.00 : 68f40f: 48 63 fe movslq %esi,%rdi 0.00 : 68f412: 48 89 fa mov %rdi,%rdx 0.00 : 68f415: 48 c1 e2 04 shl $0x4,%rdx : } : } : if (i < 0) : elog(ERROR, "lock %s %d is not held", T_NAME(lock), T_ID(lock)); : num_held_lwlocks--; : for (; i < num_held_lwlocks; i++) 0.00 : 68f419: 41 39 f0 cmp %esi,%r8d : held_lwlocks[i] = held_lwlocks[i + 1]; 0.00 : 68f41c: 48 8b 82 40 da b7 00 mov 0xb7da40(%rdx),%rax 0.00 : 68f423: 48 89 81 40 da b7 00 mov %rax,0xb7da40(%rcx) 0.00 : 68f42a: 48 8b 82 48 da b7 00 mov 0xb7da48(%rdx),%rax 0.00 : 68f431: 49 89 44 09 08 mov %rax,0x8(%r9,%rcx,1) : } : } : if (i < 0) : elog(ERROR, "lock %s %d is not held", T_NAME(lock), T_ID(lock)); : num_held_lwlocks--; : for (; i < num_held_lwlocks; i++) 0.00 : 68f436: 7f c8 jg 68f400 : : /* : * Release my hold on lock, after that it can immediately be acquired by : * others, even if we still have to wakeup other waiters. : */ : if (mode == LW_EXCLUSIVE) 0.00 : 68f438: 45 85 d2 test %r10d,%r10d 0.00 : 68f43b: 0f 84 77 01 00 00 je 68f5b8 : lockcount = pg_atomic_sub_fetch_u32(&lock->lockcount, EXCLUSIVE_LOCK); : else : lockcount = pg_atomic_sub_fetch_u32(&lock->lockcount, 1); 0.00 : 68f441: 49 8d 54 24 04 lea 0x4(%r12),%rdx : #define PG_HAVE_ATOMIC_FETCH_ADD_U32 : static inline uint32 : pg_atomic_fetch_add_u32_impl(volatile pg_atomic_uint32 *ptr, int32 add_) : { : uint32 res; : __asm__ __volatile__( 0.00 : 68f446: b8 ff ff ff ff mov $0xffffffff,%eax 0.00 : 68f44b: f0 0f c1 02 lock xadd %eax,(%rdx) : #if !defined(PG_HAVE_ATOMIC_SUB_FETCH_U32) && defined(PG_HAVE_ATOMIC_FETCH_SUB_U32) : #define PG_HAVE_ATOMIC_SUB_FETCH_U32 : static inline uint32 : pg_atomic_sub_fetch_u32_impl(volatile pg_atomic_uint32 *ptr, int32 sub_) : { : return pg_atomic_fetch_sub_u32_impl(ptr, sub_) - sub_; 0.00 : 68f44f: 8d 50 ff lea -0x1(%rax),%edx : #ifndef PG_HAVE_ATOMIC_READ_U32 : #define PG_HAVE_ATOMIC_READ_U32 : static inline uint32 : pg_atomic_read_u32_impl(volatile pg_atomic_uint32 *ptr) : { : return *(&ptr->value); 0.00 : 68f452: 8b 43 08 mov 0x8(%rbx),%eax : /* : * Anybody we need to wakeup needs to have started queueing before we : * removed ourselves from the queue and the atomic operations above are : * full barriers. So we can just do plain read. : */ : if (pg_atomic_read_u32(&lock->nwaiters) > 0) 0.00 : 68f455: 85 c0 test %eax,%eax 0.00 : 68f457: 0f 84 3a 01 00 00 je 68f597 : /* : * If we just released an exclusive lock always wakeup waiters, even if : * lockcount is still > 0. A shared acquisition temporarily (and : * spuriously) might have increased the value. : */ : if (mode == LW_EXCLUSIVE && have_waiters) 0.00 : 68f45d: 45 85 d2 test %r10d,%r10d 0.00 : 68f460: 0f 85 fc 01 00 00 jne 68f662 : * Previous state will be thrown away without any cleanup. : */ : STATIC_IF_INLINE void : dlist_init(dlist_head *head) : { : head->head.next = head->head.prev = &head->head; 0.00 : 68f466: 4c 8d 6d d0 lea -0x30(%rbp),%r13 0.00 : 68f46a: 4c 89 6d d0 mov %r13,-0x30(%rbp) 0.00 : 68f46e: 4c 89 6d d8 mov %r13,-0x28(%rbp) : /* : * We're still waiting for backends to get scheduled, don't wake them up : * again. : */ : pg_read_barrier(); /* pairs with nwaiters-- */ : if (!BOOL_ACCESS_ONCE(lock->releaseOK)) 0.00 : 68f472: 0f b6 43 01 movzbl 0x1(%rbx),%eax 0.00 : 68f476: 84 c0 test %al,%al 0.00 : 68f478: 0f 84 19 01 00 00 je 68f597 : static __inline__ int : tas(volatile slock_t *lock) : { : register slock_t _res = 1; : : __asm__ __volatile__( 0.00 : 68f47e: b8 01 00 00 00 mov $0x1,%eax 0.00 : 68f483: f0 86 03 lock xchg %al,(%rbx) : : /* Acquire mutex. Time spent holding mutex should be short! */ : #ifdef LWLOCK_STATS : lwstats->spin_delay_count += SpinLockAcquire(&lock->mutex); : #else : SpinLockAcquire(&lock->mutex); 0.00 : 68f486: 84 c0 test %al,%al 0.00 : 68f488: 0f 85 b2 01 00 00 jne 68f640 : #endif : : /* remove the to-be-awakened PGPROCs from the queue */ : releaseOK = true; : : dlist_foreach_modify(iter, &lock->waiters) 0.00 : 68f48e: 48 8b 53 18 mov 0x18(%rbx),%rdx 0.00 : 68f492: 48 85 d2 test %rdx,%rdx 0.00 : 68f495: 0f 84 bc 01 00 00 je 68f657 0.00 : 68f49b: 4d 8d 4c 24 10 lea 0x10(%r12),%r9 0.00 : 68f4a0: 48 8b 72 08 mov 0x8(%rdx),%rsi 0.00 : 68f4a4: 49 39 d1 cmp %rdx,%r9 0.00 : 68f4a7: 0f 84 aa 01 00 00 je 68f657 0.00 : 68f4ad: 31 ff xor %edi,%edi 0.00 : 68f4af: 41 b8 01 00 00 00 mov $0x1,%r8d 0.00 : 68f4b5: eb 23 jmp 68f4da 0.00 : 68f4b7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 68f4be: 00 00 : { : PGPROC *waiter = dlist_container(PGPROC, lwWaitLink, iter.cur); : : if (wokeup_somebody && waiter->lwWaitMode == LW_EXCLUSIVE) 0.00 : 68f4c0: 80 7a fa 00 cmpb $0x0,-0x6(%rdx) 0.00 : 68f4c4: 75 1d jne 68f4e3 0.00 : 68f4c6: bf 01 00 00 00 mov $0x1,%edi : #endif : : /* remove the to-be-awakened PGPROCs from the queue */ : releaseOK = true; : : dlist_foreach_modify(iter, &lock->waiters) 0.00 : 68f4cb: 49 39 f1 cmp %rsi,%r9 0.00 : 68f4ce: 48 8b 46 08 mov 0x8(%rsi),%rax 0.00 : 68f4d2: 74 6a je 68f53e 0.00 : 68f4d4: 48 89 f2 mov %rsi,%rdx 0.00 : 68f4d7: 48 89 c6 mov %rax,%rsi : { : PGPROC *waiter = dlist_container(PGPROC, lwWaitLink, iter.cur); : : if (wokeup_somebody && waiter->lwWaitMode == LW_EXCLUSIVE) 0.00 : 68f4da: 40 84 ff test %dil,%dil : /* remove the to-be-awakened PGPROCs from the queue */ : releaseOK = true; : : dlist_foreach_modify(iter, &lock->waiters) : { : PGPROC *waiter = dlist_container(PGPROC, lwWaitLink, iter.cur); 0.00 : 68f4dd: 48 8d 4a b8 lea -0x48(%rdx),%rcx : : if (wokeup_somebody && waiter->lwWaitMode == LW_EXCLUSIVE) 0.00 : 68f4e1: 75 dd jne 68f4c0 : * Delete 'node' from its list (it must be in one). : */ : STATIC_IF_INLINE void : dlist_delete(dlist_node *node) : { : node->prev->next = node->next; 0.00 : 68f4e3: 48 8b 51 48 mov 0x48(%rcx),%rdx 0.00 : 68f4e7: 48 8b 41 50 mov 0x50(%rcx),%rax 0.00 : 68f4eb: 48 89 42 08 mov %rax,0x8(%rdx) : node->next->prev = node->prev; 0.00 : 68f4ef: 48 8b 51 50 mov 0x50(%rcx),%rdx 0.00 : 68f4f3: 48 8b 41 48 mov 0x48(%rcx),%rax 0.00 : 68f4f7: 48 89 02 mov %rax,(%rdx) : * Insert a node at the end of the list. : */ : STATIC_IF_INLINE void : dlist_push_tail(dlist_head *head, dlist_node *node) : { : if (head->head.next == NULL) /* convert NULL header to circular */ 0.00 : 68f4fa: 48 83 7d d8 00 cmpq $0x0,-0x28(%rbp) : continue; : : dlist_delete(&waiter->lwWaitLink); : dlist_push_tail(&wakeup, &waiter->lwWaitLink); 0.00 : 68f4ff: 48 8d 51 48 lea 0x48(%rcx),%rdx 0.00 : 68f503: 0f 84 cf 00 00 00 je 68f5d8 : dlist_init(head); : : node->next = &head->head; 0.00 : 68f509: 4c 89 69 50 mov %r13,0x50(%rcx) : node->prev = head->head.prev; 0.00 : 68f50d: 48 8b 45 d0 mov -0x30(%rbp),%rax 0.00 : 68f511: 48 89 41 48 mov %rax,0x48(%rcx) : node->prev->next = node; 0.00 : 68f515: 48 89 50 08 mov %rdx,0x8(%rax) : head->head.prev = node; 0.00 : 68f519: 48 89 55 d0 mov %rdx,-0x30(%rbp) : : if (waiter->lwWaitMode != LW_WAIT_UNTIL_FREE) 0.00 : 68f51d: 0f b6 41 42 movzbl 0x42(%rcx),%eax 0.00 : 68f521: 3c 02 cmp $0x2,%al 0.00 : 68f523: 74 a6 je 68f4cb : : /* : * Once we've woken up an exclusive lock, there's no point in waking : * up anybody else. : */ : if(waiter->lwWaitMode == LW_EXCLUSIVE) 0.00 : 68f525: 84 c0 test %al,%al 0.00 : 68f527: 0f 84 0b 01 00 00 je 68f638 0.00 : 68f52d: 45 31 c0 xor %r8d,%r8d : #endif : : /* remove the to-be-awakened PGPROCs from the queue */ : releaseOK = true; : : dlist_foreach_modify(iter, &lock->waiters) 0.00 : 68f530: 49 39 f1 cmp %rsi,%r9 : : /* : * Once we've woken up an exclusive lock, there's no point in waking : * up anybody else. : */ : if(waiter->lwWaitMode == LW_EXCLUSIVE) 0.00 : 68f533: bf 01 00 00 00 mov $0x1,%edi : #endif : : /* remove the to-be-awakened PGPROCs from the queue */ : releaseOK = true; : : dlist_foreach_modify(iter, &lock->waiters) 0.00 : 68f538: 48 8b 46 08 mov 0x8(%rsi),%rax 0.00 : 68f53c: 75 96 jne 68f4d4 : if(waiter->lwWaitMode == LW_EXCLUSIVE) : break; : } : : /* The SpinLockRelease() below provides barrier semantics */ : BOOL_ACCESS_ONCE(lock->releaseOK) = releaseOK; 0.00 : 68f53e: 44 88 43 01 mov %r8b,0x1(%rbx) : SpinLockRelease(&lock->mutex); : : /* : * Awaken any waiters I removed from the queue. : */ : dlist_foreach_modify(iter, &wakeup) 0.00 : 68f542: 48 8b 4d d8 mov -0x28(%rbp),%rcx : : /* The SpinLockRelease() below provides barrier semantics */ : BOOL_ACCESS_ONCE(lock->releaseOK) = releaseOK; : : /* We are done updating shared state of the lock queue. */ : SpinLockRelease(&lock->mutex); 0.00 : 68f546: 41 c6 04 24 00 movb $0x0,(%r12) : : /* : * Awaken any waiters I removed from the queue. : */ : dlist_foreach_modify(iter, &wakeup) 0.00 : 68f54b: 48 85 c9 test %rcx,%rcx 0.00 : 68f54e: 74 47 je 68f597 0.00 : 68f550: 4c 39 e9 cmp %r13,%rcx 0.00 : 68f553: 48 8b 59 08 mov 0x8(%rcx),%rbx 0.00 : 68f557: 75 0d jne 68f566 0.00 : 68f559: eb 3c jmp 68f597 0.00 : 68f55b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 68f560: 48 89 d9 mov %rbx,%rcx 0.00 : 68f563: 48 89 c3 mov %rax,%rbx : { : PGPROC *waiter = dlist_container(PGPROC, lwWaitLink, iter.cur); 0.00 : 68f566: 48 8d 79 b8 lea -0x48(%rcx),%rdi : * Delete 'node' from its list (it must be in one). : */ : STATIC_IF_INLINE void : dlist_delete(dlist_node *node) : { : node->prev->next = node->next; 0.00 : 68f56a: 48 8b 57 48 mov 0x48(%rdi),%rdx 0.00 : 68f56e: 48 8b 47 50 mov 0x50(%rdi),%rax 0.00 : 68f572: 48 89 42 08 mov %rax,0x8(%rdx) : node->next->prev = node->prev; 0.00 : 68f576: 48 8b 57 50 mov 0x50(%rdi),%rdx 0.00 : 68f57a: 48 8b 47 48 mov 0x48(%rdi),%rax 0.00 : 68f57e: 48 89 02 mov %rax,(%rdx) : : LOG_LWDEBUG("LWLockRelease", lock, "release waiter"); : dlist_delete(&waiter->lwWaitLink); : pg_write_barrier(); : waiter->lwWaiting = false; : PGSemaphoreUnlock(&waiter->sem); 0.00 : 68f581: 48 83 c7 10 add $0x10,%rdi : PGPROC *waiter = dlist_container(PGPROC, lwWaitLink, iter.cur); : : LOG_LWDEBUG("LWLockRelease", lock, "release waiter"); : dlist_delete(&waiter->lwWaitLink); : pg_write_barrier(); : waiter->lwWaiting = false; 0.00 : 68f585: c6 41 f9 00 movb $0x0,-0x7(%rcx) : PGSemaphoreUnlock(&waiter->sem); 0.00 : 68f589: e8 02 8b fa ff callq 638090 : SpinLockRelease(&lock->mutex); : : /* : * Awaken any waiters I removed from the queue. : */ : dlist_foreach_modify(iter, &wakeup) 0.00 : 68f58e: 4c 39 eb cmp %r13,%rbx 0.00 : 68f591: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 68f595: 75 c9 jne 68f560 : TRACE_POSTGRESQL_LWLOCK_RELEASE(T_NAME(lock), T_ID(lock)); : : /* : * Now okay to allow cancel/die interrupts. : */ : RESUME_INTERRUPTS(); 0.00 : 68f597: 8b 05 fb aa 52 00 mov 0x52aafb(%rip),%eax # bba098 0.00 : 68f59d: 83 e8 01 sub $0x1,%eax 0.00 : 68f5a0: 89 05 f2 aa 52 00 mov %eax,0x52aaf2(%rip) # bba098 : } 0.00 : 68f5a6: 48 83 c4 18 add $0x18,%rsp 0.00 : 68f5aa: 5b pop %rbx 0.00 : 68f5ab: 41 5c pop %r12 0.00 : 68f5ad: 41 5d pop %r13 0.00 : 68f5af: c9 leaveq 0.00 : 68f5b0: c3 retq 0.00 : 68f5b1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : /* : * Release my hold on lock, after that it can immediately be acquired by : * others, even if we still have to wakeup other waiters. : */ : if (mode == LW_EXCLUSIVE) : lockcount = pg_atomic_sub_fetch_u32(&lock->lockcount, EXCLUSIVE_LOCK); 0.00 : 68f5b8: 49 8d 54 24 04 lea 0x4(%r12),%rdx 0.00 : 68f5bd: b8 00 00 00 c0 mov $0xc0000000,%eax 0.00 : 68f5c2: f0 0f c1 02 lock xadd %eax,(%rdx) : #if !defined(PG_HAVE_ATOMIC_SUB_FETCH_U32) && defined(PG_HAVE_ATOMIC_FETCH_SUB_U32) : #define PG_HAVE_ATOMIC_SUB_FETCH_U32 : static inline uint32 : pg_atomic_sub_fetch_u32_impl(volatile pg_atomic_uint32 *ptr, int32 sub_) : { : return pg_atomic_fetch_sub_u32_impl(ptr, sub_) - sub_; /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/../../../../src/include/port/atomics/generic.h:247 100.00 : 68f5c6: 8d 90 00 00 00 c0 lea -0x40000000(%rax),%edx 0.00 : 68f5cc: e9 81 fe ff ff jmpq 68f452 0.00 : 68f5d1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * Previous state will be thrown away without any cleanup. : */ : STATIC_IF_INLINE void : dlist_init(dlist_head *head) : { : head->head.next = head->head.prev = &head->head; 0.00 : 68f5d8: 4c 89 6d d0 mov %r13,-0x30(%rbp) 0.00 : 68f5dc: 4c 89 6d d8 mov %r13,-0x28(%rbp) 0.00 : 68f5e0: e9 24 ff ff ff jmpq 68f509 0.00 : 68f5e5: 0f 1f 00 nopl (%rax) : mode = held_lwlocks[i].mode; : break; : } : } : if (i < 0) : elog(ERROR, "lock %s %d is not held", T_NAME(lock), T_ID(lock)); 0.00 : 68f5e8: ba 10 d1 8a 00 mov $0x8ad110,%edx 0.00 : 68f5ed: be 31 06 00 00 mov $0x631,%esi 0.00 : 68f5f2: bf 85 d0 8a 00 mov $0x8ad085,%edi 0.00 : 68f5f7: e8 24 be 0e 00 callq 77b420 0.00 : 68f5fc: 49 63 54 24 0c movslq 0xc(%r12),%rdx 0.00 : 68f601: 48 8b 05 08 e4 4e 00 mov 0x4ee408(%rip),%rax # b7da10 0.00 : 68f608: bf 14 00 00 00 mov $0x14,%edi 0.00 : 68f60d: 48 8b 34 d0 mov (%rax,%rdx,8),%rsi 0.00 : 68f611: 31 d2 xor %edx,%edx 0.00 : 68f613: 4c 2b 66 08 sub 0x8(%rsi),%r12 0.00 : 68f617: 4c 89 e0 mov %r12,%rax 0.00 : 68f61a: 48 f7 76 10 divq 0x10(%rsi) 0.00 : 68f61e: 48 8b 16 mov (%rsi),%rdx 0.00 : 68f621: be bf d0 8a 00 mov $0x8ad0bf,%esi 0.00 : 68f626: 89 c1 mov %eax,%ecx 0.00 : 68f628: 31 c0 xor %eax,%eax 0.00 : 68f62a: e8 01 bc 0e 00 callq 77b230 0.00 : 68f62f: e8 9c 9e dd ff callq 4694d0 0.00 : 68f634: 0f 1f 40 00 nopl 0x0(%rax) : #endif : : /* remove the to-be-awakened PGPROCs from the queue */ : releaseOK = true; : : dlist_foreach_modify(iter, &lock->waiters) 0.00 : 68f638: 45 31 c0 xor %r8d,%r8d 0.00 : 68f63b: e9 fe fe ff ff jmpq 68f53e : : /* Acquire mutex. Time spent holding mutex should be short! */ : #ifdef LWLOCK_STATS : lwstats->spin_delay_count += SpinLockAcquire(&lock->mutex); : #else : SpinLockAcquire(&lock->mutex); 0.00 : 68f640: ba e1 02 00 00 mov $0x2e1,%edx 0.00 : 68f645: be 85 d0 8a 00 mov $0x8ad085,%esi 0.00 : 68f64a: 48 89 df mov %rbx,%rdi 0.00 : 68f64d: e8 ee 09 00 00 callq 690040 0.00 : 68f652: e9 37 fe ff ff jmpq 68f48e : #endif : : /* remove the to-be-awakened PGPROCs from the queue */ : releaseOK = true; : : dlist_foreach_modify(iter, &lock->waiters) 0.00 : 68f657: 41 b8 01 00 00 00 mov $0x1,%r8d 0.00 : 68f65d: e9 dc fe ff ff jmpq 68f53e : if (mode == LW_EXCLUSIVE && have_waiters) : check_waiters = true; : /* : * nobody has this locked anymore, potential exclusive lockers get a chance : */ : else if (lockcount == 0 && have_waiters) 0.00 : 68f662: 85 d2 test %edx,%edx 0.00 : 68f664: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 68f668: 0f 84 f8 fd ff ff je 68f466 0.00 : 68f66e: 66 90 xchg %ax,%ax 0.00 : 68f670: e9 22 ff ff ff jmpq 68f597 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3122 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000069b9e0 : : * overflow as an unrecoverable SIGSEGV, so we want to error out ourselves : * before hitting the hardware limit. : */ : void : check_stack_depth(void) : { 0.00 : 69b9e0: 55 push %rbp 0.00 : 69b9e1: 48 89 e5 mov %rsp,%rbp 0.00 : 69b9e4: 48 89 5d f0 mov %rbx,-0x10(%rbp) 0.00 : 69b9e8: 4c 89 65 f8 mov %r12,-0x8(%rbp) 0.00 : 69b9ec: 48 83 ec 20 sub $0x20,%rsp : long stack_depth; : : /* : * Compute distance from reference point to my local variables : */ : stack_depth = (long) (stack_base_ptr - &stack_top_loc); 0.00 : 69b9f0: 48 8b 0d f9 2d 4e 00 mov 0x4e2df9(%rip),%rcx # b7e7f0 0.00 : 69b9f7: 48 8d 45 ef lea -0x11(%rbp),%rax 0.00 : 69b9fb: 48 89 ca mov %rcx,%rdx 0.00 : 69b9fe: 48 29 c2 sub %rax,%rdx 0.00 : 69ba01: 48 89 d0 mov %rdx,%rax : * The test on stack_base_ptr prevents us from erroring out if called : * during process setup or in a non-backend process. Logically it should : * be done first, but putting it here avoids wasting cycles during normal : * cases. : */ : if (stack_depth > max_stack_depth_bytes && 0.00 : 69ba04: 48 c1 fa 3f sar $0x3f,%rdx 0.00 : 69ba08: 48 31 d0 xor %rdx,%rax 0.00 : 69ba0b: 48 29 d0 sub %rdx,%rax 0.00 : 69ba0e: 48 39 05 a3 cd 4c 00 cmp %rax,0x4ccda3(%rip) # b687b8 0.00 : 69ba15: 7d 05 jge 69ba1c 0.00 : 69ba17: 48 85 c9 test %rcx,%rcx 0.00 : 69ba1a: 75 0a jne 69ba26 : errhint("Increase the configuration parameter \"max_stack_depth\" (currently %dkB), " : "after ensuring the platform's stack depth limit is adequate.", : max_stack_depth))); : } : #endif /* IA64 */ : } 0.00 : 69ba1c: 48 8b 5d f0 mov -0x10(%rbp),%rbx 0.00 : 69ba20: 4c 8b 65 f8 mov -0x8(%rbp),%r12 0.00 : 69ba24: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3122 100.00 : 69ba25: c3 retq : * cases. : */ : if (stack_depth > max_stack_depth_bytes && : stack_base_ptr != NULL) : { : ereport(ERROR, 0.00 : 69ba26: 45 31 c0 xor %r8d,%r8d 0.00 : 69ba29: b9 e0 00 8b 00 mov $0x8b00e0,%ecx 0.00 : 69ba2e: ba 19 0c 00 00 mov $0xc19,%edx 0.00 : 69ba33: be d0 e8 8a 00 mov $0x8ae8d0,%esi 0.00 : 69ba38: bf 14 00 00 00 mov $0x14,%edi 0.00 : 69ba3d: e8 7e f0 0d 00 callq 77aac0 0.00 : 69ba42: 84 c0 test %al,%al 0.00 : 69ba44: 75 05 jne 69ba4b 0.00 : 69ba46: e8 85 da dc ff callq 4694d0 0.00 : 69ba4b: 8b 35 5b cd 4c 00 mov 0x4ccd5b(%rip),%esi # b687ac 0.00 : 69ba51: bf 60 f0 8a 00 mov $0x8af060,%edi 0.00 : 69ba56: 31 c0 xor %eax,%eax 0.00 : 69ba58: e8 43 02 0e 00 callq 77bca0 0.00 : 69ba5d: bf 00 ea 8a 00 mov $0x8aea00,%edi 0.00 : 69ba62: 41 89 c4 mov %eax,%r12d 0.00 : 69ba65: 31 c0 xor %eax,%eax 0.00 : 69ba67: e8 34 0e 0e 00 callq 77c8a0 0.00 : 69ba6c: bf 05 01 00 01 mov $0x1000105,%edi 0.00 : 69ba71: 89 c3 mov %eax,%ebx 0.00 : 69ba73: e8 d8 12 0e 00 callq 77cd50 0.00 : 69ba78: 44 89 e2 mov %r12d,%edx 0.00 : 69ba7b: 89 c7 mov %eax,%edi 0.00 : 69ba7d: 89 de mov %ebx,%esi 0.00 : 69ba7f: 31 c0 xor %eax,%eax 0.00 : 69ba81: e8 5a eb 0d 00 callq 77a5e0 0.00 : 69ba86: eb be jmp 69ba46 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/float.c:2650 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006d3720 : : PG_RETURN_BOOL(float8_cmp_internal(arg1, arg2) <= 0); : } : : Datum : float48gt(PG_FUNCTION_ARGS) : { 0.00 : 6d3720: 55 push %rbp 0.00 : 6d3721: 48 89 e5 mov %rsp,%rbp 0.00 : 6d3724: 53 push %rbx 0.00 : 6d3725: 48 89 fb mov %rdi,%rbx 0.00 : 6d3728: 48 83 ec 08 sub $0x8,%rsp : float4 arg1 = PG_GETARG_FLOAT4(0); 0.00 : 6d372c: 48 8b 7f 20 mov 0x20(%rdi),%rdi 0.00 : 6d3730: e8 7b a2 0a 00 callq 77d9b0 : float8 arg2 = PG_GETARG_FLOAT8(1); 0.00 : 6d3735: 48 8b 7b 28 mov 0x28(%rbx),%rdi : } : : Datum : float48gt(PG_FUNCTION_ARGS) : { : float4 arg1 = PG_GETARG_FLOAT4(0); 0.00 : 6d3739: f3 0f 11 45 f4 movss %xmm0,-0xc(%rbp) : float8 arg2 = PG_GETARG_FLOAT8(1); 100.00 : 6d373e: e8 8d a2 0a 00 callq 77d9d0 : : PG_RETURN_BOOL(float8_cmp_internal(arg1, arg2) > 0); 0.00 : 6d3743: f3 0f 10 55 f4 movss -0xc(%rbp),%xmm2 0.00 : 6d3748: 66 0f 28 c8 movapd %xmm0,%xmm1 0.00 : 6d374c: 0f 5a d2 cvtps2pd %xmm2,%xmm2 0.00 : 6d374f: 66 0f 28 c2 movapd %xmm2,%xmm0 0.00 : 6d3753: e8 c8 f7 ff ff callq 6d2f20 0.00 : 6d3758: 85 c0 test %eax,%eax 0.00 : 6d375a: 0f 9f c0 setg %al : } 0.00 : 6d375d: 48 83 c4 08 add $0x8,%rsp : float48gt(PG_FUNCTION_ARGS) : { : float4 arg1 = PG_GETARG_FLOAT4(0); : float8 arg2 = PG_GETARG_FLOAT8(1); : : PG_RETURN_BOOL(float8_cmp_internal(arg1, arg2) > 0); 0.00 : 6d3761: 0f b6 c0 movzbl %al,%eax : } 0.00 : 6d3764: 5b pop %rbx 0.00 : 6d3765: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/float.c:1878 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006d64d0 : : } : } : : Datum : float4_accum(PG_FUNCTION_ARGS) : { 0.00 : 6d64d0: 55 push %rbp 0.00 : 6d64d1: 48 89 e5 mov %rsp,%rbp 0.00 : 6d64d4: 41 55 push %r13 0.00 : 6d64d6: 41 54 push %r12 0.00 : 6d64d8: 49 89 fc mov %rdi,%r12 0.00 : 6d64db: 53 push %rbx 0.00 : 6d64dc: 48 83 ec 68 sub $0x68,%rsp : ArrayType *transarray = PG_GETARG_ARRAYTYPE_P(0); 0.00 : 6d64e0: 48 8b 7f 20 mov 0x20(%rdi),%rdi 0.00 : 6d64e4: e8 27 88 0a 00 callq 77ed10 : : /* do computations as float8 */ : float8 newval = PG_GETARG_FLOAT4(1); 0.00 : 6d64e9: 49 8b 7c 24 28 mov 0x28(%r12),%rdi : } : : Datum : float4_accum(PG_FUNCTION_ARGS) : { : ArrayType *transarray = PG_GETARG_ARRAYTYPE_P(0); 0.00 : 6d64ee: 49 89 c5 mov %rax,%r13 : : /* do computations as float8 */ : float8 newval = PG_GETARG_FLOAT4(1); 0.00 : 6d64f1: e8 ba 74 0a 00 callq 77d9b0 0.00 : 6d64f6: 0f 14 c0 unpcklps %xmm0,%xmm0 : float8 *transvalues; : float8 N, : sumX, : sumX2; : : transvalues = check_float8_array(transarray, "float4_accum", 3); 0.00 : 6d64f9: ba 03 00 00 00 mov $0x3,%edx 0.00 : 6d64fe: be 83 b5 8b 00 mov $0x8bb583,%esi 0.00 : 6d6503: 4c 89 ef mov %r13,%rdi : float4_accum(PG_FUNCTION_ARGS) : { : ArrayType *transarray = PG_GETARG_ARRAYTYPE_P(0); : : /* do computations as float8 */ : float8 newval = PG_GETARG_FLOAT4(1); 0.00 : 6d6506: 0f 5a c0 cvtps2pd %xmm0,%xmm0 0.00 : 6d6509: f2 0f 11 45 88 movsd %xmm0,-0x78(%rbp) : float8 *transvalues; : float8 N, : sumX, : sumX2; : : transvalues = check_float8_array(transarray, "float4_accum", 3); 0.00 : 6d650e: e8 2d e4 ff ff callq 6d4940 : N = transvalues[0]; 0.00 : 6d6513: f2 0f 10 00 movsd (%rax),%xmm0 : float8 *transvalues; : float8 N, : sumX, : sumX2; : : transvalues = check_float8_array(transarray, "float4_accum", 3); 0.00 : 6d6517: 48 89 c3 mov %rax,%rbx : N = transvalues[0]; 0.00 : 6d651a: f2 0f 11 45 90 movsd %xmm0,-0x70(%rbp) : sumX = transvalues[1]; 0.00 : 6d651f: f2 0f 10 40 08 movsd 0x8(%rax),%xmm0 0.00 : 6d6524: f2 0f 11 45 98 movsd %xmm0,-0x68(%rbp) : sumX2 = transvalues[2]; 0.00 : 6d6529: f2 0f 10 40 10 movsd 0x10(%rax),%xmm0 0.00 : 6d652e: f2 0f 11 45 a0 movsd %xmm0,-0x60(%rbp) : : N += 1.0; : sumX += newval; 0.00 : 6d6533: f2 0f 10 45 98 movsd -0x68(%rbp),%xmm0 0.00 : 6d6538: f2 0f 58 45 88 addsd -0x78(%rbp),%xmm0 0.00 : 6d653d: f2 0f 11 45 b0 movsd %xmm0,-0x50(%rbp) : CHECKFLOATVAL(sumX, isinf(transvalues[1]) || isinf(newval), true); 0.00 : 6d6542: e8 a9 35 d9 ff callq 469af0 <__isinf@plt> 0.00 : 6d6547: 85 c0 test %eax,%eax 0.00 : 6d6549: 74 12 je 6d655d 0.00 : 6d654b: f2 0f 10 45 98 movsd -0x68(%rbp),%xmm0 0.00 : 6d6550: e8 9b 35 d9 ff callq 469af0 <__isinf@plt> 0.00 : 6d6555: 85 c0 test %eax,%eax 0.00 : 6d6557: 0f 84 03 01 00 00 je 6d6660 : sumX2 += newval * newval; /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/float.c:1878 100.00 : 6d655d: f2 0f 10 45 88 movsd -0x78(%rbp),%xmm0 0.00 : 6d6562: f2 0f 59 c0 mulsd %xmm0,%xmm0 0.00 : 6d6566: f2 0f 58 45 a0 addsd -0x60(%rbp),%xmm0 0.00 : 6d656b: f2 0f 11 45 b8 movsd %xmm0,-0x48(%rbp) : CHECKFLOATVAL(sumX2, isinf(transvalues[2]) || isinf(newval), true); 0.00 : 6d6570: e8 7b 35 d9 ff callq 469af0 <__isinf@plt> 0.00 : 6d6575: 85 c0 test %eax,%eax 0.00 : 6d6577: 75 4f jne 6d65c8 : transvalues = check_float8_array(transarray, "float4_accum", 3); : N = transvalues[0]; : sumX = transvalues[1]; : sumX2 = transvalues[2]; : : N += 1.0; 0.00 : 6d6579: f2 0f 10 45 90 movsd -0x70(%rbp),%xmm0 : /* : * If we're invoked as an aggregate, we can cheat and modify our first : * parameter in-place to reduce palloc overhead. Otherwise we construct a : * new array with the updated transition data and return it. : */ : if (AggCheckCallContext(fcinfo, NULL)) 0.00 : 6d657e: 31 f6 xor %esi,%esi 0.00 : 6d6580: 4c 89 e7 mov %r12,%rdi : transvalues = check_float8_array(transarray, "float4_accum", 3); : N = transvalues[0]; : sumX = transvalues[1]; : sumX2 = transvalues[2]; : : N += 1.0; 0.00 : 6d6583: f2 0f 58 05 cd 8b 0d addsd 0xd8bcd(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 6d658a: 00 0.00 : 6d658b: f2 0f 11 45 a8 movsd %xmm0,-0x58(%rbp) : /* : * If we're invoked as an aggregate, we can cheat and modify our first : * parameter in-place to reduce palloc overhead. Otherwise we construct a : * new array with the updated transition data and return it. : */ : if (AggCheckCallContext(fcinfo, NULL)) 0.00 : 6d6590: e8 ab 1d ee ff callq 5b8340 0.00 : 6d6595: 85 c0 test %eax,%eax 0.00 : 6d6597: 74 67 je 6d6600 : { : transvalues[0] = N; 0.00 : 6d6599: f2 0f 10 45 a8 movsd -0x58(%rbp),%xmm0 : transvalues[1] = sumX; : transvalues[2] = sumX2; : : PG_RETURN_ARRAYTYPE_P(transarray); 0.00 : 6d659e: 4c 89 e8 mov %r13,%rax : * parameter in-place to reduce palloc overhead. Otherwise we construct a : * new array with the updated transition data and return it. : */ : if (AggCheckCallContext(fcinfo, NULL)) : { : transvalues[0] = N; 0.00 : 6d65a1: f2 0f 11 03 movsd %xmm0,(%rbx) : transvalues[1] = sumX; 0.00 : 6d65a5: f2 0f 10 45 b0 movsd -0x50(%rbp),%xmm0 0.00 : 6d65aa: f2 0f 11 43 08 movsd %xmm0,0x8(%rbx) : transvalues[2] = sumX2; 0.00 : 6d65af: f2 0f 10 45 b8 movsd -0x48(%rbp),%xmm0 0.00 : 6d65b4: f2 0f 11 43 10 movsd %xmm0,0x10(%rbx) : FLOAT8OID, : sizeof(float8), FLOAT8PASSBYVAL, 'd'); : : PG_RETURN_ARRAYTYPE_P(result); : } : } 0.00 : 6d65b9: 48 83 c4 68 add $0x68,%rsp 0.00 : 6d65bd: 5b pop %rbx 0.00 : 6d65be: 41 5c pop %r12 0.00 : 6d65c0: 41 5d pop %r13 0.00 : 6d65c2: c9 leaveq 0.00 : 6d65c3: c3 retq 0.00 : 6d65c4: 0f 1f 40 00 nopl 0x0(%rax) : : N += 1.0; : sumX += newval; : CHECKFLOATVAL(sumX, isinf(transvalues[1]) || isinf(newval), true); : sumX2 += newval * newval; : CHECKFLOATVAL(sumX2, isinf(transvalues[2]) || isinf(newval), true); 0.00 : 6d65c8: f2 0f 10 45 a0 movsd -0x60(%rbp),%xmm0 0.00 : 6d65cd: e8 1e 35 d9 ff callq 469af0 <__isinf@plt> 0.00 : 6d65d2: 85 c0 test %eax,%eax 0.00 : 6d65d4: 75 a3 jne 6d6579 0.00 : 6d65d6: f2 0f 10 45 88 movsd -0x78(%rbp),%xmm0 0.00 : 6d65db: e8 10 35 d9 ff callq 469af0 <__isinf@plt> 0.00 : 6d65e0: 85 c0 test %eax,%eax 0.00 : 6d65e2: 75 95 jne 6d6579 0.00 : 6d65e4: 45 31 c0 xor %r8d,%r8d 0.00 : 6d65e7: b9 7f ba 8b 00 mov $0x8bba7f,%ecx 0.00 : 6d65ec: ba 57 07 00 00 mov $0x757,%edx 0.00 : 6d65f1: e9 89 00 00 00 jmpq 6d667f 0.00 : 6d65f6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 6d65fd: 00 00 00 : else : { : Datum transdatums[3]; : ArrayType *result; : : transdatums[0] = Float8GetDatumFast(N); 0.00 : 6d6600: f2 0f 10 45 a8 movsd -0x58(%rbp),%xmm0 0.00 : 6d6605: e8 b6 73 0a 00 callq 77d9c0 : transdatums[1] = Float8GetDatumFast(sumX); 0.00 : 6d660a: f2 0f 10 45 b0 movsd -0x50(%rbp),%xmm0 : else : { : Datum transdatums[3]; : ArrayType *result; : : transdatums[0] = Float8GetDatumFast(N); 0.00 : 6d660f: 48 89 45 c0 mov %rax,-0x40(%rbp) : transdatums[1] = Float8GetDatumFast(sumX); 0.00 : 6d6613: e8 a8 73 0a 00 callq 77d9c0 : transdatums[2] = Float8GetDatumFast(sumX2); 0.00 : 6d6618: f2 0f 10 45 b8 movsd -0x48(%rbp),%xmm0 : { : Datum transdatums[3]; : ArrayType *result; : : transdatums[0] = Float8GetDatumFast(N); : transdatums[1] = Float8GetDatumFast(sumX); 0.00 : 6d661d: 48 89 45 c8 mov %rax,-0x38(%rbp) : transdatums[2] = Float8GetDatumFast(sumX2); 0.00 : 6d6621: e8 9a 73 0a 00 callq 77d9c0 : : result = construct_array(transdatums, 3, 0.00 : 6d6626: 48 8d 7d c0 lea -0x40(%rbp),%rdi : Datum transdatums[3]; : ArrayType *result; : : transdatums[0] = Float8GetDatumFast(N); : transdatums[1] = Float8GetDatumFast(sumX); : transdatums[2] = Float8GetDatumFast(sumX2); 0.00 : 6d662a: 48 89 45 d0 mov %rax,-0x30(%rbp) : : result = construct_array(transdatums, 3, 0.00 : 6d662e: 41 b9 64 00 00 00 mov $0x64,%r9d 0.00 : 6d6634: 41 b8 01 00 00 00 mov $0x1,%r8d 0.00 : 6d663a: b9 08 00 00 00 mov $0x8,%ecx 0.00 : 6d663f: ba bd 02 00 00 mov $0x2bd,%edx 0.00 : 6d6644: be 03 00 00 00 mov $0x3,%esi 0.00 : 6d6649: e8 a2 45 fe ff callq 6babf0 : FLOAT8OID, : sizeof(float8), FLOAT8PASSBYVAL, 'd'); : : PG_RETURN_ARRAYTYPE_P(result); : } : } 0.00 : 6d664e: 48 83 c4 68 add $0x68,%rsp 0.00 : 6d6652: 5b pop %rbx 0.00 : 6d6653: 41 5c pop %r12 0.00 : 6d6655: 41 5d pop %r13 0.00 : 6d6657: c9 leaveq 0.00 : 6d6658: c3 retq 0.00 : 6d6659: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : sumX = transvalues[1]; : sumX2 = transvalues[2]; : : N += 1.0; : sumX += newval; : CHECKFLOATVAL(sumX, isinf(transvalues[1]) || isinf(newval), true); 0.00 : 6d6660: f2 0f 10 45 88 movsd -0x78(%rbp),%xmm0 0.00 : 6d6665: e8 86 34 d9 ff callq 469af0 <__isinf@plt> 0.00 : 6d666a: 85 c0 test %eax,%eax 0.00 : 6d666c: 0f 85 eb fe ff ff jne 6d655d 0.00 : 6d6672: 45 31 c0 xor %r8d,%r8d 0.00 : 6d6675: b9 7f ba 8b 00 mov $0x8bba7f,%ecx 0.00 : 6d667a: ba 55 07 00 00 mov $0x755,%edx : sumX2 += newval * newval; : CHECKFLOATVAL(sumX2, isinf(transvalues[2]) || isinf(newval), true); 0.00 : 6d667f: be 27 b4 8b 00 mov $0x8bb427,%esi 0.00 : 6d6684: bf 14 00 00 00 mov $0x14,%edi 0.00 : 6d6689: e8 32 44 0a 00 callq 77aac0 0.00 : 6d668e: 84 c0 test %al,%al 0.00 : 6d6690: 75 05 jne 6d6697 0.00 : 6d6692: e8 39 2e d9 ff callq 4694d0 0.00 : 6d6697: bf 2f b4 8b 00 mov $0x8bb42f,%edi 0.00 : 6d669c: 31 c0 xor %eax,%eax 0.00 : 6d669e: e8 fd 61 0a 00 callq 77c8a0 0.00 : 6d66a3: bf 82 00 00 03 mov $0x3000082,%edi 0.00 : 6d66a8: 89 c3 mov %eax,%ebx 0.00 : 6d66aa: e8 a1 66 0a 00 callq 77cd50 0.00 : 6d66af: 89 de mov %ebx,%esi 0.00 : 6d66b1: 89 c7 mov %eax,%edi 0.00 : 6d66b3: 31 c0 xor %eax,%eax 0.00 : 6d66b5: e8 26 3f 0a 00 callq 77a5e0 0.00 : 6d66ba: eb d6 jmp 6d6692 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1309 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000077e030 : : return result; : } : : Datum : FunctionCall2Coll(FmgrInfo *flinfo, Oid collation, Datum arg1, Datum arg2) : { 0.00 : 77e030: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1309 100.00 : 77e031: 48 89 f8 mov %rdi,%rax 0.00 : 77e034: 48 89 e5 mov %rsp,%rbp 0.00 : 77e037: 48 81 ec b0 03 00 00 sub $0x3b0,%rsp : * utils/sort/tuplesort.c! : */ : FunctionCallInfoData fcinfo; : Datum result; : : InitFunctionCallInfoData(fcinfo, flinfo, 2, collation, NULL, NULL); 0.00 : 77e03e: 48 89 bd 50 fc ff ff mov %rdi,-0x3b0(%rbp) 0.00 : 77e045: 48 c7 85 58 fc ff ff movq $0x0,-0x3a8(%rbp) 0.00 : 77e04c: 00 00 00 00 : fcinfo.arg[0] = arg1; : fcinfo.arg[1] = arg2; : fcinfo.argnull[0] = false; : fcinfo.argnull[1] = false; : : result = FunctionCallInvoke(&fcinfo); 0.00 : 77e050: 48 8d bd 50 fc ff ff lea -0x3b0(%rbp),%rdi : * utils/sort/tuplesort.c! : */ : FunctionCallInfoData fcinfo; : Datum result; : : InitFunctionCallInfoData(fcinfo, flinfo, 2, collation, NULL, NULL); 0.00 : 77e057: 48 c7 85 60 fc ff ff movq $0x0,-0x3a0(%rbp) 0.00 : 77e05e: 00 00 00 00 0.00 : 77e062: 89 b5 68 fc ff ff mov %esi,-0x398(%rbp) 0.00 : 77e068: c6 85 6c fc ff ff 00 movb $0x0,-0x394(%rbp) 0.00 : 77e06f: 66 c7 85 6e fc ff ff movw $0x2,-0x392(%rbp) 0.00 : 77e076: 02 00 : : fcinfo.arg[0] = arg1; 0.00 : 77e078: 48 89 95 70 fc ff ff mov %rdx,-0x390(%rbp) : fcinfo.arg[1] = arg2; 0.00 : 77e07f: 48 89 8d 78 fc ff ff mov %rcx,-0x388(%rbp) : fcinfo.argnull[0] = false; 0.00 : 77e086: c6 45 90 00 movb $0x0,-0x70(%rbp) : fcinfo.argnull[1] = false; 0.00 : 77e08a: c6 45 91 00 movb $0x0,-0x6f(%rbp) : : result = FunctionCallInvoke(&fcinfo); 0.00 : 77e08e: ff 10 callq *(%rax) : : /* Check for null result, since caller is clearly not expecting one */ : if (unlikely(fcinfo.isnull)) 0.00 : 77e090: 80 bd 6c fc ff ff 00 cmpb $0x0,-0x394(%rbp) 0.00 : 77e097: 75 02 jne 77e09b : elog(ERROR, "function %u returned NULL", fcinfo.flinfo->fn_oid); : : return result; : } 0.00 : 77e099: c9 leaveq 0.00 : 77e09a: c3 retq : : result = FunctionCallInvoke(&fcinfo); : : /* Check for null result, since caller is clearly not expecting one */ : if (unlikely(fcinfo.isnull)) : elog(ERROR, "function %u returned NULL", fcinfo.flinfo->fn_oid); 0.00 : 77e09b: ba 40 52 8d 00 mov $0x8d5240,%edx 0.00 : 77e0a0: be 30 05 00 00 mov $0x530,%esi 0.00 : 77e0a5: bf b3 47 8d 00 mov $0x8d47b3,%edi 0.00 : 77e0aa: e8 71 d3 ff ff callq 77b420 0.00 : 77e0af: 48 8b 85 50 fc ff ff mov -0x3b0(%rbp),%rax 0.00 : 77e0b6: be 97 4c 8d 00 mov $0x8d4c97,%esi 0.00 : 77e0bb: bf 14 00 00 00 mov $0x14,%edi 0.00 : 77e0c0: 8b 50 08 mov 0x8(%rax),%edx 0.00 : 77e0c3: 31 c0 xor %eax,%eax 0.00 : 77e0c5: e8 66 d1 ff ff callq 77b230 0.00 : 77e0ca: e8 01 b4 ce ff callq 4694d0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:465 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000007832f0 : : * from the data in the hash table and return true. If not, it will return : * false. : */ : bool : CHashSearch(CHashTable table, void *entry) : { 0.00 : 7832f0: 55 push %rbp 0.00 : 7832f1: 48 89 e5 mov %rsp,%rbp 0.00 : 7832f4: 41 54 push %r12 0.00 : 7832f6: 49 89 f4 mov %rsi,%r12 0.00 : 7832f9: 53 push %rbx 0.00 : 7832fa: 48 89 fb mov %rdi,%rbx 0.00 : 7832fd: 48 83 ec 20 sub $0x20,%rsp : uint32 hashcode = hash_any(entry, table->desc.key_size); 0.00 : 783301: 0f b7 77 0e movzwl 0xe(%rdi),%esi 0.00 : 783305: 4c 89 e7 mov %r12,%rdi 0.00 : 783308: e8 43 d0 d0 ff callq 490350 : CHashPtr *b = &table->bucket[bucket]; : CHashScanResult scan; : : /* Prevent garbage collection for this bucket. */ : Assert(MyProc->hazard[0] == NULL); : MyProc->hazard[0] = CHashTableGetGarbageByBucket(table, bucket); 0.00 : 78330d: 0f b6 4b 14 movzbl 0x14(%rbx),%ecx : */ : bool : CHashSearch(CHashTable table, void *entry) : { : uint32 hashcode = hash_any(entry, table->desc.key_size); : uint32 bucket = hashcode & table->bucket_mask; 0.00 : 783311: 8b 7b 10 mov 0x10(%rbx),%edi 0.00 : 783314: 21 c7 and %eax,%edi : CHashPtr *b = &table->bucket[bucket]; 0.00 : 783316: 89 fe mov %edi,%esi : CHashScanResult scan; : : /* Prevent garbage collection for this bucket. */ : Assert(MyProc->hazard[0] == NULL); : MyProc->hazard[0] = CHashTableGetGarbageByBucket(table, bucket); 0.00 : 783318: d3 ef shr %cl,%edi 0.00 : 78331a: 0f b6 4b 15 movzbl 0x15(%rbx),%ecx 0.00 : 78331e: 89 fa mov %edi,%edx : bool : CHashSearch(CHashTable table, void *entry) : { : uint32 hashcode = hash_any(entry, table->desc.key_size); : uint32 bucket = hashcode & table->bucket_mask; : CHashPtr *b = &table->bucket[bucket]; 0.00 : 783320: 48 c1 e6 02 shl $0x2,%rsi 0.00 : 783324: 48 03 73 20 add 0x20(%rbx),%rsi : CHashScanResult scan; : : /* Prevent garbage collection for this bucket. */ : Assert(MyProc->hazard[0] == NULL); : MyProc->hazard[0] = CHashTableGetGarbageByBucket(table, bucket); 0.00 : 783328: d3 ea shr %cl,%edx 0.00 : 78332a: 48 8b 0d 17 a6 3f 00 mov 0x3fa617(%rip),%rcx # b7d948 0.00 : 783331: 01 fa add %edi,%edx 0.00 : 783333: 48 c1 e2 02 shl $0x2,%rdx 0.00 : 783337: 48 03 53 28 add 0x28(%rbx),%rdx 0.00 : 78333b: 48 89 91 e8 02 00 00 mov %rdx,0x2e8(%rcx) : pg_memory_barrier(); 0.00 : 783342: f0 83 04 24 00 lock addl $0x0,(%rsp) : : /* Scan bucket and return data from any matching entry. */ : CHashBucketScan(table, b, hashcode, entry, &scan); 0.00 : 783347: 4c 8d 45 d0 lea -0x30(%rbp),%r8 0.00 : 78334b: 4c 89 e1 mov %r12,%rcx 0.00 : 78334e: 89 c2 mov %eax,%edx 0.00 : 783350: 48 89 df mov %rbx,%rdi 0.00 : 783353: e8 48 f9 ff ff callq 782ca0 : if (scan.found) 0.00 : 783358: 80 7d e8 00 cmpb $0x0,-0x18(%rbp) 0.00 : 78335c: 75 32 jne 783390 : CHashNodeGetItem(scan.target_node) + table->desc.key_size, : table->desc.element_size - table->desc.key_size); : : /* Allow garbage collection for this bucket. */ : Assert(MyProc->hazard[0] != NULL); : pg_memory_barrier(); 0.00 : 78335e: f0 83 04 24 00 lock addl $0x0,(%rsp) : MyProc->hazard[0] = NULL; /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:465 100.00 : 783363: 48 8b 05 de a5 3f 00 mov 0x3fa5de(%rip),%rax # b7d948 0.00 : 78336a: 48 c7 80 e8 02 00 00 movq $0x0,0x2e8(%rax) 0.00 : 783371: 00 00 00 00 : : CHashTableIncrementStatistic(table, CHS_Search); : if (!scan.found) 0.00 : 783375: 0f b6 45 e8 movzbl -0x18(%rbp),%eax : /* Allow garbage collection for this bucket. */ : Assert(MyProc->hazard[0] != NULL); : pg_memory_barrier(); : MyProc->hazard[0] = NULL; : : CHashTableIncrementStatistic(table, CHS_Search); 0.00 : 783379: 48 83 43 40 01 addq $0x1,0x40(%rbx) : if (!scan.found) 0.00 : 78337e: 84 c0 test %al,%al 0.00 : 783380: 75 05 jne 783387 : CHashTableIncrementStatistic(table, CHS_Search_Failed); 0.00 : 783382: 48 83 43 48 01 addq $0x1,0x48(%rbx) : return scan.found; : } 0.00 : 783387: 48 83 c4 20 add $0x20,%rsp 0.00 : 78338b: 5b pop %rbx 0.00 : 78338c: 41 5c pop %r12 0.00 : 78338e: c9 leaveq 0.00 : 78338f: c3 retq : pg_memory_barrier(); : : /* Scan bucket and return data from any matching entry. */ : CHashBucketScan(table, b, hashcode, entry, &scan); : if (scan.found) : memcpy(((char *) entry) + table->desc.key_size, 0.00 : 783390: 0f b7 43 0e movzwl 0xe(%rbx),%eax 0.00 : 783394: 0f b7 53 0c movzwl 0xc(%rbx),%edx 0.00 : 783398: 0f b7 f0 movzwl %ax,%esi 0.00 : 78339b: 29 c2 sub %eax,%edx 0.00 : 78339d: 49 8d 3c 34 lea (%r12,%rsi,1),%rdi 0.00 : 7833a1: 48 83 c6 08 add $0x8,%rsi 0.00 : 7833a5: 48 03 75 e0 add -0x20(%rbp),%rsi 0.00 : 7833a9: 48 63 d2 movslq %edx,%rdx 0.00 : 7833ac: e8 3f 68 ce ff callq 469bf0 0.00 : 7833b1: eb ab jmp 78335e Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/resowner/resowner.c:577 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000079ae70 : : * We allow the case owner == NULL because the bufmgr is sometimes invoked : * outside any transaction (for example, during WAL recovery). : */ : void : ResourceOwnerEnlargeBuffers(ResourceOwner owner) : { 0.00 : 79ae70: 55 push %rbp 0.00 : 79ae71: 48 89 e5 mov %rsp,%rbp 0.00 : 79ae74: 4c 89 65 f8 mov %r12,-0x8(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/utils/resowner/resowner.c:577 100.00 : 79ae78: 48 89 5d f0 mov %rbx,-0x10(%rbp) 0.00 : 79ae7c: 48 83 ec 10 sub $0x10,%rsp : int newmax; : : if (owner == NULL || 0.00 : 79ae80: 48 85 ff test %rdi,%rdi : * We allow the case owner == NULL because the bufmgr is sometimes invoked : * outside any transaction (for example, during WAL recovery). : */ : void : ResourceOwnerEnlargeBuffers(ResourceOwner owner) : { 0.00 : 79ae83: 49 89 fc mov %rdi,%r12 : int newmax; : : if (owner == NULL || 0.00 : 79ae86: 74 2a je 79aeb2 0.00 : 79ae88: 8b 47 30 mov 0x30(%rdi),%eax 0.00 : 79ae8b: 39 47 20 cmp %eax,0x20(%rdi) 0.00 : 79ae8e: 7c 22 jl 79aeb2 : owner->nbuffers < owner->maxbuffers) : return; /* nothing to do */ : : if (owner->buffers == NULL) 0.00 : 79ae90: 48 8b 7f 28 mov 0x28(%rdi),%rdi 0.00 : 79ae94: 48 85 ff test %rdi,%rdi 0.00 : 79ae97: 74 27 je 79aec0 : MemoryContextAlloc(TopMemoryContext, newmax * sizeof(Buffer)); : owner->maxbuffers = newmax; : } : else : { : newmax = owner->maxbuffers * 2; 0.00 : 79ae99: 8d 1c 00 lea (%rax,%rax,1),%ebx : owner->buffers = (Buffer *) 0.00 : 79ae9c: 48 63 f3 movslq %ebx,%rsi 0.00 : 79ae9f: 48 c1 e6 02 shl $0x2,%rsi 0.00 : 79aea3: e8 48 de ff ff callq 798cf0 : repalloc(owner->buffers, newmax * sizeof(Buffer)); : owner->maxbuffers = newmax; 0.00 : 79aea8: 41 89 5c 24 30 mov %ebx,0x30(%r12) : owner->maxbuffers = newmax; : } : else : { : newmax = owner->maxbuffers * 2; : owner->buffers = (Buffer *) 0.00 : 79aead: 49 89 44 24 28 mov %rax,0x28(%r12) : repalloc(owner->buffers, newmax * sizeof(Buffer)); : owner->maxbuffers = newmax; : } : } 0.00 : 79aeb2: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 79aeb6: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 79aebb: c9 leaveq 0.00 : 79aebc: c3 retq 0.00 : 79aebd: 0f 1f 00 nopl (%rax) : return; /* nothing to do */ : : if (owner->buffers == NULL) : { : newmax = 16; : owner->buffers = (Buffer *) 0.00 : 79aec0: 48 8b 3d a1 f9 41 00 mov 0x41f9a1(%rip),%rdi # bba868 0.00 : 79aec7: be 40 00 00 00 mov $0x40,%esi 0.00 : 79aecc: e8 bf df ff ff callq 798e90 : MemoryContextAlloc(TopMemoryContext, newmax * sizeof(Buffer)); : owner->maxbuffers = newmax; 0.00 : 79aed1: 41 c7 44 24 30 10 00 movl $0x10,0x30(%r12) 0.00 : 79aed8: 00 00 : return; /* nothing to do */ : : if (owner->buffers == NULL) : { : newmax = 16; : owner->buffers = (Buffer *) 0.00 : 79aeda: 49 89 44 24 28 mov %rax,0x28(%r12) 0.00 : 79aedf: eb d1 jmp 79aeb2 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/port/qsort.c:100 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000007acbd0 : : : #define vecswap(a, b, n) if ((n) > 0) swapfunc((a), (b), (size_t)(n), swaptype) : : static char * : med3(char *a, char *b, char *c, int (*cmp) (const void *, const void *)) : { 0.00 : 7acbd0: 55 push %rbp 0.00 : 7acbd1: 48 89 e5 mov %rsp,%rbp 0.00 : 7acbd4: 48 89 5d e0 mov %rbx,-0x20(%rbp) 0.00 : 7acbd8: 4c 89 65 e8 mov %r12,-0x18(%rbp) 0.00 : 7acbdc: 48 89 f3 mov %rsi,%rbx 0.00 : 7acbdf: 4c 89 6d f0 mov %r13,-0x10(%rbp) 0.00 : 7acbe3: 4c 89 75 f8 mov %r14,-0x8(%rbp) 0.00 : 7acbe7: 49 89 d4 mov %rdx,%r12 0.00 : 7acbea: 48 83 ec 20 sub $0x20,%rsp 0.00 : 7acbee: 49 89 fe mov %rdi,%r14 0.00 : 7acbf1: 49 89 cd mov %rcx,%r13 : return cmp(a, b) < 0 ? 0.00 : 7acbf4: ff d1 callq *%rcx 0.00 : 7acbf6: 85 c0 test %eax,%eax 0.00 : 7acbf8: 78 2e js 7acc28 0.00 : 7acbfa: 4c 89 e6 mov %r12,%rsi 0.00 : 7acbfd: 48 89 df mov %rbx,%rdi 0.00 : 7acc00: 41 ff d5 callq *%r13 0.00 : 7acc03: 85 c0 test %eax,%eax 0.00 : 7acc05: 7e 49 jle 7acc50 0.00 : 7acc07: 49 89 dc mov %rbx,%r12 : (cmp(b, c) < 0 ? b : (cmp(a, c) < 0 ? c : a)) : : (cmp(b, c) > 0 ? b : (cmp(a, c) < 0 ? a : c)); : } 100.00 : 7acc0a: 4c 89 e0 mov %r12,%rax 0.00 : 7acc0d: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 7acc11: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 7acc16: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 7acc1b: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 0.00 : 7acc20: c9 leaveq 0.00 : 7acc21: c3 retq 0.00 : 7acc22: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : #define vecswap(a, b, n) if ((n) > 0) swapfunc((a), (b), (size_t)(n), swaptype) : : static char * : med3(char *a, char *b, char *c, int (*cmp) (const void *, const void *)) : { : return cmp(a, b) < 0 ? 0.00 : 7acc28: 4c 89 e6 mov %r12,%rsi 0.00 : 7acc2b: 48 89 df mov %rbx,%rdi 0.00 : 7acc2e: 41 ff d5 callq *%r13 0.00 : 7acc31: 85 c0 test %eax,%eax 0.00 : 7acc33: 78 d2 js 7acc07 0.00 : 7acc35: 4c 89 e6 mov %r12,%rsi 0.00 : 7acc38: 4c 89 f7 mov %r14,%rdi 0.00 : 7acc3b: 41 ff d5 callq *%r13 0.00 : 7acc3e: 85 c0 test %eax,%eax 0.00 : 7acc40: 78 c8 js 7acc0a 0.00 : 7acc42: 4d 89 f4 mov %r14,%r12 0.00 : 7acc45: eb c3 jmp 7acc0a 0.00 : 7acc47: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 7acc4e: 00 00 0.00 : 7acc50: 4c 89 e6 mov %r12,%rsi 0.00 : 7acc53: 4c 89 f7 mov %r14,%rdi 0.00 : 7acc56: 41 ff d5 callq *%r13 0.00 : 7acc59: 85 c0 test %eax,%eax 0.00 : 7acc5b: 79 ad jns 7acc0a 0.00 : 7acc5d: 0f 1f 00 nopl (%rax) 0.00 : 7acc60: eb e0 jmp 7acc42 Sorted summary for file /lib64/libc-2.11.3.so ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /lib64/libc-2.11.3.so ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000078e20 <_int_malloc>: 0.00 : 78e20: 41 57 push %r15 0.00 : 78e22: 41 56 push %r14 0.00 : 78e24: 41 55 push %r13 0.00 : 78e26: 41 54 push %r12 0.00 : 78e28: 55 push %rbp 0.00 : 78e29: 53 push %rbx 0.00 : 78e2a: 48 83 ec 78 sub $0x78,%rsp 0.00 : 78e2e: 48 83 fe bf cmp $0xffffffffffffffbf,%rsi 0.00 : 78e32: 48 89 7c 24 20 mov %rdi,0x20(%rsp) 0.00 : 78e37: 48 89 74 24 18 mov %rsi,0x18(%rsp) 0.00 : 78e3c: 0f 87 bd 09 00 00 ja 797ff <_int_malloc+0x9df> 0.00 : 78e42: 48 8b 44 24 18 mov 0x18(%rsp),%rax 0.00 : 78e47: 48 c7 44 24 28 20 00 movq $0x20,0x28(%rsp) 0.00 : 78e4e: 00 00 0.00 : 78e50: 48 83 c0 17 add $0x17,%rax 0.00 : 78e54: 48 89 c2 mov %rax,%rdx 0.00 : 78e57: 48 83 e2 f0 and $0xfffffffffffffff0,%rdx 0.00 : 78e5b: 48 83 f8 1f cmp $0x1f,%rax 0.00 : 78e5f: 48 0f 46 54 24 28 cmovbe 0x28(%rsp),%rdx 0.00 : 78e65: 48 3b 15 0c b9 2f 00 cmp 0x2fb90c(%rip),%rdx # 374778 0.00 : 78e6c: 48 89 54 24 28 mov %rdx,0x28(%rsp) 0.00 : 78e71: 77 6d ja 78ee0 <_int_malloc+0xc0> 0.00 : 78e73: 8b 44 24 28 mov 0x28(%rsp),%eax 0.00 : 78e77: 48 8b 4c 24 20 mov 0x20(%rsp),%rcx 0.00 : 78e7c: 48 8b 5c 24 20 mov 0x20(%rsp),%rbx 0.00 : 78e81: c1 e8 04 shr $0x4,%eax 0.00 : 78e84: 8d 50 fe lea -0x2(%rax),%edx 0.00 : 78e87: 89 d0 mov %edx,%eax 0.00 : 78e89: 48 8d 4c c1 08 lea 0x8(%rcx,%rax,8),%rcx 0.00 : 78e8e: 48 89 4c 24 38 mov %rcx,0x38(%rsp) 0.00 : 78e93: 4c 8b 7c c3 08 mov 0x8(%rbx,%rax,8),%r15 0.00 : 78e98: 4d 85 ff test %r15,%r15 0.00 : 78e9b: 74 43 je 78ee0 <_int_malloc+0xc0> 0.00 : 78e9d: 49 8b 47 08 mov 0x8(%r15),%rax 0.00 : 78ea1: 49 8d 5f 10 lea 0x10(%r15),%rbx 0.00 : 78ea5: c1 e8 04 shr $0x4,%eax 0.00 : 78ea8: 83 e8 02 sub $0x2,%eax 0.00 : 78eab: 39 d0 cmp %edx,%eax 0.00 : 78ead: 0f 85 91 0d 00 00 jne 79c44 <_int_malloc+0xe24> 0.00 : 78eb3: 49 8b 47 10 mov 0x10(%r15),%rax 0.00 : 78eb7: 48 8b 54 24 38 mov 0x38(%rsp),%rdx 0.00 : 78ebc: 48 89 02 mov %rax,(%rdx) 0.00 : 78ebf: 8b 05 bb b8 2f 00 mov 0x2fb8bb(%rip),%eax # 374780 0.00 : 78ec5: 85 c0 test %eax,%eax 0.00 : 78ec7: 0f 85 60 0d 00 00 jne 79c2d <_int_malloc+0xe0d> 0.00 : 78ecd: 48 83 c4 78 add $0x78,%rsp 0.00 : 78ed1: 48 89 d8 mov %rbx,%rax 0.00 : 78ed4: 5b pop %rbx 0.00 : 78ed5: 5d pop %rbp 0.00 : 78ed6: 41 5c pop %r12 0.00 : 78ed8: 41 5d pop %r13 0.00 : 78eda: 41 5e pop %r14 0.00 : 78edc: 41 5f pop %r15 0.00 : 78ede: c3 retq 0.00 : 78edf: 90 nop 0.00 : 78ee0: 48 81 7c 24 28 ff 03 cmpq $0x3ff,0x28(%rsp) 0.00 : 78ee7: 00 00 0.00 : 78ee9: 0f 87 b1 00 00 00 ja 78fa0 <_int_malloc+0x180> 0.00 : 78eef: 8b 4c 24 28 mov 0x28(%rsp),%ecx 0.00 : 78ef3: 48 8b 5c 24 20 mov 0x20(%rsp),%rbx 0.00 : 78ef8: c1 e9 04 shr $0x4,%ecx 0.00 : 78efb: 48 83 c3 68 add $0x68,%rbx 0.00 : 78eff: 8d 44 09 fe lea -0x2(%rcx,%rcx,1),%eax 0.00 : 78f03: 89 4c 24 34 mov %ecx,0x34(%rsp) 0.00 : 78f07: 48 89 5c 24 10 mov %rbx,0x10(%rsp) 0.00 : 78f0c: 89 c0 mov %eax,%eax 0.00 : 78f0e: 48 8d 4c c3 f0 lea -0x10(%rbx,%rax,8),%rcx 0.00 : 78f13: 4c 8b 79 18 mov 0x18(%rcx),%r15 0.00 : 78f17: 49 39 cf cmp %rcx,%r15 0.00 : 78f1a: 0f 84 ce 00 00 00 je 78fee <_int_malloc+0x1ce> 0.00 : 78f20: 4d 85 ff test %r15,%r15 0.00 : 78f23: 0f 84 c7 08 00 00 je 797f0 <_int_malloc+0x9d0> 0.00 : 78f29: 49 8b 47 18 mov 0x18(%r15),%rax 0.00 : 78f2d: 48 8d 35 5c 65 0c 00 lea 0xc655c(%rip),%rsi # 13f490 <__PRETTY_FUNCTION__.11129+0x1ab7> 0.00 : 78f34: 48 8b 50 10 mov 0x10(%rax),%rdx 0.00 : 78f38: 4c 39 fa cmp %r15,%rdx 0.00 : 78f3b: 0f 85 0a 0d 00 00 jne 79c4b <_int_malloc+0xe2b> 0.00 : 78f41: 48 8b 5c 24 28 mov 0x28(%rsp),%rbx 0.00 : 78f46: 48 83 4c 1a 08 01 orq $0x1,0x8(%rdx,%rbx,1) 0.00 : 78f4c: 48 89 41 18 mov %rax,0x18(%rcx) 0.00 : 78f50: 48 89 48 10 mov %rcx,0x10(%rax) 0.00 : 78f54: 48 8d 05 45 af 2f 00 lea 0x2faf45(%rip),%rax # 373ea0 0.00 : 78f5b: 48 39 44 24 20 cmp %rax,0x20(%rsp) 0.00 : 78f60: 74 05 je 78f67 <_int_malloc+0x147> 0.00 : 78f62: 48 83 4a 08 04 orq $0x4,0x8(%rdx) 0.00 : 78f67: 8b 05 13 b8 2f 00 mov 0x2fb813(%rip),%eax # 374780 0.00 : 78f6d: 48 8d 6a 10 lea 0x10(%rdx),%rbp 0.00 : 78f71: 48 89 eb mov %rbp,%rbx 0.00 : 78f74: 85 c0 test %eax,%eax 0.00 : 78f76: 0f 84 51 ff ff ff je 78ecd <_int_malloc+0xad> 0.00 : 78f7c: 48 8b 54 24 18 mov 0x18(%rsp),%rdx 0.00 : 78f81: f7 d0 not %eax 0.00 : 78f83: 48 89 ef mov %rbp,%rdi 0.00 : 78f86: 0f b6 f0 movzbl %al,%esi 0.00 : 78f89: 48 89 eb mov %rbp,%rbx 0.00 : 78f8c: e8 df a4 00 00 callq 83470 <__GI_memset> 0.00 : 78f91: e9 37 ff ff ff jmpq 78ecd <_int_malloc+0xad> 0.00 : 78f96: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 78f9d: 00 00 00 0.00 : 78fa0: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 78fa5: 48 c1 e8 06 shr $0x6,%rax 0.00 : 78fa9: 48 83 f8 30 cmp $0x30,%rax 0.00 : 78fad: 0f 86 26 06 00 00 jbe 795d9 <_int_malloc+0x7b9> 0.00 : 78fb3: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 78fb8: 48 c1 e8 09 shr $0x9,%rax 0.00 : 78fbc: 48 83 f8 14 cmp $0x14,%rax 0.00 : 78fc0: 0f 87 d6 06 00 00 ja 7969c <_int_malloc+0x87c> 0.00 : 78fc6: 83 c0 5b add $0x5b,%eax 0.00 : 78fc9: 89 44 24 34 mov %eax,0x34(%rsp) 0.00 : 78fcd: 48 8b 44 24 20 mov 0x20(%rsp),%rax 0.00 : 78fd2: 48 8b 54 24 20 mov 0x20(%rsp),%rdx 0.00 : 78fd7: 48 83 c0 68 add $0x68,%rax 0.00 : 78fdb: 48 89 44 24 10 mov %rax,0x10(%rsp) 0.00 : 78fe0: f6 42 04 01 testb $0x1,0x4(%rdx) 0.00 : 78fe4: 75 08 jne 78fee <_int_malloc+0x1ce> 0.00 : 78fe6: 48 89 d7 mov %rdx,%rdi 0.00 : 78fe9: e8 52 d8 ff ff callq 76840 0.00 : 78fee: 48 8b 4c 24 20 mov 0x20(%rsp),%rcx 0.00 : 78ff3: 8b 5c 24 28 mov 0x28(%rsp),%ebx 0.00 : 78ff7: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 78ffc: 48 83 c1 58 add $0x58,%rcx 0.00 : 79000: c1 eb 04 shr $0x4,%ebx 0.00 : 79003: 48 83 c0 20 add $0x20,%rax 0.00 : 79007: 48 89 4c 24 60 mov %rcx,0x60(%rsp) 0.00 : 7900c: 89 5c 24 6c mov %ebx,0x6c(%rsp) 0.00 : 79010: 48 89 44 24 08 mov %rax,0x8(%rsp) 0.00 : 79015: 45 31 ff xor %r15d,%r15d 0.00 : 79018: eb 67 jmp 79081 <_int_malloc+0x261> 0.00 : 7901a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 79020: 41 89 d5 mov %edx,%r13d 0.00 : 79023: 48 8b 54 24 10 mov 0x10(%rsp),%rdx 0.00 : 79028: 41 c1 ed 04 shr $0x4,%r13d 0.00 : 7902c: 43 8d 44 2d fe lea -0x2(%r13,%r13,1),%eax 0.00 : 79031: 48 98 cltq 0.00 : 79033: 48 8d 74 c2 f0 lea -0x10(%rdx,%rax,8),%rsi 0.00 : 79038: 48 8b 5e 10 mov 0x10(%rsi),%rbx 0.00 : 7903c: 44 89 e8 mov %r13d,%eax 0.00 : 7903f: 41 83 e5 1f and $0x1f,%r13d 0.00 : 79043: ba 01 00 00 00 mov $0x1,%edx 0.00 : 79048: 44 89 e9 mov %r13d,%ecx 0.00 : 7904b: c1 f8 05 sar $0x5,%eax 0.00 : 7904e: 41 83 c7 01 add $0x1,%r15d 0.00 : 79052: d3 e2 shl %cl,%edx 0.00 : 79054: 48 8b 4c 24 20 mov 0x20(%rsp),%rcx 0.00 : 79059: 48 98 cltq 0.00 : 7905b: 09 94 81 58 08 00 00 or %edx,0x858(%rcx,%rax,4) 0.00 : 79062: 41 81 ff 10 27 00 00 cmp $0x2710,%r15d 0.00 : 79069: 49 89 74 24 18 mov %rsi,0x18(%r12) 0.00 : 7906e: 49 89 5c 24 10 mov %rbx,0x10(%r12) 0.00 : 79073: 4c 89 63 18 mov %r12,0x18(%rbx) 0.00 : 79077: 4c 89 66 10 mov %r12,0x10(%rsi) 0.00 : 7907b: 0f 84 3f 03 00 00 je 793c0 <_int_malloc+0x5a0> 0.00 : 79081: 48 8b 5c 24 60 mov 0x60(%rsp),%rbx 0.00 : 79086: 4c 8b 63 18 mov 0x18(%rbx),%r12 0.00 : 7908a: 4c 39 e3 cmp %r12,%rbx 0.00 : 7908d: 0f 84 2d 03 00 00 je 793c0 <_int_malloc+0x5a0> 0.00 : 79093: 49 8b 44 24 08 mov 0x8(%r12),%rax 0.00 : 79098: 49 8b 5c 24 18 mov 0x18(%r12),%rbx 0.00 : 7909d: 48 83 f8 10 cmp $0x10,%rax 0.00 : 790a1: 0f 86 11 05 00 00 jbe 795b8 <_int_malloc+0x798> 0.00 : 790a7: 48 8b 54 24 20 mov 0x20(%rsp),%rdx 0.00 : 790ac: 48 3b 82 70 08 00 00 cmp 0x870(%rdx),%rax 0.00 : 790b3: 0f 87 ff 04 00 00 ja 795b8 <_int_malloc+0x798> 0.00 : 790b9: 48 89 c2 mov %rax,%rdx 0.00 : 790bc: 48 83 e2 f8 and $0xfffffffffffffff8,%rdx 0.00 : 790c0: 48 81 7c 24 28 ff 03 cmpq $0x3ff,0x28(%rsp) 0.00 : 790c7: 00 00 0.00 : 790c9: 77 0b ja 790d6 <_int_malloc+0x2b6> 0.00 : 790cb: 48 39 5c 24 60 cmp %rbx,0x60(%rsp) 0.00 : 790d0: 0f 84 aa 01 00 00 je 79280 <_int_malloc+0x460> 0.00 : 790d6: 48 8b 4c 24 60 mov 0x60(%rsp),%rcx 0.00 : 790db: 48 89 59 18 mov %rbx,0x18(%rcx) 0.00 : 790df: 48 89 4b 10 mov %rcx,0x10(%rbx) 0.00 : 790e3: 48 39 54 24 28 cmp %rdx,0x28(%rsp) 0.00 : 790e8: 0f 84 8a 04 00 00 je 79578 <_int_malloc+0x758> 0.00 : 790ee: 48 81 fa ff 03 00 00 cmp $0x3ff,%rdx 0.00 : 790f5: 0f 86 25 ff ff ff jbe 79020 <_int_malloc+0x200> 0.00 : 790fb: 48 89 d0 mov %rdx,%rax 0.00 : 790fe: 48 c1 e8 06 shr $0x6,%rax 0.00 : 79102: 48 83 f8 30 cmp $0x30,%rax 0.00 : 79106: 77 70 ja 79178 <_int_malloc+0x358> 0.00 : 79108: 44 8d 68 30 lea 0x30(%rax),%r13d 0.00 : 7910c: 8d 44 00 5e lea 0x5e(%rax,%rax,1),%eax 0.00 : 79110: 48 98 cltq 0.00 : 79112: 48 8d 04 c5 f0 ff ff lea -0x10(,%rax,8),%rax 0.00 : 79119: ff 0.00 : 7911a: 48 8b 6c 24 10 mov 0x10(%rsp),%rbp 0.00 : 7911f: 48 01 c5 add %rax,%rbp 0.00 : 79122: 48 8b 5d 10 mov 0x10(%rbp),%rbx 0.00 : 79126: 48 39 eb cmp %rbp,%rbx 0.00 : 79129: 0f 84 11 02 00 00 je 79340 <_int_malloc+0x520> 0.00 : 7912f: 48 8b 75 18 mov 0x18(%rbp),%rsi 0.00 : 79133: 49 89 d6 mov %rdx,%r14 0.00 : 79136: 49 83 ce 01 or $0x1,%r14 0.00 : 7913a: 48 8b 46 08 mov 0x8(%rsi),%rax 0.00 : 7913e: a8 04 test $0x4,%al 0.00 : 79140: 0f 85 da 00 00 00 jne 79220 <_int_malloc+0x400> 0.00 : 79146: 49 39 c6 cmp %rax,%r14 0.00 : 79149: 73 5d jae 791a8 <_int_malloc+0x388> 0.00 : 7914b: 48 8b 45 10 mov 0x10(%rbp),%rax 0.00 : 7914f: 48 89 eb mov %rbp,%rbx 0.00 : 79152: 49 89 44 24 20 mov %rax,0x20(%r12) 0.00 : 79157: 48 8b 45 10 mov 0x10(%rbp),%rax 0.00 : 7915b: 48 8b 40 28 mov 0x28(%rax),%rax 0.00 : 7915f: 49 89 44 24 28 mov %rax,0x28(%r12) 0.00 : 79164: 48 8b 55 10 mov 0x10(%rbp),%rdx 0.00 : 79168: 4c 89 60 20 mov %r12,0x20(%rax) 0.00 : 7916c: 4c 89 62 28 mov %r12,0x28(%rdx) 0.00 : 79170: e9 c7 fe ff ff jmpq 7903c <_int_malloc+0x21c> 0.00 : 79175: 0f 1f 00 nopl (%rax) 0.00 : 79178: 48 89 d0 mov %rdx,%rax 0.00 : 7917b: 48 c1 e8 09 shr $0x9,%rax 0.00 : 7917f: 48 83 f8 14 cmp $0x14,%rax 0.00 : 79183: 0f 87 c7 00 00 00 ja 79250 <_int_malloc+0x430> 0.00 : 79189: 44 8d 68 5b lea 0x5b(%rax),%r13d 0.00 : 7918d: 8d 84 00 b4 00 00 00 lea 0xb4(%rax,%rax,1),%eax 0.00 : 79194: 48 98 cltq 0.00 : 79196: 48 8d 04 c5 f0 ff ff lea -0x10(,%rax,8),%rax 0.00 : 7919d: ff 0.00 : 7919e: e9 77 ff ff ff jmpq 7911a <_int_malloc+0x2fa> 0.00 : 791a3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 791a8: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 791ac: a8 04 test $0x4,%al 0.00 : 791ae: 0f 85 b4 01 00 00 jne 79368 <_int_malloc+0x548> 0.00 : 791b4: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 791b8: 49 39 c6 cmp %rax,%r14 0.00 : 791bb: 73 34 jae 791f1 <_int_malloc+0x3d1> 0.00 : 791bd: 48 8b 5b 20 mov 0x20(%rbx),%rbx 0.00 : 791c1: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 791c5: a8 04 test $0x4,%al 0.00 : 791c7: 74 ef je 791b8 <_int_malloc+0x398> 0.00 : 791c9: 48 8d 0d 57 2c 0c 00 lea 0xc2c57(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 791d0: 48 8d 35 6b 29 0c 00 lea 0xc296b(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 791d7: 48 8d 3d 82 2a 0c 00 lea 0xc2a82(%rip),%rdi # 13bc60 <__PRETTY_FUNCTION__.14063+0x1f9> 0.00 : 791de: ba 94 11 00 00 mov $0x1194,%edx 0.00 : 791e3: e8 d8 d5 ff ff callq 767c0 <__malloc_assert> 0.00 : 791e8: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 791ec: 49 39 c6 cmp %rax,%r14 0.00 : 791ef: 72 cc jb 791bd <_int_malloc+0x39d> 0.00 : 791f1: 0f 84 61 01 00 00 je 79358 <_int_malloc+0x538> 0.00 : 791f7: 49 89 5c 24 20 mov %rbx,0x20(%r12) 0.00 : 791fc: 48 8b 43 28 mov 0x28(%rbx),%rax 0.00 : 79200: 49 89 44 24 28 mov %rax,0x28(%r12) 0.00 : 79205: 4c 89 63 28 mov %r12,0x28(%rbx) 0.00 : 79209: 49 8b 44 24 28 mov 0x28(%r12),%rax 0.00 : 7920e: 4c 89 60 20 mov %r12,0x20(%rax) 0.00 : 79212: 48 8b 73 18 mov 0x18(%rbx),%rsi 0.00 : 79216: e9 21 fe ff ff jmpq 7903c <_int_malloc+0x21c> 0.00 : 7921b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 79220: 48 8d 35 1b 29 0c 00 lea 0xc291b(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79227: 48 8d 0d f9 2b 0c 00 lea 0xc2bf9(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 7922e: 48 8d 3d 10 2a 0c 00 lea 0xc2a10(%rip),%rdi # 13bc45 <__PRETTY_FUNCTION__.14063+0x1de> 0.00 : 79235: ba 86 11 00 00 mov $0x1186,%edx 0.00 : 7923a: e8 81 d5 ff ff callq 767c0 <__malloc_assert> 0.00 : 7923f: 48 8b 75 18 mov 0x18(%rbp),%rsi 0.00 : 79243: 48 8b 46 08 mov 0x8(%rsi),%rax 0.00 : 79247: e9 fa fe ff ff jmpq 79146 <_int_malloc+0x326> 0.00 : 7924c: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 79250: 48 89 d0 mov %rdx,%rax 0.00 : 79253: 48 c1 e8 0c shr $0xc,%rax 0.00 : 79257: 48 83 f8 0a cmp $0xa,%rax 0.00 : 7925b: 0f 87 2f 01 00 00 ja 79390 <_int_malloc+0x570> 0.00 : 79261: 44 8d 68 6e lea 0x6e(%rax),%r13d 0.00 : 79265: 8d 84 00 da 00 00 00 lea 0xda(%rax,%rax,1),%eax 0.00 : 7926c: 48 98 cltq 0.00 : 7926e: 48 8d 04 c5 f0 ff ff lea -0x10(,%rax,8),%rax 0.00 : 79275: ff 0.00 : 79276: e9 9f fe ff ff jmpq 7911a <_int_malloc+0x2fa> 0.00 : 7927b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 79280: 48 8b 44 24 20 mov 0x20(%rsp),%rax 0.00 : 79285: 48 8b 48 60 mov 0x60(%rax),%rcx 0.00 : 79289: 4c 39 e1 cmp %r12,%rcx 0.00 : 7928c: 0f 85 44 fe ff ff jne 790d6 <_int_malloc+0x2b6> 0.00 : 79292: 48 3b 54 24 08 cmp 0x8(%rsp),%rdx 0.00 : 79297: 0f 86 39 fe ff ff jbe 790d6 <_int_malloc+0x2b6> 0.00 : 7929d: 48 8b 5c 24 28 mov 0x28(%rsp),%rbx 0.00 : 792a2: 48 8b 44 24 60 mov 0x60(%rsp),%rax 0.00 : 792a7: 48 89 d6 mov %rdx,%rsi 0.00 : 792aa: 48 2b 74 24 28 sub 0x28(%rsp),%rsi 0.00 : 792af: 49 8d 14 1c lea (%r12,%rbx,1),%rdx 0.00 : 792b3: 48 89 50 10 mov %rdx,0x10(%rax) 0.00 : 792b7: 48 89 50 18 mov %rdx,0x18(%rax) 0.00 : 792bb: 48 81 fe ff 03 00 00 cmp $0x3ff,%rsi 0.00 : 792c2: 48 8b 5c 24 20 mov 0x20(%rsp),%rbx 0.00 : 792c7: 48 89 53 60 mov %rdx,0x60(%rbx) 0.00 : 792cb: 48 89 42 10 mov %rax,0x10(%rdx) 0.00 : 792cf: 48 89 42 18 mov %rax,0x18(%rdx) 0.00 : 792d3: 76 10 jbe 792e5 <_int_malloc+0x4c5> 0.00 : 792d5: 48 c7 42 20 00 00 00 movq $0x0,0x20(%rdx) 0.00 : 792dc: 00 0.00 : 792dd: 48 c7 42 28 00 00 00 movq $0x0,0x28(%rdx) 0.00 : 792e4: 00 0.00 : 792e5: 48 8d 05 b4 ab 2f 00 lea 0x2fabb4(%rip),%rax # 373ea0 0.00 : 792ec: 48 39 44 24 20 cmp %rax,0x20(%rsp) 0.00 : 792f1: 48 8d 69 10 lea 0x10(%rcx),%rbp 0.00 : 792f5: 48 89 eb mov %rbp,%rbx 0.00 : 792f8: 0f 95 c0 setne %al 0.00 : 792fb: 48 83 4c 24 28 01 orq $0x1,0x28(%rsp) 0.00 : 79301: 0f b6 c0 movzbl %al,%eax 0.00 : 79304: 48 c1 e0 02 shl $0x2,%rax 0.00 : 79308: 48 09 44 24 28 or %rax,0x28(%rsp) 0.00 : 7930d: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 79312: 48 89 41 08 mov %rax,0x8(%rcx) 0.00 : 79316: 48 89 f0 mov %rsi,%rax 0.00 : 79319: 48 83 c8 01 or $0x1,%rax 0.00 : 7931d: 48 89 42 08 mov %rax,0x8(%rdx) 0.00 : 79321: 48 89 34 32 mov %rsi,(%rdx,%rsi,1) 0.00 : 79325: 8b 05 55 b4 2f 00 mov 0x2fb455(%rip),%eax # 374780 0.00 : 7932b: 85 c0 test %eax,%eax 0.00 : 7932d: 0f 84 9a fb ff ff je 78ecd <_int_malloc+0xad> 0.00 : 79333: e9 44 fc ff ff jmpq 78f7c <_int_malloc+0x15c> 0.00 : 79338: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 7933f: 00 0.00 : 79340: 4d 89 64 24 28 mov %r12,0x28(%r12) 0.00 : 79345: 4d 89 64 24 20 mov %r12,0x20(%r12) 0.00 : 7934a: 48 89 de mov %rbx,%rsi 0.00 : 7934d: e9 ea fc ff ff jmpq 7903c <_int_malloc+0x21c> 0.00 : 79352: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 79358: 48 8b 5b 10 mov 0x10(%rbx),%rbx 0.00 : 7935c: e9 b1 fe ff ff jmpq 79212 <_int_malloc+0x3f2> 0.00 : 79361: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 79368: 48 8d 0d b8 2a 0c 00 lea 0xc2ab8(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 7936f: 48 8d 35 cc 27 0c 00 lea 0xc27cc(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79376: 48 8d 3d e3 28 0c 00 lea 0xc28e3(%rip),%rdi # 13bc60 <__PRETTY_FUNCTION__.14063+0x1f9> 0.00 : 7937d: ba 90 11 00 00 mov $0x1190,%edx 0.00 : 79382: e8 39 d4 ff ff callq 767c0 <__malloc_assert> 0.00 : 79387: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 7938b: e9 28 fe ff ff jmpq 791b8 <_int_malloc+0x398> 0.00 : 79390: 48 89 d0 mov %rdx,%rax 0.00 : 79393: 48 c1 e8 0f shr $0xf,%rax 0.00 : 79397: 48 83 f8 04 cmp $0x4,%rax 0.00 : 7939b: 0f 87 47 01 00 00 ja 794e8 <_int_malloc+0x6c8> 0.00 : 793a1: 44 8d 68 77 lea 0x77(%rax),%r13d 0.00 : 793a5: 8d 84 00 ec 00 00 00 lea 0xec(%rax,%rax,1),%eax 0.00 : 793ac: 48 98 cltq 0.00 : 793ae: 48 8d 04 c5 f0 ff ff lea -0x10(,%rax,8),%rax 0.00 : 793b5: ff 0.00 : 793b6: e9 5f fd ff ff jmpq 7911a <_int_malloc+0x2fa> 0.00 : 793bb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 793c0: 48 81 7c 24 28 ff 03 cmpq $0x3ff,0x28(%rsp) 0.00 : 793c7: 00 00 0.00 : 793c9: 76 2c jbe 793f7 <_int_malloc+0x5d7> 0.00 : 793cb: 8b 54 24 34 mov 0x34(%rsp),%edx 0.00 : 793cf: 48 8b 4c 24 10 mov 0x10(%rsp),%rcx 0.00 : 793d4: 8d 44 12 fe lea -0x2(%rdx,%rdx,1),%eax 0.00 : 793d8: 89 c0 mov %eax,%eax 0.00 : 793da: 48 8d 54 c1 f0 lea -0x10(%rcx,%rax,8),%rdx 0.00 : 793df: 48 8b 42 10 mov 0x10(%rdx),%rax 0.00 : 793e3: 48 39 d0 cmp %rdx,%rax 0.00 : 793e6: 74 0f je 793f7 <_int_malloc+0x5d7> 0.00 : 793e8: 48 8b 5c 24 28 mov 0x28(%rsp),%rbx 0.00 : 793ed: 48 3b 58 08 cmp 0x8(%rax),%rbx 0.00 : 793f1: 0f 86 df 02 00 00 jbe 796d6 <_int_malloc+0x8b6> 0.00 : 793f7: 8b 4c 24 34 mov 0x34(%rsp),%ecx 0.00 : 793fb: 48 8b 5c 24 20 mov 0x20(%rsp),%rbx 0.00 : 79400: 48 8b 54 24 10 mov 0x10(%rsp),%rdx 0.00 : 79405: 83 c1 01 add $0x1,%ecx 0.00 : 79408: 8d 44 09 fe lea -0x2(%rcx,%rcx,1),%eax 0.00 : 7940c: 41 89 cd mov %ecx,%r13d 0.00 : 7940f: 83 e1 1f and $0x1f,%ecx 0.00 : 79412: 41 c1 ed 05 shr $0x5,%r13d 0.00 : 79416: 89 c0 mov %eax,%eax 0.00 : 79418: 45 89 ee mov %r13d,%r14d 0.00 : 7941b: 46 8b a4 b3 58 08 00 mov 0x858(%rbx,%r14,4),%r12d 0.00 : 79422: 00 0.00 : 79423: 48 8d 6c c2 f0 lea -0x10(%rdx,%rax,8),%rbp 0.00 : 79428: bb 01 00 00 00 mov $0x1,%ebx 0.00 : 7942d: d3 e3 shl %cl,%ebx 0.00 : 7942f: 90 nop 0.00 : 79430: 44 39 e3 cmp %r12d,%ebx 0.00 : 79433: 77 0b ja 79440 <_int_malloc+0x620> 0.00 : 79435: 85 db test %ebx,%ebx 0.00 : 79437: 0f 85 9a 00 00 00 jne 794d7 <_int_malloc+0x6b7> 0.00 : 7943d: 0f 1f 00 nopl (%rax) 0.00 : 79440: 41 83 c5 01 add $0x1,%r13d 0.00 : 79444: 41 83 fd 03 cmp $0x3,%r13d 0.00 : 79448: 0f 87 d2 00 00 00 ja 79520 <_int_malloc+0x700> 0.00 : 7944e: 48 8b 44 24 20 mov 0x20(%rsp),%rax 0.00 : 79453: 45 89 ee mov %r13d,%r14d 0.00 : 79456: 46 8b a4 b0 58 08 00 mov 0x858(%rax,%r14,4),%r12d 0.00 : 7945d: 00 0.00 : 7945e: 45 85 e4 test %r12d,%r12d 0.00 : 79461: 74 dd je 79440 <_int_malloc+0x620> 0.00 : 79463: 44 89 e8 mov %r13d,%eax 0.00 : 79466: 48 8b 54 24 10 mov 0x10(%rsp),%rdx 0.00 : 7946b: bb 01 00 00 00 mov $0x1,%ebx 0.00 : 79470: c1 e0 06 shl $0x6,%eax 0.00 : 79473: 83 e8 02 sub $0x2,%eax 0.00 : 79476: 44 85 e3 test %r12d,%ebx 0.00 : 79479: 89 c0 mov %eax,%eax 0.00 : 7947b: 48 8d 6c c2 f0 lea -0x10(%rdx,%rax,8),%rbp 0.00 : 79480: 74 5a je 794dc <_int_malloc+0x6bc> 0.00 : 79482: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 79488: 4c 8b 7d 18 mov 0x18(%rbp),%r15 0.00 : 7948c: 49 39 ef cmp %rbp,%r15 0.00 : 7948f: 0f 85 50 01 00 00 jne 795e5 <_int_malloc+0x7c5> 0.00 : 79495: 89 d8 mov %ebx,%eax 0.00 : 79497: 48 8b 4c 24 20 mov 0x20(%rsp),%rcx 0.00 : 7949c: 48 83 c5 10 add $0x10,%rbp 0.00 : 794a0: f7 d0 not %eax 0.00 : 794a2: 01 db add %ebx,%ebx 0.00 : 794a4: 41 21 c4 and %eax,%r12d 0.00 : 794a7: 46 89 a4 b1 58 08 00 mov %r12d,0x858(%rcx,%r14,4) 0.00 : 794ae: 00 0.00 : 794af: e9 7c ff ff ff jmpq 79430 <_int_malloc+0x610> 0.00 : 794b4: 48 8d 0d 6c 29 0c 00 lea 0xc296c(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 794bb: 48 8d 35 80 26 0c 00 lea 0xc2680(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 794c2: 48 8d 3d ae 27 0c 00 lea 0xc27ae(%rip),%rdi # 13bc77 <__PRETTY_FUNCTION__.14063+0x210> 0.00 : 794c9: ba 15 12 00 00 mov $0x1215,%edx 0.00 : 794ce: e8 ed d2 ff ff callq 767c0 <__malloc_assert> 0.00 : 794d3: 48 83 c5 10 add $0x10,%rbp 0.00 : 794d7: 44 85 e3 test %r12d,%ebx 0.00 : 794da: 75 ac jne 79488 <_int_malloc+0x668> 0.00 : 794dc: 01 db add %ebx,%ebx 0.00 : 794de: 75 f3 jne 794d3 <_int_malloc+0x6b3> 0.00 : 794e0: eb d2 jmp 794b4 <_int_malloc+0x694> 0.00 : 794e2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 794e8: 48 89 d1 mov %rdx,%rcx 0.00 : 794eb: 41 bd 7e 00 00 00 mov $0x7e,%r13d 0.00 : 794f1: b8 c0 07 00 00 mov $0x7c0,%eax 0.00 : 794f6: 48 c1 e9 12 shr $0x12,%rcx 0.00 : 794fa: 48 83 f9 02 cmp $0x2,%rcx 0.00 : 794fe: 0f 87 16 fc ff ff ja 7911a <_int_malloc+0x2fa> 0.00 : 79504: 8d 84 09 f6 00 00 00 lea 0xf6(%rcx,%rcx,1),%eax 0.00 : 7950b: 44 8d 69 7c lea 0x7c(%rcx),%r13d 0.00 : 7950f: 48 98 cltq 0.00 : 79511: 48 8d 04 c5 f0 ff ff lea -0x10(,%rax,8),%rax 0.00 : 79518: ff 0.00 : 79519: e9 fc fb ff ff jmpq 7911a <_int_malloc+0x2fa> 0.00 : 7951e: 66 90 xchg %ax,%ax 0.00 : 79520: 48 8b 5c 24 20 mov 0x20(%rsp),%rbx 0.00 : 79525: 4c 8b 6b 58 mov 0x58(%rbx),%r13 0.00 : 79529: 49 8b 55 08 mov 0x8(%r13),%rdx 0.00 : 7952d: 49 89 d6 mov %rdx,%r14 0.00 : 79530: 49 83 e6 f8 and $0xfffffffffffffff8,%r14 0.00 : 79534: 4c 3b 74 24 08 cmp 0x8(%rsp),%r14 0.00 : 79539: 0f 83 53 04 00 00 jae 79992 <_int_malloc+0xb72> 0.00 : 7953f: 48 8b 4c 24 20 mov 0x20(%rsp),%rcx 0.00 : 79544: f6 41 04 01 testb $0x1,0x4(%rcx) 0.00 : 79548: 0f 85 a2 04 00 00 jne 799f0 <_int_malloc+0xbd0> 0.00 : 7954e: 48 81 7c 24 28 ff 03 cmpq $0x3ff,0x28(%rsp) 0.00 : 79555: 00 00 0.00 : 79557: 0f 87 1b 01 00 00 ja 79678 <_int_malloc+0x858> 0.00 : 7955d: 48 8b 7c 24 20 mov 0x20(%rsp),%rdi 0.00 : 79562: e8 d9 d2 ff ff callq 76840 0.00 : 79567: 8b 5c 24 6c mov 0x6c(%rsp),%ebx 0.00 : 7956b: 89 5c 24 34 mov %ebx,0x34(%rsp) 0.00 : 7956f: e9 a1 fa ff ff jmpq 79015 <_int_malloc+0x1f5> 0.00 : 79574: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 79578: 48 8b 5c 24 28 mov 0x28(%rsp),%rbx 0.00 : 7957d: 48 8d 05 1c a9 2f 00 lea 0x2fa91c(%rip),%rax # 373ea0 0.00 : 79584: 49 83 4c 1c 08 01 orq $0x1,0x8(%r12,%rbx,1) 0.00 : 7958a: 48 39 44 24 20 cmp %rax,0x20(%rsp) 0.00 : 7958f: 74 06 je 79597 <_int_malloc+0x777> 0.00 : 79591: 49 83 4c 24 08 04 orq $0x4,0x8(%r12) 0.00 : 79597: 8b 05 e3 b1 2f 00 mov 0x2fb1e3(%rip),%eax # 374780 0.00 : 7959d: 49 8d 6c 24 10 lea 0x10(%r12),%rbp 0.00 : 795a2: 48 89 eb mov %rbp,%rbx 0.00 : 795a5: 85 c0 test %eax,%eax 0.00 : 795a7: 0f 84 20 f9 ff ff je 78ecd <_int_malloc+0xad> 0.00 : 795ad: e9 ca f9 ff ff jmpq 78f7c <_int_malloc+0x15c> 0.00 : 795b2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 795b8: 8b 3d 4a 8b 2f 00 mov 0x2f8b4a(%rip),%edi # 372108 0.00 : 795be: 49 8d 54 24 10 lea 0x10(%r12),%rdx 0.00 : 795c3: 48 8d 35 5f 26 0c 00 lea 0xc265f(%rip),%rsi # 13bc29 <__PRETTY_FUNCTION__.14063+0x1c2> 0.00 : 795ca: e8 91 cf ff ff callq 76560 0.00 : 795cf: 49 8b 44 24 08 mov 0x8(%r12),%rax 0.00 : 795d4: e9 e0 fa ff ff jmpq 790b9 <_int_malloc+0x299> 0.00 : 795d9: 83 c0 30 add $0x30,%eax 0.00 : 795dc: 89 44 24 34 mov %eax,0x34(%rsp) 0.00 : 795e0: e9 e8 f9 ff ff jmpq 78fcd <_int_malloc+0x1ad> 0.00 : 795e5: 4d 8b 67 08 mov 0x8(%r15),%r12 0.00 : 795e9: 49 83 e4 f8 and $0xfffffffffffffff8,%r12 0.00 : 795ed: 4c 39 64 24 28 cmp %r12,0x28(%rsp) 0.00 : 795f2: 0f 87 50 03 00 00 ja 79948 <_int_malloc+0xb28> 0.00 : 795f8: 49 8b 5f 10 mov 0x10(%r15),%rbx 0.00 : 795fc: 4d 89 e5 mov %r12,%r13 0.00 : 795ff: 4c 2b 6c 24 28 sub 0x28(%rsp),%r13 0.00 : 79604: 49 8b 47 18 mov 0x18(%r15),%rax 0.00 : 79608: 48 8b 6b 18 mov 0x18(%rbx),%rbp 0.00 : 7960c: 4c 39 fd cmp %r15,%rbp 0.00 : 7960f: 0f 85 de 06 00 00 jne 79cf3 <_int_malloc+0xed3> 0.00 : 79615: 4c 3b 78 10 cmp 0x10(%rax),%r15 0.00 : 79619: 0f 85 d4 06 00 00 jne 79cf3 <_int_malloc+0xed3> 0.00 : 7961f: 48 89 43 18 mov %rax,0x18(%rbx) 0.00 : 79623: 48 89 58 10 mov %rbx,0x10(%rax) 0.00 : 79627: 49 81 7f 08 ff 03 00 cmpq $0x3ff,0x8(%r15) 0.00 : 7962e: 00 0.00 : 7962f: 0f 87 89 02 00 00 ja 798be <_int_malloc+0xa9e> 0.00 : 79635: 49 83 fd 1f cmp $0x1f,%r13 0.00 : 79639: 0f 87 de 01 00 00 ja 7981d <_int_malloc+0x9fd> 0.00 : 7963f: 4b 83 4c 27 08 01 orq $0x1,0x8(%r15,%r12,1) 0.00 : 79645: 48 8d 05 54 a8 2f 00 lea 0x2fa854(%rip),%rax # 373ea0 0.00 : 7964c: 48 39 44 24 20 cmp %rax,0x20(%rsp) 0.00 : 79651: 74 05 je 79658 <_int_malloc+0x838> 0.00 : 79653: 49 83 4f 08 04 orq $0x4,0x8(%r15) 0.00 : 79658: 8b 05 22 b1 2f 00 mov 0x2fb122(%rip),%eax # 374780 0.00 : 7965e: 49 8d 6f 10 lea 0x10(%r15),%rbp 0.00 : 79662: 48 89 eb mov %rbp,%rbx 0.00 : 79665: 85 c0 test %eax,%eax 0.00 : 79667: 0f 84 60 f8 ff ff je 78ecd <_int_malloc+0xad> 0.00 : 7966d: e9 0a f9 ff ff jmpq 78f7c <_int_malloc+0x15c> 0.00 : 79672: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 79678: 48 8d 0d a8 27 0c 00 lea 0xc27a8(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 7967f: 48 8d 35 bc 24 0c 00 lea 0xc24bc(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79686: 48 8d 3d 13 5f 0c 00 lea 0xc5f13(%rip),%rdi # 13f5a0 <__PRETTY_FUNCTION__.11129+0x1bc7> 0.00 : 7968d: ba 90 12 00 00 mov $0x1290,%edx 0.00 : 79692: e8 29 d1 ff ff callq 767c0 <__malloc_assert> 0.00 : 79697: e9 c1 fe ff ff jmpq 7955d <_int_malloc+0x73d> 0.00 : 7969c: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 796a1: 48 c1 e8 0c shr $0xc,%rax 0.00 : 796a5: 48 83 f8 0a cmp $0xa,%rax 0.00 : 796a9: 76 1f jbe 796ca <_int_malloc+0x8aa> 0.00 : 796ab: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 796b0: 48 c1 e8 0f shr $0xf,%rax 0.00 : 796b4: 48 83 f8 04 cmp $0x4,%rax 0.00 : 796b8: 0f 87 ae 02 00 00 ja 7996c <_int_malloc+0xb4c> 0.00 : 796be: 83 c0 77 add $0x77,%eax 0.00 : 796c1: 89 44 24 34 mov %eax,0x34(%rsp) 0.00 : 796c5: e9 03 f9 ff ff jmpq 78fcd <_int_malloc+0x1ad> 0.00 : 796ca: 83 c0 6e add $0x6e,%eax 0.00 : 796cd: 89 44 24 34 mov %eax,0x34(%rsp) 0.00 : 796d1: e9 f7 f8 ff ff jmpq 78fcd <_int_malloc+0x1ad> 0.00 : 796d6: 48 8b 40 28 mov 0x28(%rax),%rax 0.00 : 796da: 48 8b 48 08 mov 0x8(%rax),%rcx 0.00 : 796de: 49 89 cc mov %rcx,%r12 0.00 : 796e1: 49 83 e4 f8 and $0xfffffffffffffff8,%r12 0.00 : 796e5: 4c 39 e3 cmp %r12,%rbx 0.00 : 796e8: 76 16 jbe 79700 <_int_malloc+0x8e0> 0.00 : 796ea: 48 8b 40 28 mov 0x28(%rax),%rax 0.00 : 796ee: 48 8b 48 08 mov 0x8(%rax),%rcx 0.00 : 796f2: 49 89 cc mov %rcx,%r12 0.00 : 796f5: 49 83 e4 f8 and $0xfffffffffffffff8,%r12 0.00 : 796f9: 4c 39 64 24 28 cmp %r12,0x28(%rsp) 0.00 : 796fe: 77 ea ja 796ea <_int_malloc+0x8ca> 0.00 : 79700: 48 39 42 18 cmp %rax,0x18(%rdx) 0.00 : 79704: 0f 84 9a 0a 00 00 je 7a1a4 <_int_malloc+0x1384> 0.00 : 7970a: 4c 8b 78 10 mov 0x10(%rax),%r15 0.00 : 7970e: 49 39 4f 08 cmp %rcx,0x8(%r15) 0.00 : 79712: 0f 84 83 0a 00 00 je 7a19b <_int_malloc+0x137b> 0.00 : 79718: 4c 89 fb mov %r15,%rbx 0.00 : 7971b: 49 89 c7 mov %rax,%r15 0.00 : 7971e: 48 8b 6b 18 mov 0x18(%rbx),%rbp 0.00 : 79722: 4d 89 e5 mov %r12,%r13 0.00 : 79725: 4c 2b 6c 24 28 sub 0x28(%rsp),%r13 0.00 : 7972a: 49 8b 47 18 mov 0x18(%r15),%rax 0.00 : 7972e: 4c 39 fd cmp %r15,%rbp 0.00 : 79731: 0f 85 20 0a 00 00 jne 7a157 <_int_malloc+0x1337> 0.00 : 79737: 4c 3b 78 10 cmp 0x10(%rax),%r15 0.00 : 7973b: 0f 85 16 0a 00 00 jne 7a157 <_int_malloc+0x1337> 0.00 : 79741: 48 89 43 18 mov %rax,0x18(%rbx) 0.00 : 79745: 48 89 58 10 mov %rbx,0x10(%rax) 0.00 : 79749: 49 81 7f 08 ff 03 00 cmpq $0x3ff,0x8(%r15) 0.00 : 79750: 00 0.00 : 79751: 0f 87 81 09 00 00 ja 7a0d8 <_int_malloc+0x12b8> 0.00 : 79757: 49 83 fd 1f cmp $0x1f,%r13 0.00 : 7975b: 0f 86 de fe ff ff jbe 7963f <_int_malloc+0x81f> 0.00 : 79761: 48 8b 54 24 60 mov 0x60(%rsp),%rdx 0.00 : 79766: 48 8d 35 b3 5d 0c 00 lea 0xc5db3(%rip),%rsi # 13f520 <__PRETTY_FUNCTION__.11129+0x1b47> 0.00 : 7976d: 48 8b 42 10 mov 0x10(%rdx),%rax 0.00 : 79771: 48 3b 50 18 cmp 0x18(%rax),%rdx 0.00 : 79775: 0f 85 d0 04 00 00 jne 79c4b <_int_malloc+0xe2b> 0.00 : 7977b: 48 8b 4c 24 28 mov 0x28(%rsp),%rcx 0.00 : 79780: 48 8b 5c 24 60 mov 0x60(%rsp),%rbx 0.00 : 79785: 49 81 fd ff 03 00 00 cmp $0x3ff,%r13 0.00 : 7978c: 49 8d 14 0f lea (%r15,%rcx,1),%rdx 0.00 : 79790: 48 89 5a 18 mov %rbx,0x18(%rdx) 0.00 : 79794: 48 89 42 10 mov %rax,0x10(%rdx) 0.00 : 79798: 48 89 53 10 mov %rdx,0x10(%rbx) 0.00 : 7979c: 48 89 50 18 mov %rdx,0x18(%rax) 0.00 : 797a0: 76 10 jbe 797b2 <_int_malloc+0x992> 0.00 : 797a2: 48 c7 42 20 00 00 00 movq $0x0,0x20(%rdx) 0.00 : 797a9: 00 0.00 : 797aa: 48 c7 42 28 00 00 00 movq $0x0,0x28(%rdx) 0.00 : 797b1: 00 0.00 : 797b2: 48 8d 05 e7 a6 2f 00 lea 0x2fa6e7(%rip),%rax # 373ea0 0.00 : 797b9: 48 39 44 24 20 cmp %rax,0x20(%rsp) 0.00 : 797be: 0f 95 c0 setne %al 0.00 : 797c1: 48 83 4c 24 28 01 orq $0x1,0x28(%rsp) 0.00 : 797c7: 0f b6 c0 movzbl %al,%eax 0.00 : 797ca: 48 c1 e0 02 shl $0x2,%rax 0.00 : 797ce: 48 09 44 24 28 or %rax,0x28(%rsp) 0.00 : 797d3: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 797d8: 49 89 47 08 mov %rax,0x8(%r15) 0.00 : 797dc: 4c 89 e8 mov %r13,%rax 0.00 : 797df: 48 83 c8 01 or $0x1,%rax 0.00 : 797e3: 48 89 42 08 mov %rax,0x8(%rdx) 0.00 : 797e7: 4e 89 2c 2a mov %r13,(%rdx,%r13,1) 0.00 : 797eb: e9 68 fe ff ff jmpq 79658 <_int_malloc+0x838> 0.00 : 797f0: 48 8b 7c 24 20 mov 0x20(%rsp),%rdi 0.00 : 797f5: e8 46 d0 ff ff callq 76840 0.00 : 797fa: e9 ef f7 ff ff jmpq 78fee <_int_malloc+0x1ce> 0.00 : 797ff: 48 8b 15 32 86 2f 00 mov 0x2f8632(%rip),%rdx # 371e38 <_DYNAMIC+0x2d8> 0.00 : 79806: 64 48 8b 04 25 00 00 mov %fs:0x0,%rax 0.00 : 7980d: 00 00 0.00 : 7980f: 31 db xor %ebx,%ebx 0.00 : 79811: c7 04 10 0c 00 00 00 movl $0xc,(%rax,%rdx,1) 0.00 : 79818: e9 b0 f6 ff ff jmpq 78ecd <_int_malloc+0xad> 0.00 : 7981d: 48 8b 5c 24 60 mov 0x60(%rsp),%rbx 0.00 : 79822: 48 8d 35 4f 5d 0c 00 lea 0xc5d4f(%rip),%rsi # 13f578 <__PRETTY_FUNCTION__.11129+0x1b9f> 0.00 : 79829: 48 8b 43 10 mov 0x10(%rbx),%rax 0.00 : 7982d: 48 3b 58 18 cmp 0x18(%rax),%rbx 0.00 : 79831: 0f 85 14 04 00 00 jne 79c4b <_int_malloc+0xe2b> 0.00 : 79837: 48 8b 4c 24 28 mov 0x28(%rsp),%rcx 0.00 : 7983c: 48 8b 5c 24 60 mov 0x60(%rsp),%rbx 0.00 : 79841: 49 8d 14 0f lea (%r15,%rcx,1),%rdx 0.00 : 79845: 48 81 f9 ff 03 00 00 cmp $0x3ff,%rcx 0.00 : 7984c: 48 89 5a 18 mov %rbx,0x18(%rdx) 0.00 : 79850: 48 89 42 10 mov %rax,0x10(%rdx) 0.00 : 79854: 48 89 53 10 mov %rdx,0x10(%rbx) 0.00 : 79858: 48 89 50 18 mov %rdx,0x18(%rax) 0.00 : 7985c: 77 09 ja 79867 <_int_malloc+0xa47> 0.00 : 7985e: 48 8b 44 24 20 mov 0x20(%rsp),%rax 0.00 : 79863: 48 89 50 60 mov %rdx,0x60(%rax) 0.00 : 79867: 49 81 fd ff 03 00 00 cmp $0x3ff,%r13 0.00 : 7986e: 76 10 jbe 79880 <_int_malloc+0xa60> 0.00 : 79870: 48 c7 42 20 00 00 00 movq $0x0,0x20(%rdx) 0.00 : 79877: 00 0.00 : 79878: 48 c7 42 28 00 00 00 movq $0x0,0x28(%rdx) 0.00 : 7987f: 00 0.00 : 79880: 48 8d 05 19 a6 2f 00 lea 0x2fa619(%rip),%rax # 373ea0 0.00 : 79887: 48 39 44 24 20 cmp %rax,0x20(%rsp) 0.00 : 7988c: 0f 95 c0 setne %al 0.00 : 7988f: 48 83 4c 24 28 01 orq $0x1,0x28(%rsp) 0.00 : 79895: 0f b6 c0 movzbl %al,%eax 0.00 : 79898: 48 c1 e0 02 shl $0x2,%rax 0.00 : 7989c: 48 09 44 24 28 or %rax,0x28(%rsp) 0.00 : 798a1: 4c 89 e8 mov %r13,%rax 0.00 : 798a4: 48 8b 4c 24 28 mov 0x28(%rsp),%rcx 0.00 : 798a9: 48 83 c8 01 or $0x1,%rax 0.00 : 798ad: 49 89 4f 08 mov %rcx,0x8(%r15) 0.00 : 798b1: 48 89 42 08 mov %rax,0x8(%rdx) 0.00 : 798b5: 4e 89 2c 2a mov %r13,(%rdx,%r13,1) 0.00 : 798b9: e9 9a fd ff ff jmpq 79658 <_int_malloc+0x838> 0.00 : 798be: 49 8b 47 20 mov 0x20(%r15),%rax 0.00 : 798c2: 48 85 c0 test %rax,%rax 0.00 : 798c5: 0f 84 6a fd ff ff je 79635 <_int_malloc+0x815> 0.00 : 798cb: 4c 3b 78 28 cmp 0x28(%rax),%r15 0.00 : 798cf: 74 1f je 798f0 <_int_malloc+0xad0> 0.00 : 798d1: 48 8d 0d 4f 25 0c 00 lea 0xc254f(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 798d8: 48 8d 35 63 22 0c 00 lea 0xc2263(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 798df: 48 8d 3d da 5b 0c 00 lea 0xc5bda(%rip),%rdi # 13f4c0 <__PRETTY_FUNCTION__.11129+0x1ae7> 0.00 : 798e6: ba 2b 12 00 00 mov $0x122b,%edx 0.00 : 798eb: e8 d0 ce ff ff callq 767c0 <__malloc_assert> 0.00 : 798f0: 48 8b 45 28 mov 0x28(%rbp),%rax 0.00 : 798f4: 48 3b 68 20 cmp 0x20(%rax),%rbp 0.00 : 798f8: 74 1f je 79919 <_int_malloc+0xaf9> 0.00 : 798fa: 48 8d 0d 26 25 0c 00 lea 0xc2526(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 79901: 48 8d 35 3a 22 0c 00 lea 0xc223a(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79908: 48 8d 3d e1 5b 0c 00 lea 0xc5be1(%rip),%rdi # 13f4f0 <__PRETTY_FUNCTION__.11129+0x1b17> 0.00 : 7990f: ba 2b 12 00 00 mov $0x122b,%edx 0.00 : 79914: e8 a7 ce ff ff callq 767c0 <__malloc_assert> 0.00 : 79919: 48 83 7b 20 00 cmpq $0x0,0x20(%rbx) 0.00 : 7991e: 0f 84 e9 03 00 00 je 79d0d <_int_malloc+0xeed> 0.00 : 79924: 48 8b 55 20 mov 0x20(%rbp),%rdx 0.00 : 79928: 48 8b 45 28 mov 0x28(%rbp),%rax 0.00 : 7992c: 48 89 42 28 mov %rax,0x28(%rdx) 0.00 : 79930: 48 8b 55 28 mov 0x28(%rbp),%rdx 0.00 : 79934: 48 8b 45 20 mov 0x20(%rbp),%rax 0.00 : 79938: 48 89 42 20 mov %rax,0x20(%rdx) 0.00 : 7993c: e9 f4 fc ff ff jmpq 79635 <_int_malloc+0x815> 0.00 : 79941: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 79948: 48 8d 0d d8 24 0c 00 lea 0xc24d8(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 7994f: 48 8d 35 ec 21 0c 00 lea 0xc21ec(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79956: 48 8d 3d eb 5b 0c 00 lea 0xc5beb(%rip),%rdi # 13f548 <__PRETTY_FUNCTION__.11129+0x1b6f> 0.00 : 7995d: ba 26 12 00 00 mov $0x1226,%edx 0.00 : 79962: e8 59 ce ff ff callq 767c0 <__malloc_assert> 0.00 : 79967: e9 8c fc ff ff jmpq 795f8 <_int_malloc+0x7d8> 0.00 : 7996c: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 79971: c7 44 24 34 7e 00 00 movl $0x7e,0x34(%rsp) 0.00 : 79978: 00 0.00 : 79979: 48 c1 e8 12 shr $0x12,%rax 0.00 : 7997d: 8d 50 7c lea 0x7c(%rax),%edx 0.00 : 79980: 48 83 f8 03 cmp $0x3,%rax 0.00 : 79984: 0f 43 54 24 34 cmovae 0x34(%rsp),%edx 0.00 : 79989: 89 54 24 34 mov %edx,0x34(%rsp) 0.00 : 7998d: e9 3b f6 ff ff jmpq 78fcd <_int_malloc+0x1ad> 0.00 : 79992: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 79997: 31 d2 xor %edx,%edx 0.00 : 79999: 49 8d 6d 10 lea 0x10(%r13),%rbp 0.00 : 7999d: 49 8d 4c 05 00 lea 0x0(%r13,%rax,1),%rcx 0.00 : 799a2: 48 8d 05 f7 a4 2f 00 lea 0x2fa4f7(%rip),%rax # 373ea0 0.00 : 799a9: 48 89 4b 58 mov %rcx,0x58(%rbx) 0.00 : 799ad: 48 39 c3 cmp %rax,%rbx 0.00 : 799b0: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 799b5: 0f 95 c2 setne %dl 0.00 : 799b8: 48 89 eb mov %rbp,%rbx 0.00 : 799bb: 48 c1 e2 02 shl $0x2,%rdx 0.00 : 799bf: 48 83 c8 01 or $0x1,%rax 0.00 : 799c3: 48 09 d0 or %rdx,%rax 0.00 : 799c6: 49 89 45 08 mov %rax,0x8(%r13) 0.00 : 799ca: 4c 2b 74 24 28 sub 0x28(%rsp),%r14 0.00 : 799cf: 49 83 ce 01 or $0x1,%r14 0.00 : 799d3: 4c 89 71 08 mov %r14,0x8(%rcx) 0.00 : 799d7: 8b 05 a3 ad 2f 00 mov 0x2fada3(%rip),%eax # 374780 0.00 : 799dd: 85 c0 test %eax,%eax 0.00 : 799df: 0f 84 e8 f4 ff ff je 78ecd <_int_malloc+0xad> 0.00 : 799e5: e9 92 f5 ff ff jmpq 78f7c <_int_malloc+0x15c> 0.00 : 799ea: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 799f0: 8b 05 5a ad 2f 00 mov 0x2fad5a(%rip),%eax # 374750 0.00 : 799f6: 83 e8 01 sub $0x1,%eax 0.00 : 799f9: 48 89 44 24 40 mov %rax,0x40(%rsp) ??:0 100.00 : 799fe: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 79a03: 48 3b 05 26 ad 2f 00 cmp 0x2fad26(%rip),%rax # 374730 0.00 : 79a0a: 0f 82 db 02 00 00 jb 79ceb <_int_malloc+0xecb> 0.00 : 79a10: 8b 05 2a ad 2f 00 mov 0x2fad2a(%rip),%eax # 374740 0.00 : 79a16: 3b 05 28 ad 2f 00 cmp 0x2fad28(%rip),%eax # 374744 0.00 : 79a1c: 0f 8d c9 02 00 00 jge 79ceb <_int_malloc+0xecb> 0.00 : 79a22: 48 8b 4c 24 40 mov 0x40(%rsp),%rcx 0.00 : 79a27: 48 8b 54 24 28 mov 0x28(%rsp),%rdx 0.00 : 79a2c: 48 89 c8 mov %rcx,%rax 0.00 : 79a2f: 48 8d 6c 11 08 lea 0x8(%rcx,%rdx,1),%rbp 0.00 : 79a34: 48 f7 d0 not %rax 0.00 : 79a37: 48 21 c5 and %rax,%rbp 0.00 : 79a3a: 48 39 ea cmp %rbp,%rdx 0.00 : 79a3d: 0f 82 68 03 00 00 jb 79dab <_int_malloc+0xf8b> 0.00 : 79a43: 48 8b 5c 24 20 mov 0x20(%rsp),%rbx 0.00 : 79a48: 41 bf 01 00 00 00 mov $0x1,%r15d 0.00 : 79a4e: 4c 8b 6b 58 mov 0x58(%rbx),%r13 0.00 : 79a52: 49 8b 55 08 mov 0x8(%r13),%rdx 0.00 : 79a56: 49 89 d6 mov %rdx,%r14 0.00 : 79a59: 49 83 e6 f8 and $0xfffffffffffffff8,%r14 0.00 : 79a5d: 4d 85 f6 test %r14,%r14 0.00 : 79a60: 4b 8d 4c 35 00 lea 0x0(%r13,%r14,1),%rcx 0.00 : 79a65: 0f 95 44 24 5f setne 0x5f(%rsp) 0.00 : 79a6a: 4c 39 6c 24 60 cmp %r13,0x60(%rsp) 0.00 : 79a6f: 48 89 4c 24 50 mov %rcx,0x50(%rsp) 0.00 : 79a74: 0f 84 c6 07 00 00 je 7a240 <_int_malloc+0x1420> 0.00 : 79a7a: 49 83 fe 1f cmp $0x1f,%r14 0.00 : 79a7e: 76 11 jbe 79a91 <_int_malloc+0xc71> 0.00 : 79a80: 83 e2 01 and $0x1,%edx 0.00 : 79a83: 74 0c je 79a91 <_int_malloc+0xc71> 0.00 : 79a85: 48 8b 5c 24 40 mov 0x40(%rsp),%rbx 0.00 : 79a8a: 48 85 5c 24 50 test %rbx,0x50(%rsp) 0.00 : 79a8f: 74 1f je 79ab0 <_int_malloc+0xc90> 0.00 : 79a91: 48 8d 0d 9b 23 0c 00 lea 0xc239b(%rip),%rcx # 13be33 <__func__.13350> 0.00 : 79a98: 48 8d 35 a3 20 0c 00 lea 0xc20a3(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79a9f: 48 8d 3d a2 5b 0c 00 lea 0xc5ba2(%rip),%rdi # 13f648 <__PRETTY_FUNCTION__.11129+0x1c6f> 0.00 : 79aa6: ba 13 0c 00 00 mov $0xc13,%edx 0.00 : 79aab: e8 10 cd ff ff callq 767c0 <__malloc_assert> 0.00 : 79ab0: 4c 39 74 24 08 cmp %r14,0x8(%rsp) 0.00 : 79ab5: 77 1f ja 79ad6 <_int_malloc+0xcb6> 0.00 : 79ab7: 48 8d 0d 75 23 0c 00 lea 0xc2375(%rip),%rcx # 13be33 <__func__.13350> 0.00 : 79abe: 48 8d 35 7d 20 0c 00 lea 0xc207d(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79ac5: 48 8d 3d fc 5c 0c 00 lea 0xc5cfc(%rip),%rdi # 13f7c8 <__PRETTY_FUNCTION__.11129+0x1def> 0.00 : 79acc: ba 16 0c 00 00 mov $0xc16,%edx 0.00 : 79ad1: e8 ea cc ff ff callq 767c0 <__malloc_assert> 0.00 : 79ad6: 48 8b 44 24 20 mov 0x20(%rsp),%rax 0.00 : 79adb: f6 40 04 01 testb $0x1,0x4(%rax) 0.00 : 79adf: 75 1f jne 79b00 <_int_malloc+0xce0> 0.00 : 79ae1: 48 8d 0d 4b 23 0c 00 lea 0xc234b(%rip),%rcx # 13be33 <__func__.13350> 0.00 : 79ae8: 48 8d 35 53 20 0c 00 lea 0xc2053(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79aef: 48 8d 3d 8a 21 0c 00 lea 0xc218a(%rip),%rdi # 13bc80 <__PRETTY_FUNCTION__.14063+0x219> 0.00 : 79af6: ba 1a 0c 00 00 mov $0xc1a,%edx 0.00 : 79afb: e8 c0 cc ff ff callq 767c0 <__malloc_assert> 0.00 : 79b00: 48 8d 15 99 a3 2f 00 lea 0x2fa399(%rip),%rdx # 373ea0 0.00 : 79b07: 48 39 54 24 20 cmp %rdx,0x20(%rsp) 0.00 : 79b0c: 0f 84 58 03 00 00 je 79e6a <_int_malloc+0x104a> 0.00 : 79b12: 48 8b 5c 24 08 mov 0x8(%rsp),%rbx 0.00 : 79b17: 4c 89 ed mov %r13,%rbp 0.00 : 79b1a: 48 81 e5 00 00 00 fc and $0xfffffffffc000000,%rbp 0.00 : 79b21: 4c 8b 65 10 mov 0x10(%rbp),%r12 0.00 : 79b25: 4c 29 f3 sub %r14,%rbx 0.00 : 79b28: 48 85 db test %rbx,%rbx 0.00 : 79b2b: 0f 8e 31 01 00 00 jle 79c62 <_int_malloc+0xe42> 0.00 : 79b31: e8 4a a6 05 00 callq d4180 <__getpagesize> 0.00 : 79b36: 83 e8 01 sub $0x1,%eax 0.00 : 79b39: 48 98 cltq 0.00 : 79b3b: 48 8d 14 03 lea (%rbx,%rax,1),%rdx 0.00 : 79b3f: 48 f7 d0 not %rax 0.00 : 79b42: 48 21 c2 and %rax,%rdx 0.00 : 79b45: 4a 8d 1c 22 lea (%rdx,%r12,1),%rbx 0.00 : 79b49: 48 81 fb 00 00 00 04 cmp $0x4000000,%rbx 0.00 : 79b50: 0f 87 0c 01 00 00 ja 79c62 <_int_malloc+0xe42> 0.00 : 79b56: 48 8b 45 18 mov 0x18(%rbp),%rax 0.00 : 79b5a: 48 39 c3 cmp %rax,%rbx 0.00 : 79b5d: 0f 87 22 02 00 00 ja 79d85 <_int_malloc+0xf65> 0.00 : 79b63: 48 89 5d 10 mov %rbx,0x10(%rbp) 0.00 : 79b67: 48 8b 4c 24 20 mov 0x20(%rsp),%rcx 0.00 : 79b6c: 4c 29 e3 sub %r12,%rbx 0.00 : 79b6f: 48 01 99 70 08 00 00 add %rbx,0x870(%rcx) 0.00 : 79b76: 48 8b 05 13 ac 2f 00 mov 0x2fac13(%rip),%rax # 374790 0.00 : 79b7d: 48 03 45 10 add 0x10(%rbp),%rax 0.00 : 79b81: 4c 29 e0 sub %r12,%rax 0.00 : 79b84: 48 89 05 05 ac 2f 00 mov %rax,0x2fac05(%rip) # 374790 0.00 : 79b8b: 48 03 6d 10 add 0x10(%rbp),%rbp 0.00 : 79b8f: 4c 29 ed sub %r13,%rbp 0.00 : 79b92: 48 83 cd 01 or $0x1,%rbp 0.00 : 79b96: 49 89 6d 08 mov %rbp,0x8(%r13) 0.00 : 79b9a: 48 8b 5c 24 20 mov 0x20(%rsp),%rbx 0.00 : 79b9f: 48 8b 83 70 08 00 00 mov 0x870(%rbx),%rax 0.00 : 79ba6: 48 3b 83 78 08 00 00 cmp 0x878(%rbx),%rax 0.00 : 79bad: 76 07 jbe 79bb6 <_int_malloc+0xd96> 0.00 : 79baf: 48 89 83 78 08 00 00 mov %rax,0x878(%rbx) 0.00 : 79bb6: 48 8b 44 24 20 mov 0x20(%rsp),%rax 0.00 : 79bbb: 48 8b 78 58 mov 0x58(%rax),%rdi 0.00 : 79bbf: 48 8b 77 08 mov 0x8(%rdi),%rsi 0.00 : 79bc3: 48 83 e6 f8 and $0xfffffffffffffff8,%rsi 0.00 : 79bc7: 48 39 74 24 08 cmp %rsi,0x8(%rsp) 0.00 : 79bcc: 0f 87 2d fc ff ff ja 797ff <_int_malloc+0x9df> 0.00 : 79bd2: 48 8b 54 24 28 mov 0x28(%rsp),%rdx 0.00 : 79bd7: 48 8d 1d c2 a2 2f 00 lea 0x2fa2c2(%rip),%rbx # 373ea0 0.00 : 79bde: 48 8d 0c 17 lea (%rdi,%rdx,1),%rcx 0.00 : 79be2: 31 d2 xor %edx,%edx 0.00 : 79be4: 48 39 d8 cmp %rbx,%rax 0.00 : 79be7: 0f 95 c2 setne %dl 0.00 : 79bea: 48 8d 5f 10 lea 0x10(%rdi),%rbx 0.00 : 79bee: 48 89 48 58 mov %rcx,0x58(%rax) 0.00 : 79bf2: 48 8b 44 24 28 mov 0x28(%rsp),%rax 0.00 : 79bf7: 48 c1 e2 02 shl $0x2,%rdx 0.00 : 79bfb: 48 83 c8 01 or $0x1,%rax 0.00 : 79bff: 48 09 d0 or %rdx,%rax 0.00 : 79c02: 48 89 47 08 mov %rax,0x8(%rdi) 0.00 : 79c06: 48 89 f0 mov %rsi,%rax 0.00 : 79c09: 48 2b 44 24 28 sub 0x28(%rsp),%rax 0.00 : 79c0e: 48 83 c8 01 or $0x1,%rax 0.00 : 79c12: 48 89 41 08 mov %rax,0x8(%rcx) 0.00 : 79c16: 48 85 db test %rbx,%rbx 0.00 : 79c19: 0f 84 ae f2 ff ff je 78ecd <_int_malloc+0xad> 0.00 : 79c1f: 8b 05 5b ab 2f 00 mov 0x2fab5b(%rip),%eax # 374780 0.00 : 79c25: 85 c0 test %eax,%eax 0.00 : 79c27: 0f 84 a0 f2 ff ff je 78ecd <_int_malloc+0xad> 0.00 : 79c2d: 48 8b 54 24 18 mov 0x18(%rsp),%rdx 0.00 : 79c32: f7 d0 not %eax 0.00 : 79c34: 48 89 df mov %rbx,%rdi 0.00 : 79c37: 0f b6 f0 movzbl %al,%esi 0.00 : 79c3a: e8 31 98 00 00 callq 83470 <__GI_memset> 0.00 : 79c3f: e9 89 f2 ff ff jmpq 78ecd <_int_malloc+0xad> 0.00 : 79c44: 48 8d 35 1d 58 0c 00 lea 0xc581d(%rip),%rsi # 13f468 <__PRETTY_FUNCTION__.11129+0x1a8f> 0.00 : 79c4b: 49 8d 5f 10 lea 0x10(%r15),%rbx 0.00 : 79c4f: 8b 3d b3 84 2f 00 mov 0x2f84b3(%rip),%edi # 372108 0.00 : 79c55: 48 89 da mov %rbx,%rdx 0.00 : 79c58: e8 03 c9 ff ff callq 76560 0.00 : 79c5d: e9 51 f2 ff ff jmpq 78eb3 <_int_malloc+0x93> 0.00 : 79c62: 48 8b 7c 24 28 mov 0x28(%rsp),%rdi 0.00 : 79c67: 48 8b 35 ba aa 2f 00 mov 0x2faaba(%rip),%rsi # 374728 0.00 : 79c6e: 48 83 c7 40 add $0x40,%rdi 0.00 : 79c72: e8 69 ec ff ff callq 788e0 0.00 : 79c77: 48 85 c0 test %rax,%rax 0.00 : 79c7a: 48 89 c1 mov %rax,%rcx 0.00 : 79c7d: 0f 84 dc 00 00 00 je 79d5f <_int_malloc+0xf3f> 0.00 : 79c83: 48 8b 5c 24 20 mov 0x20(%rsp),%rbx 0.00 : 79c88: 48 8d 51 20 lea 0x20(%rcx),%rdx 0.00 : 79c8c: 48 89 68 08 mov %rbp,0x8(%rax) 0.00 : 79c90: 48 89 18 mov %rbx,(%rax) 0.00 : 79c93: 48 8b 40 10 mov 0x10(%rax),%rax 0.00 : 79c97: 48 01 83 70 08 00 00 add %rax,0x870(%rbx) 0.00 : 79c9e: 48 8b 41 10 mov 0x10(%rcx),%rax 0.00 : 79ca2: 48 01 05 e7 aa 2f 00 add %rax,0x2faae7(%rip) # 374790 0.00 : 79ca9: 48 89 53 58 mov %rdx,0x58(%rbx) 0.00 : 79cad: 48 8b 41 10 mov 0x10(%rcx),%rax 0.00 : 79cb1: 48 83 e8 20 sub $0x20,%rax 0.00 : 79cb5: 48 83 c8 01 or $0x1,%rax 0.00 : 79cb9: 48 89 42 08 mov %rax,0x8(%rdx) 0.00 : 79cbd: 49 8d 46 e0 lea -0x20(%r14),%rax 0.00 : 79cc1: 48 8d 50 10 lea 0x10(%rax),%rdx 0.00 : 79cc5: 48 83 f8 1f cmp $0x1f,%rax 0.00 : 79cc9: 49 8d 4c 15 00 lea 0x0(%r13,%rdx,1),%rcx 0.00 : 79cce: 48 c7 41 08 01 00 00 movq $0x1,0x8(%rcx) 0.00 : 79cd5: 00 0.00 : 79cd6: 77 5f ja 79d37 <_int_malloc+0xf17> 0.00 : 79cd8: 48 89 d0 mov %rdx,%rax 0.00 : 79cdb: 48 83 c8 01 or $0x1,%rax 0.00 : 79cdf: 49 89 45 08 mov %rax,0x8(%r13) 0.00 : 79ce3: 48 89 11 mov %rdx,(%rcx) 0.00 : 79ce6: e9 af fe ff ff jmpq 79b9a <_int_malloc+0xd7a> 0.00 : 79ceb: 45 31 ff xor %r15d,%r15d 0.00 : 79cee: e9 6a fd ff ff jmpq 79a5d <_int_malloc+0xc3d> 0.00 : 79cf3: 8b 3d 0f 84 2f 00 mov 0x2f840f(%rip),%edi # 372108 0.00 : 79cf9: 48 8d 35 25 1e 0c 00 lea 0xc1e25(%rip),%rsi # 13bb25 <__PRETTY_FUNCTION__.14063+0xbe> 0.00 : 79d00: 4c 89 fa mov %r15,%rdx 0.00 : 79d03: e8 58 c8 ff ff callq 76560 0.00 : 79d08: e9 28 f9 ff ff jmpq 79635 <_int_malloc+0x815> 0.00 : 79d0d: 48 8b 45 20 mov 0x20(%rbp),%rax 0.00 : 79d11: 48 39 c5 cmp %rax,%rbp 0.00 : 79d14: 74 5f je 79d75 <_int_malloc+0xf55> 0.00 : 79d16: 48 89 43 20 mov %rax,0x20(%rbx) 0.00 : 79d1a: 48 8b 45 28 mov 0x28(%rbp),%rax 0.00 : 79d1e: 48 89 43 28 mov %rax,0x28(%rbx) 0.00 : 79d22: 48 8b 45 20 mov 0x20(%rbp),%rax 0.00 : 79d26: 48 89 58 28 mov %rbx,0x28(%rax) 0.00 : 79d2a: 48 8b 45 28 mov 0x28(%rbp),%rax 0.00 : 79d2e: 48 89 58 20 mov %rbx,0x20(%rax) 0.00 : 79d32: e9 fe f8 ff ff jmpq 79635 <_int_malloc+0x815> 0.00 : 79d37: 48 83 c8 05 or $0x5,%rax 0.00 : 79d3b: 4b c7 44 35 e8 11 00 movq $0x11,-0x18(%r13,%r14,1) 0.00 : 79d42: 00 00 0.00 : 79d44: 4c 89 ee mov %r13,%rsi 0.00 : 79d47: 48 c7 01 10 00 00 00 movq $0x10,(%rcx) 0.00 : 79d4e: 48 89 df mov %rbx,%rdi 0.00 : 79d51: 49 89 45 08 mov %rax,0x8(%r13) 0.00 : 79d55: e8 46 dd ff ff callq 77aa0 <_int_free> 0.00 : 79d5a: e9 3b fe ff ff jmpq 79b9a <_int_malloc+0xd7a> 0.00 : 79d5f: 45 84 ff test %r15b,%r15b 0.00 : 79d62: 0f 84 ba fc ff ff je 79a22 <_int_malloc+0xc02> 0.00 : 79d68: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 79d6f: 00 0.00 : 79d70: e9 25 fe ff ff jmpq 79b9a <_int_malloc+0xd7a> 0.00 : 79d75: 48 89 5b 28 mov %rbx,0x28(%rbx) 0.00 : 79d79: 48 89 5b 20 mov %rbx,0x20(%rbx) 0.00 : 79d7d: 0f 1f 00 nopl (%rax) 0.00 : 79d80: e9 b0 f8 ff ff jmpq 79635 <_int_malloc+0x815> 0.00 : 79d85: 48 89 de mov %rbx,%rsi 0.00 : 79d88: 48 8d 7c 05 00 lea 0x0(%rbp,%rax,1),%rdi 0.00 : 79d8d: ba 03 00 00 00 mov $0x3,%edx 0.00 : 79d92: 48 29 c6 sub %rax,%rsi 0.00 : 79d95: e8 16 df 05 00 callq d7cb0 0.00 : 79d9a: 85 c0 test %eax,%eax 0.00 : 79d9c: 0f 85 c0 fe ff ff jne 79c62 <_int_malloc+0xe42> 0.00 : 79da2: 48 89 5d 18 mov %rbx,0x18(%rbp) 0.00 : 79da6: e9 b8 fd ff ff jmpq 79b63 <_int_malloc+0xd43> 0.00 : 79dab: 45 31 c9 xor %r9d,%r9d 0.00 : 79dae: 31 ff xor %edi,%edi 0.00 : 79db0: 41 b8 ff ff ff ff mov $0xffffffff,%r8d 0.00 : 79db6: b9 22 00 00 00 mov $0x22,%ecx 0.00 : 79dbb: ba 03 00 00 00 mov $0x3,%edx 0.00 : 79dc0: 48 89 ee mov %rbp,%rsi 0.00 : 79dc3: e8 88 de 05 00 callq d7c50 0.00 : 79dc8: 48 83 f8 ff cmp $0xffffffffffffffff,%rax 0.00 : 79dcc: 48 89 c3 mov %rax,%rbx 0.00 : 79dcf: 74 7a je 79e4b <_int_malloc+0x102b> 0.00 : 79dd1: 4c 8d 60 10 lea 0x10(%rax),%r12 0.00 : 79dd5: 41 f6 c4 0f test $0xf,%r12b 0.00 : 79dd9: 74 1f je 79dfa <_int_malloc+0xfda> 0.00 : 79ddb: 48 8d 0d 51 20 0c 00 lea 0xc2051(%rip),%rcx # 13be33 <__func__.13350> 0.00 : 79de2: 48 8d 35 59 1d 0c 00 lea 0xc1d59(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79de9: 48 8d 3d f8 57 0c 00 lea 0xc57f8(%rip),%rdi # 13f5e8 <__PRETTY_FUNCTION__.11129+0x1c0f> 0.00 : 79df0: ba dd 0b 00 00 mov $0xbdd,%edx 0.00 : 79df5: e8 c6 c9 ff ff callq 767c0 <__malloc_assert> 0.00 : 79dfa: 48 89 e8 mov %rbp,%rax 0.00 : 79dfd: 48 83 c8 02 or $0x2,%rax 0.00 : 79e01: 48 89 43 08 mov %rax,0x8(%rbx) 0.00 : 79e05: 8b 05 35 a9 2f 00 mov 0x2fa935(%rip),%eax # 374740 0.00 : 79e0b: 83 c0 01 add $0x1,%eax 0.00 : 79e0e: 3b 05 34 a9 2f 00 cmp 0x2fa934(%rip),%eax # 374748 0.00 : 79e14: 89 05 26 a9 2f 00 mov %eax,0x2fa926(%rip) # 374740 0.00 : 79e1a: 7e 06 jle 79e22 <_int_malloc+0x1002> 0.00 : 79e1c: 89 05 26 a9 2f 00 mov %eax,0x2fa926(%rip) # 374748 0.00 : 79e22: 48 89 e8 mov %rbp,%rax 0.00 : 79e25: 48 03 05 2c a9 2f 00 add 0x2fa92c(%rip),%rax # 374758 0.00 : 79e2c: 48 3b 05 2d a9 2f 00 cmp 0x2fa92d(%rip),%rax # 374760 0.00 : 79e33: 48 89 05 1e a9 2f 00 mov %rax,0x2fa91e(%rip) # 374758 0.00 : 79e3a: 76 07 jbe 79e43 <_int_malloc+0x1023> 0.00 : 79e3c: 48 89 05 1d a9 2f 00 mov %rax,0x2fa91d(%rip) # 374760 0.00 : 79e43: 4c 89 e3 mov %r12,%rbx 0.00 : 79e46: e9 cb fd ff ff jmpq 79c16 <_int_malloc+0xdf6> 0.00 : 79e4b: 48 8b 44 24 20 mov 0x20(%rsp),%rax 0.00 : 79e50: 41 bf 01 00 00 00 mov $0x1,%r15d 0.00 : 79e56: 4c 8b 68 58 mov 0x58(%rax),%r13 0.00 : 79e5a: 49 8b 55 08 mov 0x8(%r13),%rdx 0.00 : 79e5e: 49 89 d6 mov %rdx,%r14 0.00 : 79e61: 49 83 e6 f8 and $0xfffffffffffffff8,%r14 0.00 : 79e65: e9 f3 fb ff ff jmpq 79a5d <_int_malloc+0xc3d> 0.00 : 79e6a: 48 8b 54 24 28 mov 0x28(%rsp),%rdx 0.00 : 79e6f: 48 8b 05 b2 a8 2f 00 mov 0x2fa8b2(%rip),%rax # 374728 0.00 : 79e76: 48 8b 5c 24 40 mov 0x40(%rsp),%rbx 0.00 : 79e7b: 48 8d 44 02 20 lea 0x20(%rdx,%rax,1),%rax 0.00 : 79e80: 8b 15 1e a0 2f 00 mov 0x2fa01e(%rip),%edx # 373ea4 0.00 : 79e86: 48 89 c1 mov %rax,%rcx 0.00 : 79e89: 4c 29 f1 sub %r14,%rcx 0.00 : 79e8c: 83 e2 02 and $0x2,%edx 0.00 : 79e8f: 48 0f 44 c1 cmove %rcx,%rax 0.00 : 79e93: 48 8b 4c 24 40 mov 0x40(%rsp),%rcx 0.00 : 79e98: 48 8d 2c 18 lea (%rax,%rbx,1),%rbp 0.00 : 79e9c: 48 f7 d1 not %rcx 0.00 : 79e9f: 48 21 cd and %rcx,%rbp 0.00 : 79ea2: 48 89 4c 24 70 mov %rcx,0x70(%rsp) 0.00 : 79ea7: 48 85 ed test %rbp,%rbp 0.00 : 79eaa: 49 89 ec mov %rbp,%r12 0.00 : 79ead: 0f 8e 13 03 00 00 jle 7a1c6 <_int_malloc+0x13a6> 0.00 : 79eb3: 48 8b 05 c6 7e 2f 00 mov 0x2f7ec6(%rip),%rax # 371d80 <_DYNAMIC+0x220> 0.00 : 79eba: 48 89 ef mov %rbp,%rdi 0.00 : 79ebd: ff 10 callq *(%rax) 0.00 : 79ebf: 48 85 c0 test %rax,%rax 0.00 : 79ec2: 48 89 c3 mov %rax,%rbx 0.00 : 79ec5: 0f 84 f2 02 00 00 je 7a1bd <_int_malloc+0x139d> 0.00 : 79ecb: 48 8b 05 9e 7f 2f 00 mov 0x2f7f9e(%rip),%rax # 371e70 <_DYNAMIC+0x310> 0.00 : 79ed2: 48 8b 00 mov (%rax),%rax 0.00 : 79ed5: 48 85 c0 test %rax,%rax 0.00 : 79ed8: 74 02 je 79edc <_int_malloc+0x10bc> 0.00 : 79eda: ff d0 callq *%rax 0.00 : 79edc: 45 31 e4 xor %r12d,%r12d 0.00 : 79edf: 41 bf 01 00 00 00 mov $0x1,%r15d 0.00 : 79ee5: 48 83 3d 83 a8 2f 00 cmpq $0x0,0x2fa883(%rip) # 374770 0.00 : 79eec: 00 0.00 : 79eed: 75 07 jne 79ef6 <_int_malloc+0x10d6> 0.00 : 79eef: 48 89 1d 7a a8 2f 00 mov %rbx,0x2fa87a(%rip) # 374770 0.00 : 79ef6: 48 89 ea mov %rbp,%rdx 0.00 : 79ef9: 48 03 15 10 a8 2f 00 add 0x2fa810(%rip),%rdx # 374710 0.00 : 79f00: 45 84 ff test %r15b,%r15b 0.00 : 79f03: 48 89 15 06 a8 2f 00 mov %rdx,0x2fa806(%rip) # 374710 0.00 : 79f0a: 74 0b je 79f17 <_int_malloc+0x10f7> 0.00 : 79f0c: 48 39 5c 24 50 cmp %rbx,0x50(%rsp) 0.00 : 79f11: 0f 84 39 03 00 00 je 7a250 <_int_malloc+0x1430> 0.00 : 79f17: 8b 05 87 9f 2f 00 mov 0x2f9f87(%rip),%eax # 373ea4 0.00 : 79f1d: d1 e8 shr %eax 0.00 : 79f1f: 83 f0 01 xor $0x1,%eax 0.00 : 79f22: 83 e0 01 and $0x1,%eax 0.00 : 79f25: 80 7c 24 5f 00 cmpb $0x0,0x5f(%rsp) 0.00 : 79f2a: 0f 84 5c 01 00 00 je 7a08c <_int_malloc+0x126c> 0.00 : 79f30: 84 c0 test %al,%al 0.00 : 79f32: 0f 84 5c 01 00 00 je 7a094 <_int_malloc+0x1274> 0.00 : 79f38: 48 39 5c 24 50 cmp %rbx,0x50(%rsp) 0.00 : 79f3d: 0f 87 30 01 00 00 ja 7a073 <_int_malloc+0x1253> 0.00 : 79f43: 48 89 d8 mov %rbx,%rax 0.00 : 79f46: 48 2b 44 24 50 sub 0x50(%rsp),%rax 0.00 : 79f4b: 48 01 d0 add %rdx,%rax 0.00 : 79f4e: 48 89 05 bb a7 2f 00 mov %rax,0x2fa7bb(%rip) # 374710 0.00 : 79f55: 48 89 da mov %rbx,%rdx 0.00 : 79f58: 31 c0 xor %eax,%eax 0.00 : 79f5a: 48 89 5c 24 48 mov %rbx,0x48(%rsp) 0.00 : 79f5f: 83 e2 0f and $0xf,%edx 0.00 : 79f62: 74 11 je 79f75 <_int_malloc+0x1155> 0.00 : 79f64: b8 10 00 00 00 mov $0x10,%eax 0.00 : 79f69: 48 29 d0 sub %rdx,%rax 0.00 : 79f6c: 48 8d 0c 03 lea (%rbx,%rax,1),%rcx 0.00 : 79f70: 48 89 4c 24 48 mov %rcx,0x48(%rsp) 0.00 : 79f75: 4a 8d 14 30 lea (%rax,%r14,1),%rdx 0.00 : 79f79: 48 8d 04 2a lea (%rdx,%rbp,1),%rax 0.00 : 79f7d: 48 8d 04 03 lea (%rbx,%rax,1),%rax 0.00 : 79f81: 48 29 c2 sub %rax,%rdx 0.00 : 79f84: 48 03 44 24 40 add 0x40(%rsp),%rax 0.00 : 79f89: 48 23 44 24 70 and 0x70(%rsp),%rax 0.00 : 79f8e: 48 89 d3 mov %rdx,%rbx 0.00 : 79f91: 48 01 c3 add %rax,%rbx 0.00 : 79f94: 79 1f jns 79fb5 <_int_malloc+0x1195> 0.00 : 79f96: 48 8d 0d 96 1e 0c 00 lea 0xc1e96(%rip),%rcx # 13be33 <__func__.13350> 0.00 : 79f9d: 48 8d 35 9e 1b 0c 00 lea 0xc1b9e(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 79fa4: 48 8d 3d f2 1c 0c 00 lea 0xc1cf2(%rip),%rdi # 13bc9d <__PRETTY_FUNCTION__.14063+0x236> 0.00 : 79fab: ba f6 0c 00 00 mov $0xcf6,%edx 0.00 : 79fb0: e8 0b c8 ff ff callq 767c0 <__malloc_assert> 0.00 : 79fb5: 48 8b 2d c4 7d 2f 00 mov 0x2f7dc4(%rip),%rbp # 371d80 <_DYNAMIC+0x220> 0.00 : 79fbc: 48 89 df mov %rbx,%rdi 0.00 : 79fbf: ff 55 00 callq *0x0(%rbp) 0.00 : 79fc2: 48 85 c0 test %rax,%rax 0.00 : 79fc5: 49 89 c4 mov %rax,%r12 0.00 : 79fc8: 0f 84 8b 00 00 00 je 7a059 <_int_malloc+0x1239> 0.00 : 79fce: 48 8b 05 9b 7e 2f 00 mov 0x2f7e9b(%rip),%rax # 371e70 <_DYNAMIC+0x310> 0.00 : 79fd5: 48 8b 00 mov (%rax),%rax 0.00 : 79fd8: 48 85 c0 test %rax,%rax 0.00 : 79fdb: 74 02 je 79fdf <_int_malloc+0x11bf> 0.00 : 79fdd: ff d0 callq *%rax 0.00 : 79fdf: 48 89 da mov %rbx,%rdx 0.00 : 79fe2: 48 8b 44 24 48 mov 0x48(%rsp),%rax 0.00 : 79fe7: 48 8b 4c 24 48 mov 0x48(%rsp),%rcx 0.00 : 79fec: 48 89 05 05 9f 2f 00 mov %rax,0x2f9f05(%rip) # 373ef8 0.00 : 79ff3: 49 8d 04 1c lea (%r12,%rbx,1),%rax 0.00 : 79ff7: 48 2b 44 24 48 sub 0x48(%rsp),%rax 0.00 : 79ffc: 48 83 c8 01 or $0x1,%rax 0.00 : 7a000: 48 89 41 08 mov %rax,0x8(%rcx) 0.00 : 7a004: 48 01 15 05 a7 2f 00 add %rdx,0x2fa705(%rip) # 374710 0.00 : 7a00b: 80 7c 24 5f 00 cmpb $0x0,0x5f(%rsp) 0.00 : 7a010: 0f 84 84 fb ff ff je 79b9a <_int_malloc+0xd7a> 0.00 : 7a016: 49 8d 46 e0 lea -0x20(%r14),%rax 0.00 : 7a01a: 48 83 e0 f0 and $0xfffffffffffffff0,%rax 0.00 : 7a01e: 48 89 c2 mov %rax,%rdx 0.00 : 7a021: 48 83 ca 01 or $0x1,%rdx 0.00 : 7a025: 48 83 f8 1f cmp $0x1f,%rax 0.00 : 7a029: 49 89 55 08 mov %rdx,0x8(%r13) 0.00 : 7a02d: 49 c7 44 05 08 11 00 movq $0x11,0x8(%r13,%rax,1) 0.00 : 7a034: 00 00 0.00 : 7a036: 49 c7 44 05 18 11 00 movq $0x11,0x18(%r13,%rax,1) 0.00 : 7a03d: 00 00 0.00 : 7a03f: 0f 86 55 fb ff ff jbe 79b9a <_int_malloc+0xd7a> 0.00 : 7a045: 48 8d 3d 54 9e 2f 00 lea 0x2f9e54(%rip),%rdi # 373ea0 0.00 : 7a04c: 4c 89 ee mov %r13,%rsi 0.00 : 7a04f: e8 4c da ff ff callq 77aa0 <_int_free> 0.00 : 7a054: e9 41 fb ff ff jmpq 79b9a <_int_malloc+0xd7a> 0.00 : 7a059: 31 ff xor %edi,%edi 0.00 : 7a05b: ff 55 00 callq *0x0(%rbp) 0.00 : 7a05e: 49 89 c4 mov %rax,%r12 0.00 : 7a061: 4d 85 e4 test %r12,%r12 0.00 : 7a064: 0f 84 30 fb ff ff je 79b9a <_int_malloc+0xd7a> 0.00 : 7a06a: 31 db xor %ebx,%ebx 0.00 : 7a06c: 31 d2 xor %edx,%edx 0.00 : 7a06e: e9 6f ff ff ff jmpq 79fe2 <_int_malloc+0x11c2> 0.00 : 7a073: 48 8d 35 0e 58 0c 00 lea 0xc580e(%rip),%rsi # 13f888 <__PRETTY_FUNCTION__.11129+0x1eaf> 0.00 : 7a07a: 48 89 da mov %rbx,%rdx 0.00 : 7a07d: bf 03 00 00 00 mov $0x3,%edi 0.00 : 7a082: e8 d9 c4 ff ff callq 76560 0.00 : 7a087: e9 0e fb ff ff jmpq 79b9a <_int_malloc+0xd7a> 0.00 : 7a08c: 84 c0 test %al,%al 0.00 : 7a08e: 0f 85 c1 fe ff ff jne 79f55 <_int_malloc+0x1135> 0.00 : 7a094: f6 c3 0f test $0xf,%bl 0.00 : 7a097: 90 nop 0.00 : 7a098: 74 1f je 7a0b9 <_int_malloc+0x1299> 0.00 : 7a09a: 48 8d 0d 92 1d 0c 00 lea 0xc1d92(%rip),%rcx # 13be33 <__func__.13350> 0.00 : 7a0a1: 48 8d 35 9a 1a 0c 00 lea 0xc1a9a(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 7a0a8: 48 8d 3d 01 58 0c 00 lea 0xc5801(%rip),%rdi # 13f8b0 <__PRETTY_FUNCTION__.11129+0x1ed7> 0.00 : 7a0af: ba 11 0d 00 00 mov $0xd11,%edx 0.00 : 7a0b4: e8 07 c7 ff ff callq 767c0 <__malloc_assert> 0.00 : 7a0b9: 45 84 ff test %r15b,%r15b 0.00 : 7a0bc: 48 89 5c 24 48 mov %rbx,0x48(%rsp) 0.00 : 7a0c1: 74 9e je 7a061 <_int_malloc+0x1241> 0.00 : 7a0c3: 48 8b 05 b6 7c 2f 00 mov 0x2f7cb6(%rip),%rax # 371d80 <_DYNAMIC+0x220> 0.00 : 7a0ca: 31 ff xor %edi,%edi 0.00 : 7a0cc: ff 10 callq *(%rax) 0.00 : 7a0ce: 48 89 5c 24 48 mov %rbx,0x48(%rsp) 0.00 : 7a0d3: 49 89 c4 mov %rax,%r12 0.00 : 7a0d6: eb 89 jmp 7a061 <_int_malloc+0x1241> 0.00 : 7a0d8: 49 8b 47 20 mov 0x20(%r15),%rax 0.00 : 7a0dc: 48 85 c0 test %rax,%rax 0.00 : 7a0df: 0f 84 72 f6 ff ff je 79757 <_int_malloc+0x937> 0.00 : 7a0e5: 4c 3b 78 28 cmp 0x28(%rax),%r15 0.00 : 7a0e9: 74 1f je 7a10a <_int_malloc+0x12ea> 0.00 : 7a0eb: 48 8d 0d 35 1d 0c 00 lea 0xc1d35(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 7a0f2: 48 8d 35 49 1a 0c 00 lea 0xc1a49(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 7a0f9: 48 8d 3d c0 53 0c 00 lea 0xc53c0(%rip),%rdi # 13f4c0 <__PRETTY_FUNCTION__.11129+0x1ae7> 0.00 : 7a100: ba c9 11 00 00 mov $0x11c9,%edx 0.00 : 7a105: e8 b6 c6 ff ff callq 767c0 <__malloc_assert> 0.00 : 7a10a: 48 8b 45 28 mov 0x28(%rbp),%rax 0.00 : 7a10e: 48 3b 68 20 cmp 0x20(%rax),%rbp 0.00 : 7a112: 74 1f je 7a133 <_int_malloc+0x1313> 0.00 : 7a114: 48 8d 0d 0c 1d 0c 00 lea 0xc1d0c(%rip),%rcx # 13be27 <__func__.14106> 0.00 : 7a11b: 48 8d 35 20 1a 0c 00 lea 0xc1a20(%rip),%rsi # 13bb42 <__PRETTY_FUNCTION__.14063+0xdb> 0.00 : 7a122: 48 8d 3d c7 53 0c 00 lea 0xc53c7(%rip),%rdi # 13f4f0 <__PRETTY_FUNCTION__.11129+0x1b17> 0.00 : 7a129: ba c9 11 00 00 mov $0x11c9,%edx 0.00 : 7a12e: e8 8d c6 ff ff callq 767c0 <__malloc_assert> 0.00 : 7a133: 48 83 7b 20 00 cmpq $0x0,0x20(%rbx) 0.00 : 7a138: 74 37 je 7a171 <_int_malloc+0x1351> 0.00 : 7a13a: 48 8b 55 20 mov 0x20(%rbp),%rdx 0.00 : 7a13e: 48 8b 45 28 mov 0x28(%rbp),%rax 0.00 : 7a142: 48 89 42 28 mov %rax,0x28(%rdx) 0.00 : 7a146: 48 8b 55 28 mov 0x28(%rbp),%rdx 0.00 : 7a14a: 48 8b 45 20 mov 0x20(%rbp),%rax 0.00 : 7a14e: 48 89 42 20 mov %rax,0x20(%rdx) 0.00 : 7a152: e9 00 f6 ff ff jmpq 79757 <_int_malloc+0x937> 0.00 : 7a157: 8b 3d ab 7f 2f 00 mov 0x2f7fab(%rip),%edi # 372108 0.00 : 7a15d: 48 8d 35 c1 19 0c 00 lea 0xc19c1(%rip),%rsi # 13bb25 <__PRETTY_FUNCTION__.14063+0xbe> 0.00 : 7a164: 4c 89 fa mov %r15,%rdx 0.00 : 7a167: e8 f4 c3 ff ff callq 76560 0.00 : 7a16c: e9 e6 f5 ff ff jmpq 79757 <_int_malloc+0x937> 0.00 : 7a171: 48 8b 45 20 mov 0x20(%rbp),%rax 0.00 : 7a175: 48 39 c5 cmp %rax,%rbp 0.00 : 7a178: 74 36 je 7a1b0 <_int_malloc+0x1390> 0.00 : 7a17a: 48 89 43 20 mov %rax,0x20(%rbx) 0.00 : 7a17e: 48 8b 45 28 mov 0x28(%rbp),%rax 0.00 : 7a182: 48 89 43 28 mov %rax,0x28(%rbx) 0.00 : 7a186: 48 8b 45 20 mov 0x20(%rbp),%rax 0.00 : 7a18a: 48 89 58 28 mov %rbx,0x28(%rax) 0.00 : 7a18e: 48 8b 45 28 mov 0x28(%rbp),%rax 0.00 : 7a192: 48 89 58 20 mov %rbx,0x20(%rax) 0.00 : 7a196: e9 bc f5 ff ff jmpq 79757 <_int_malloc+0x937> 0.00 : 7a19b: 49 8b 5f 10 mov 0x10(%r15),%rbx 0.00 : 7a19f: e9 7a f5 ff ff jmpq 7971e <_int_malloc+0x8fe> 0.00 : 7a1a4: 48 8b 58 10 mov 0x10(%rax),%rbx 0.00 : 7a1a8: 49 89 c7 mov %rax,%r15 0.00 : 7a1ab: e9 6e f5 ff ff jmpq 7971e <_int_malloc+0x8fe> 0.00 : 7a1b0: 48 89 5b 28 mov %rbx,0x28(%rbx) 0.00 : 7a1b4: 48 89 5b 20 mov %rbx,0x20(%rbx) 0.00 : 7a1b8: e9 9a f5 ff ff jmpq 79757 <_int_malloc+0x937> 0.00 : 7a1bd: 8b 15 e1 9c 2f 00 mov 0x2f9ce1(%rip),%edx # 373ea4 0.00 : 7a1c3: 83 e2 02 and $0x2,%edx 0.00 : 7a1c6: 85 d2 test %edx,%edx 0.00 : 7a1c8: 75 12 jne 7a1dc <_int_malloc+0x13bc> 0.00 : 7a1ca: 48 8b 54 24 40 mov 0x40(%rsp),%rdx 0.00 : 7a1cf: 49 8d 04 16 lea (%r14,%rdx,1),%rax 0.00 : 7a1d3: 4c 8d 24 28 lea (%rax,%rbp,1),%r12 0.00 : 7a1d7: 4c 23 64 24 70 and 0x70(%rsp),%r12 0.00 : 7a1dc: 49 81 fc ff ff 0f 00 cmp $0xfffff,%r12 0.00 : 7a1e3: bd 00 00 10 00 mov $0x100000,%ebp 0.00 : 7a1e8: 49 0f 47 ec cmova %r12,%rbp 0.00 : 7a1ec: 48 39 6c 24 28 cmp %rbp,0x28(%rsp) 0.00 : 7a1f1: 0f 83 a3 f9 ff ff jae 79b9a <_int_malloc+0xd7a> 0.00 : 7a1f7: 45 31 c9 xor %r9d,%r9d 0.00 : 7a1fa: 31 ff xor %edi,%edi 0.00 : 7a1fc: 41 b8 ff ff ff ff mov $0xffffffff,%r8d 0.00 : 7a202: b9 22 00 00 00 mov $0x22,%ecx 0.00 : 7a207: ba 03 00 00 00 mov $0x3,%edx 0.00 : 7a20c: 48 89 ee mov %rbp,%rsi 0.00 : 7a20f: e8 3c da 05 00 callq d7c50 0.00 : 7a214: 48 83 f8 ff cmp $0xffffffffffffffff,%rax 0.00 : 7a218: 48 89 c3 mov %rax,%rbx 0.00 : 7a21b: 0f 84 79 f9 ff ff je 79b9a <_int_malloc+0xd7a> 0.00 : 7a221: 83 0d 7c 9c 2f 00 02 orl $0x2,0x2f9c7c(%rip) # 373ea4 0.00 : 7a228: 48 85 c0 test %rax,%rax 0.00 : 7a22b: 0f 84 69 f9 ff ff je 79b9a <_int_malloc+0xd7a> 0.00 : 7a231: 49 89 c4 mov %rax,%r12 0.00 : 7a234: 49 01 ec add %rbp,%r12 0.00 : 7a237: 41 0f 94 c7 sete %r15b 0.00 : 7a23b: e9 a5 fc ff ff jmpq 79ee5 <_int_malloc+0x10c5> 0.00 : 7a240: 80 7c 24 5f 00 cmpb $0x0,0x5f(%rsp) 0.00 : 7a245: 0f 84 8b f8 ff ff je 79ad6 <_int_malloc+0xcb6> 0.00 : 7a24b: e9 2a f8 ff ff jmpq 79a7a <_int_malloc+0xc5a> 0.00 : 7a250: 4a 8d 44 35 00 lea 0x0(%rbp,%r14,1),%rax 0.00 : 7a255: 48 83 c8 01 or $0x1,%rax 0.00 : 7a259: 49 89 45 08 mov %rax,0x8(%r13) 0.00 : 7a25d: e9 38 f9 ff ff jmpq 79b9a <_int_malloc+0xd7a> Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /lib/modules/3.0.101-0.15-default/kernel/net/netfilter/xt_state.ko ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/net/netfilter/xt_state.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000000000 : ??:0 100.00 : 0: 0f b6 4f 7c movzbl 0x7c(%rdi),%ecx : 34: 48 8b mul %edx : 36: 87 88 shr %edx : 38: 00 00 00 lea (%rdx,%rdx,2),%edx Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------