Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 39.21 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1073 31.83 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1082 21.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1097 3.24 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1069 1.98 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1075 0.54 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1077 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.18 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1069 3.24 : 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 21.76 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1075 1.98 : 5bbde3: 48 85 db test %rbx,%rbx 0.00 : 5bbde6: 74 58 je 5bbe40 : { : if (hashTuple->hashvalue == hashvalue) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1077 0.54 : 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), /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1082 31.83 : 5bbdee: 49 8b b4 24 d0 00 00 mov 0xd0(%r12),%rsi 0.00 : 5bbdf5: 00 0.18 : 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.18 : 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.36 : 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.18 : 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.18 : 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.18 : 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 39.21 : 5bbe7e: e9 60 ff ff ff jmpq 5bbde3 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 48.93 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:885 34.95 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:881 3.50 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:871 3.50 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:855 1.17 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:883 0.97 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:824 0.97 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:902 0.78 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:888 0.58 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:881 0.58 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:896 0.58 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:855 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.19 : 784056: 41 89 d7 mov %edx,%r15d 0.00 : 784059: 41 56 push %r14 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:824 0.97 : 78405b: 49 89 fe mov %rdi,%r14 0.00 : 78405e: 41 55 push %r13 0.19 : 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.19 : 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.39 : 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.19 : 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) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:871 3.50 : 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.39 : 7840d0: 89 d8 mov %ebx,%eax 0.19 : 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 */ /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:881 0.58 : 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 34.95 : 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.19 : 7840ee: eb 28 jmp 784118 : { : if (currBucket->hashvalue == hashvalue && : match(ELEMENTKEY(currBucket), keyPtr, keysize) == 0) : break; : prevBucketPtr = &(currBucket->link); /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:888 0.78 : 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) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:883 1.17 : 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) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:885 48.93 : 7840ff: 90 nop 0.00 : 784100: 75 ee jne 7840f0 0.19 : 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.39 : 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 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:896 0.58 : 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) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:902 0.97 : 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.39 : 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.19 : 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.39 : 784171: 0f 85 09 01 00 00 jne 784280 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:855 0.58 : 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 3.50 : 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 ---------------------------------------------- 96.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:438 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b43e0 : : */ : TupleTableSlot * : ExecStoreMinimalTuple(MinimalTuple mtup, : TupleTableSlot *slot, : bool shouldFree) : { 0.46 : 5b43e0: 55 push %rbp 0.00 : 5b43e1: 48 89 e5 mov %rsp,%rbp 0.00 : 5b43e4: 48 89 5d e8 mov %rbx,-0x18(%rbp) 0.00 : 5b43e8: 4c 89 65 f0 mov %r12,-0x10(%rbp) 0.00 : 5b43ec: 48 89 f3 mov %rsi,%rbx 0.00 : 5b43ef: 4c 89 6d f8 mov %r13,-0x8(%rbp) 0.00 : 5b43f3: 48 83 ec 20 sub $0x20,%rsp : Assert(slot->tts_tupleDescriptor != NULL); : : /* : * Free any old physical tuple belonging to the slot. : */ : if (slot->tts_shouldFree) 0.00 : 5b43f7: 80 7e 05 00 cmpb $0x0,0x5(%rsi) : */ : TupleTableSlot * : ExecStoreMinimalTuple(MinimalTuple mtup, : TupleTableSlot *slot, : bool shouldFree) : { 0.46 : 5b43fb: 49 89 fc mov %rdi,%r12 0.00 : 5b43fe: 41 89 d5 mov %edx,%r13d : Assert(slot->tts_tupleDescriptor != NULL); : : /* : * Free any old physical tuple belonging to the slot. : */ : if (slot->tts_shouldFree) 0.46 : 5b4401: 75 6d jne 5b4470 : heap_freetuple(slot->tts_tuple); : if (slot->tts_shouldFreeMin) 0.00 : 5b4403: 80 7b 06 00 cmpb $0x0,0x6(%rbx) 0.00 : 5b4407: 75 57 jne 5b4460 : heap_free_minimal_tuple(slot->tts_mintuple); : : /* : * Drop the pin on the referenced buffer, if there is one. : */ : if (BufferIsValid(slot->tts_buffer)) 0.00 : 5b4409: 8b 7b 20 mov 0x20(%rbx),%edi 0.00 : 5b440c: 85 ff test %edi,%edi 0.00 : 5b440e: 74 05 je 5b4415 : ReleaseBuffer(slot->tts_buffer); 0.00 : 5b4410: e8 4b 0a 0c 00 callq 674e60 : * Store the new tuple into the specified slot. : */ : slot->tts_isempty = false; : slot->tts_shouldFree = false; : slot->tts_shouldFreeMin = shouldFree; : slot->tts_tuple = &slot->tts_minhdr; 0.00 : 5b4415: 48 8d 43 40 lea 0x40(%rbx),%rax : /* : * Store the new tuple into the specified slot. : */ : slot->tts_isempty = false; : slot->tts_shouldFree = false; : slot->tts_shouldFreeMin = shouldFree; 0.00 : 5b4419: 44 88 6b 06 mov %r13b,0x6(%rbx) : slot->tts_tuple = &slot->tts_minhdr; : slot->tts_mintuple = mtup; 0.46 : 5b441d: 4c 89 63 38 mov %r12,0x38(%rbx) : * Drop the pin on the referenced buffer, if there is one. : */ : if (BufferIsValid(slot->tts_buffer)) : ReleaseBuffer(slot->tts_buffer); : : slot->tts_buffer = InvalidBuffer; 0.00 : 5b4421: c7 43 20 00 00 00 00 movl $0x0,0x20(%rbx) : : /* : * Store the new tuple into the specified slot. : */ : slot->tts_isempty = false; 0.00 : 5b4428: c6 43 04 00 movb $0x0,0x4(%rbx) : slot->tts_shouldFree = false; 0.00 : 5b442c: c6 43 05 00 movb $0x0,0x5(%rbx) : slot->tts_shouldFreeMin = shouldFree; : slot->tts_tuple = &slot->tts_minhdr; 0.00 : 5b4430: 48 89 43 08 mov %rax,0x8(%rbx) : slot->tts_mintuple = mtup; : : slot->tts_minhdr.t_len = mtup->t_len + MINIMAL_TUPLE_OFFSET; 0.00 : 5b4434: 41 8b 04 24 mov (%r12),%eax : : /* Mark extracted state invalid */ : slot->tts_nvalid = 0; : : return slot; : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:438 96.35 : 5b4438: 4c 8b 6d f8 mov -0x8(%rbp),%r13 : slot->tts_minhdr.t_len = mtup->t_len + MINIMAL_TUPLE_OFFSET; : slot->tts_minhdr.t_data = (HeapTupleHeader) ((char *) mtup - MINIMAL_TUPLE_OFFSET); : /* no need to set t_self or t_tableOid since we won't allow access */ : : /* Mark extracted state invalid */ : slot->tts_nvalid = 0; 0.00 : 5b443c: c7 43 24 00 00 00 00 movl $0x0,0x24(%rbx) : slot->tts_shouldFree = false; : slot->tts_shouldFreeMin = shouldFree; : slot->tts_tuple = &slot->tts_minhdr; : slot->tts_mintuple = mtup; : : slot->tts_minhdr.t_len = mtup->t_len + MINIMAL_TUPLE_OFFSET; 0.00 : 5b4443: 83 c0 08 add $0x8,%eax 0.46 : 5b4446: 89 43 40 mov %eax,0x40(%rbx) : slot->tts_minhdr.t_data = (HeapTupleHeader) ((char *) mtup - MINIMAL_TUPLE_OFFSET); 0.46 : 5b4449: 49 8d 44 24 f8 lea -0x8(%r12),%rax : : /* Mark extracted state invalid */ : slot->tts_nvalid = 0; : : return slot; : } 0.00 : 5b444e: 4c 8b 65 f0 mov -0x10(%rbp),%r12 : slot->tts_shouldFreeMin = shouldFree; : slot->tts_tuple = &slot->tts_minhdr; : slot->tts_mintuple = mtup; : : slot->tts_minhdr.t_len = mtup->t_len + MINIMAL_TUPLE_OFFSET; : slot->tts_minhdr.t_data = (HeapTupleHeader) ((char *) mtup - MINIMAL_TUPLE_OFFSET); 0.00 : 5b4452: 48 89 43 50 mov %rax,0x50(%rbx) : : /* Mark extracted state invalid */ : slot->tts_nvalid = 0; : : return slot; : } 0.46 : 5b4456: 48 89 d8 mov %rbx,%rax 0.46 : 5b4459: 48 8b 5d e8 mov -0x18(%rbp),%rbx 0.00 : 5b445d: c9 leaveq 0.00 : 5b445e: c3 retq 0.00 : 5b445f: 90 nop : * 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 : 5b4460: 48 8b 7b 38 mov 0x38(%rbx),%rdi 0.00 : 5b4464: e8 47 a8 eb ff callq 46ecb0 0.00 : 5b4469: eb 9e jmp 5b4409 0.00 : 5b446b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : : /* : * Free any old physical tuple belonging to the slot. : */ : if (slot->tts_shouldFree) : heap_freetuple(slot->tts_tuple); 0.00 : 5b4470: 48 8b 7e 08 mov 0x8(%rsi),%rdi 0.00 : 5b4474: e8 47 a8 eb ff callq 46ecc0 0.00 : 5b4479: eb 88 jmp 5b4403 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 24.14 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 10.34 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 6.21 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1087 4.83 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 4.14 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1097 3.45 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1097 3.45 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 3.45 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1139 2.76 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 2.76 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 2.76 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1099 2.76 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1120 2.76 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1112 2.07 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1049 2.07 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1083 2.07 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 1.38 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1087 1.38 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1083 1.38 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 1.38 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1137 1.38 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1140 1.38 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 1.38 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1140 1.38 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1067 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1055 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1068 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1095 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1138 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1140 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1107 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1120 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1123 0.69 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 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) : { /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1049 2.07 : 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 0.00 : 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 0.00 : 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 0.00 : 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; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1067 0.69 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1055 0.69 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1068 0.69 : 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; 0.00 : 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++) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1083 2.07 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1087 1.38 : 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++) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1083 1.38 : 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]; 0.00 : 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)) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1087 6.21 : 46efc3: 75 bb jne 46ef80 : continue; : } : : isnull[attnum] = false; : : if (!slow && thisatt->attcacheoff >= 0) 0.00 : 46efc5: 40 84 ff test %dil,%dil : isnull[attnum] = true; : slow = true; /* can't use attcacheoff anymore */ : continue; : } : : isnull[attnum] = false; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1095 0.69 : 46efc8: 41 c6 04 33 00 movb $0x0,(%r11,%rsi,1) : : if (!slow && thisatt->attcacheoff >= 0) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1097 4.14 : 46efcd: 0f 85 7d 00 00 00 jne 46f050 0.00 : 46efd3: 8b 42 54 mov 0x54(%rdx),%eax 3.45 : 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); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 3.45 : 46efdd: 80 7a 5c 00 cmpb $0x0,0x5c(%rdx) 1.38 : 46efe1: 49 8d 44 1d 00 lea 0x0(%r13,%rbx,1),%rax 2.76 : 46efe6: 74 28 je 46f010 0.69 : 46efe8: 0f b7 42 4c movzwl 0x4c(%rdx),%eax 0.69 : 46efec: 66 83 f8 08 cmp $0x8,%ax 0.00 : 46eff0: 0f 84 3a 01 00 00 je 46f130 0.69 : 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 4.83 : 46f010: 48 8b 4d d0 mov -0x30(%rbp),%rcx 2.76 : 46f014: 48 89 04 f1 mov %rax,(%rcx,%rsi,8) : : off = att_addlength_pointer(off, thisatt->attlen, tp + off); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 10.34 : 46f018: 0f b7 42 4c movzwl 0x4c(%rdx),%eax 0.00 : 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; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1138 0.69 : 46f034: 49 89 5e 58 mov %rbx,0x58(%r14) : } : : /* : * Save state for next execution : */ : slot->tts_nvalid = attnum; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1137 1.38 : 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 3.45 : 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 1.38 : 46f047: 41 5d pop %r13 0.00 : 46f049: 41 5e pop %r14 0.69 : 46f04b: 41 5f pop %r15 0.00 : 46f04d: c9 leaveq 0.00 : 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) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1099 2.76 : 46f055: 74 71 je 46f0c8 : } : } : else : { : /* not varlena, so safe to use att_align_nominal */ : off = att_align_nominal(off, thisatt->attalign); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1120 2.76 : 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 1.38 : 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 && /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1107 0.69 : 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) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1112 2.76 : 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; : } /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1140 1.38 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1120 0.69 : 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 2.07 : 46f190: 41 8b 44 1d 00 mov 0x0(%r13,%rbx,1),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1126 24.14 : 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; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1123 0.69 : 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); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1128 0.69 : 46f1d0: d0 e8 shr %al 0.00 : 46f1d2: 0f b6 c0 movzbl %al,%eax 1.38 : 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 /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 42.96 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:181 6.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:236 4.44 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:216 4.44 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:175 3.70 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:236 3.70 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:175 2.96 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:81 2.96 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:226 2.22 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:81 2.22 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:96 2.22 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:181 1.48 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:216 1.48 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:94 1.48 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:216 1.48 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:94 1.48 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:190 1.48 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:216 1.48 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:177 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:81 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:81 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:83 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:226 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:236 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:236 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:94 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:96 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:108 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:108 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:129 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:127 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:236 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:226 0.74 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:170 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006fbc00 : : #endif : : static int : MatchText(char *t, int tlen, char *p, int plen, : pg_locale_t locale, bool locale_is_c) : { /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:81 0.74 : 6fbc00: 55 push %rbp 2.22 : 6fbc01: 48 89 e5 mov %rsp,%rbp 0.00 : 6fbc04: 41 57 push %r15 0.74 : 6fbc06: 41 56 push %r14 2.96 : 6fbc08: 41 55 push %r13 0.00 : 6fbc0a: 41 54 push %r12 0.00 : 6fbc0c: 53 push %rbx 0.00 : 6fbc0d: 48 83 ec 18 sub $0x18,%rsp : /* Fast path for match-everything pattern */ : if (plen == 1 && *p == '%') 0.00 : 6fbc11: 83 f9 01 cmp $0x1,%ecx : #endif : : static int : MatchText(char *t, int tlen, char *p, int plen, : pg_locale_t locale, bool locale_is_c) : { 0.00 : 6fbc14: 4c 89 45 d0 mov %r8,-0x30(%rbp) : /* Fast path for match-everything pattern */ : if (plen == 1 && *p == '%') /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:83 0.74 : 6fbc18: 0f 84 82 00 00 00 je 6fbca0 0.00 : 6fbc1e: 66 90 xchg %ax,%ax : * on character boundaries. And we know that no backend-legal : * encoding allows ASCII characters such as '%' to appear as non-first : * bytes of characters, so we won't mistakenly detect a new wildcard. : */ : NextByte(t, tlen); : NextByte(p, plen); /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:216 1.48 : 6fbc20: 48 83 c7 01 add $0x1,%rdi : * occasions it is safe to advance by byte, as the text and pattern will : * be in lockstep. This allows us to perform all comparisons between the : * text and pattern on a byte by byte basis, even for multi-byte : * encodings. : */ : while (tlen > 0 && plen > 0) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:94 1.48 : 6fbc24: 85 f6 test %esi,%esi : * on character boundaries. And we know that no backend-legal : * encoding allows ASCII characters such as '%' to appear as non-first : * bytes of characters, so we won't mistakenly detect a new wildcard. : */ : NextByte(t, tlen); : NextByte(p, plen); 0.00 : 6fbc26: 89 f3 mov %esi,%ebx /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:216 1.48 : 6fbc28: 4c 8d 67 ff lea -0x1(%rdi),%r12 : * occasions it is safe to advance by byte, as the text and pattern will : * be in lockstep. This allows us to perform all comparisons between the : * text and pattern on a byte by byte basis, even for multi-byte : * encodings. : */ : while (tlen > 0 && plen > 0) 0.00 : 6fbc2c: 0f 9f c0 setg %al /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:94 1.48 : 6fbc2f: 7f 1f jg 6fbc50 : */ : NextByte(t, tlen); : NextByte(p, plen); : } : : if (tlen > 0) 0.00 : 6fbc31: 84 c0 test %al,%al 0.00 : 6fbc33: 0f 84 e3 00 00 00 je 6fbd1c : : /* : * End of text, but perhaps not of pattern. Match iff the remaining : * pattern can match a zero-length string, ie, it's zero or more %'s. : */ : while (plen > 0 && *p == '%') /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:226 0.74 : 6fbc39: 31 c0 xor %eax,%eax : /* : * End of text with no match, so no point in trying later places to start : * matching this pattern. : */ : return LIKE_ABORT; : } /* MatchText() */ 0.00 : 6fbc3b: 48 83 c4 18 add $0x18,%rsp /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:236 0.74 : 6fbc3f: 5b pop %rbx 0.00 : 6fbc40: 41 5c pop %r12 0.74 : 6fbc42: 41 5d pop %r13 0.00 : 6fbc44: 41 5e pop %r14 0.00 : 6fbc46: 41 5f pop %r15 0.00 : 6fbc48: c9 leaveq 0.00 : 6fbc49: c3 retq 0.00 : 6fbc4a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * occasions it is safe to advance by byte, as the text and pattern will : * be in lockstep. This allows us to perform all comparisons between the : * text and pattern on a byte by byte basis, even for multi-byte : * encodings. : */ : while (tlen > 0 && plen > 0) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:94 0.74 : 6fbc50: 85 c9 test %ecx,%ecx 0.00 : 6fbc52: 7e dd jle 6fbc31 : { : if (*p == '\\') /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:96 2.22 : 6fbc54: 0f b6 02 movzbl (%rdx),%eax 0.74 : 6fbc57: 3c 5c cmp $0x5c,%al 0.00 : 6fbc59: 74 25 je 6fbc80 : (errcode(ERRCODE_INVALID_ESCAPE_SEQUENCE), : errmsg("LIKE pattern must not end with escape character"))); : if (GETCHAR(*p) != GETCHAR(*t)) : return LIKE_FALSE; : } : else if (*p == '%') /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:108 0.74 : 6fbc5b: 3c 25 cmp $0x25,%al 0.00 : 6fbc5d: 0f 1f 00 nopl (%rax) 0.74 : 6fbc60: 74 5e je 6fbcc0 : * End of text with no match, so no point in trying later places : * to start matching this pattern. : */ : return LIKE_ABORT; : } : else if (*p == '_') /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:190 1.48 : 6fbc62: 3c 5f cmp $0x5f,%al 0.00 : 6fbc64: 74 05 je 6fbc6b : /* _ matches any single character, and we know there is one */ : NextChar(t, tlen); : NextByte(p, plen); : continue; : } : else if (GETCHAR(*p) != GETCHAR(*t)) 0.00 : 6fbc66: 3a 47 ff cmp -0x1(%rdi),%al 0.00 : 6fbc69: 75 ce jne 6fbc39 : * on character boundaries. And we know that no backend-legal : * encoding allows ASCII characters such as '%' to appear as non-first : * bytes of characters, so we won't mistakenly detect a new wildcard. : */ : NextByte(t, tlen); : NextByte(p, plen); /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:216 4.44 : 6fbc6b: 48 83 c2 01 add $0x1,%rdx 1.48 : 6fbc6f: 83 e9 01 sub $0x1,%ecx 0.00 : 6fbc72: 83 ee 01 sub $0x1,%esi 0.00 : 6fbc75: eb a9 jmp 6fbc20 0.00 : 6fbc77: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 6fbc7e: 00 00 : while (tlen > 0 && plen > 0) : { : if (*p == '\\') : { : /* Next pattern byte must match literally, whatever it is */ : NextByte(p, plen); 0.00 : 6fbc80: 83 e9 01 sub $0x1,%ecx : /* ... and there had better be one, per SQL standard */ : if (plen <= 0) 0.00 : 6fbc83: 85 c9 test %ecx,%ecx 0.00 : 6fbc85: 0f 8e 1f 01 00 00 jle 6fbdaa : while (tlen > 0 && plen > 0) : { : if (*p == '\\') : { : /* Next pattern byte must match literally, whatever it is */ : NextByte(p, plen); 0.00 : 6fbc8b: 48 83 c2 01 add $0x1,%rdx : /* ... and there had better be one, per SQL standard */ : if (plen <= 0) : ereport(ERROR, : (errcode(ERRCODE_INVALID_ESCAPE_SEQUENCE), : errmsg("LIKE pattern must not end with escape character"))); : if (GETCHAR(*p) != GETCHAR(*t)) 0.00 : 6fbc8f: 0f b6 02 movzbl (%rdx),%eax 0.00 : 6fbc92: 3a 47 ff cmp -0x1(%rdi),%al 0.00 : 6fbc95: 74 d4 je 6fbc6b 0.00 : 6fbc97: eb a0 jmp 6fbc39 0.00 : 6fbc99: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : static int : MatchText(char *t, int tlen, char *p, int plen, : pg_locale_t locale, bool locale_is_c) : { : /* Fast path for match-everything pattern */ : if (plen == 1 && *p == '%') 0.00 : 6fbca0: 80 3a 25 cmpb $0x25,(%rdx) 0.00 : 6fbca3: 0f 85 77 ff ff ff jne 6fbc20 : /* : * End of text with no match, so no point in trying later places to start : * matching this pattern. : */ : return LIKE_ABORT; : } /* MatchText() */ 0.00 : 6fbca9: 48 83 c4 18 add $0x18,%rsp : : /* : * End of text, but perhaps not of pattern. Match iff the remaining : * pattern can match a zero-length string, ie, it's zero or more %'s. : */ : while (plen > 0 && *p == '%') 0.00 : 6fbcad: b8 01 00 00 00 mov $0x1,%eax : /* : * End of text with no match, so no point in trying later places to start : * matching this pattern. : */ : return LIKE_ABORT; : } /* MatchText() */ 0.00 : 6fbcb2: 5b pop %rbx 0.00 : 6fbcb3: 41 5c pop %r12 0.00 : 6fbcb5: 41 5d pop %r13 0.00 : 6fbcb7: 41 5e pop %r14 0.00 : 6fbcb9: 41 5f pop %r15 0.00 : 6fbcbb: c9 leaveq 0.00 : 6fbcbc: c3 retq 0.00 : 6fbcbd: 0f 1f 00 nopl (%rax) : * fragment that begins with a literal character-to-match, thereby : * not recursing more than we have to. : */ : NextByte(p, plen); : : while (plen > 0) 0.00 : 6fbcc0: 8d 41 ff lea -0x1(%rcx),%eax 0.00 : 6fbcc3: 85 c0 test %eax,%eax 0.00 : 6fbcc5: 7e e2 jle 6fbca9 0.00 : 6fbcc7: 8d 41 fe lea -0x2(%rcx),%eax 0.00 : 6fbcca: 48 83 c2 02 add $0x2,%rdx 0.00 : 6fbcce: 66 90 xchg %ax,%ax : { : if (*p == '%') /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:129 0.74 : 6fbcd0: 44 0f b6 6a ff movzbl -0x1(%rdx),%r13d : * fragment that begins with a literal character-to-match, thereby : * not recursing more than we have to. : */ : NextByte(p, plen); : : while (plen > 0) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:127 0.74 : 6fbcd5: 4c 8d 7a ff lea -0x1(%rdx),%r15 0.00 : 6fbcd9: 44 8d 70 01 lea 0x1(%rax),%r14d : { : if (*p == '%') 0.00 : 6fbcdd: 89 c1 mov %eax,%ecx 0.00 : 6fbcdf: 41 80 fd 25 cmp $0x25,%r13b 0.00 : 6fbce3: 74 13 je 6fbcf8 : NextByte(p, plen); : else if (*p == '_') 0.00 : 6fbce5: 41 80 fd 5f cmp $0x5f,%r13b 0.00 : 6fbce9: 75 5c jne 6fbd47 : { : /* If not enough text left to match the pattern, ABORT */ : if (tlen <= 0) 0.00 : 6fbceb: 85 db test %ebx,%ebx 0.00 : 6fbced: 7e 19 jle 6fbd08 : return LIKE_ABORT; : NextChar(t, tlen); 0.00 : 6fbcef: 49 83 c4 01 add $0x1,%r12 0.00 : 6fbcf3: 83 eb 01 sub $0x1,%ebx 0.00 : 6fbcf6: 89 c1 mov %eax,%ecx 0.00 : 6fbcf8: 83 e8 01 sub $0x1,%eax 0.00 : 6fbcfb: 48 83 c2 01 add $0x1,%rdx : * fragment that begins with a literal character-to-match, thereby : * not recursing more than we have to. : */ : NextByte(p, plen); : : while (plen > 0) 0.00 : 6fbcff: 85 c9 test %ecx,%ecx 0.00 : 6fbd01: 7f cd jg 6fbcd0 0.00 : 6fbd03: eb a4 jmp 6fbca9 0.00 : 6fbd05: 0f 1f 00 nopl (%rax) : /* : * End of text with no match, so no point in trying later places to start : * matching this pattern. : */ : return LIKE_ABORT; : } /* MatchText() */ /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:236 6.67 : 6fbd08: 48 83 c4 18 add $0x18,%rsp : : /* : * End of text, but perhaps not of pattern. Match iff the remaining : * pattern can match a zero-length string, ie, it's zero or more %'s. : */ : while (plen > 0 && *p == '%') /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:226 2.96 : 6fbd0c: b8 ff ff ff ff mov $0xffffffff,%eax : /* : * End of text with no match, so no point in trying later places to start : * matching this pattern. : */ : return LIKE_ABORT; : } /* MatchText() */ 0.00 : 6fbd11: 5b pop %rbx /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:236 3.70 : 6fbd12: 41 5c pop %r12 0.00 : 6fbd14: 41 5d pop %r13 0.74 : 6fbd16: 41 5e pop %r14 0.00 : 6fbd18: 41 5f pop %r15 0.00 : 6fbd1a: c9 leaveq 0.00 : 6fbd1b: c3 retq : : /* : * End of text, but perhaps not of pattern. Match iff the remaining : * pattern can match a zero-length string, ie, it's zero or more %'s. : */ : while (plen > 0 && *p == '%') /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:226 0.74 : 6fbd1c: 85 c9 test %ecx,%ecx 0.00 : 6fbd1e: 7e 89 jle 6fbca9 0.00 : 6fbd20: 80 3a 25 cmpb $0x25,(%rdx) 0.00 : 6fbd23: 74 14 je 6fbd39 0.00 : 6fbd25: 0f 1f 00 nopl (%rax) 0.00 : 6fbd28: eb de jmp 6fbd08 0.00 : 6fbd2a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : NextByte(p, plen); 0.00 : 6fbd30: 48 83 c2 01 add $0x1,%rdx : : /* : * End of text, but perhaps not of pattern. Match iff the remaining : * pattern can match a zero-length string, ie, it's zero or more %'s. : */ : while (plen > 0 && *p == '%') 0.00 : 6fbd34: 80 3a 25 cmpb $0x25,(%rdx) 0.00 : 6fbd37: 75 cf jne 6fbd08 : NextByte(p, plen); 0.00 : 6fbd39: 83 e9 01 sub $0x1,%ecx : : /* : * End of text, but perhaps not of pattern. Match iff the remaining : * pattern can match a zero-length string, ie, it's zero or more %'s. : */ : while (plen > 0 && *p == '%') 0.00 : 6fbd3c: 85 c9 test %ecx,%ecx 0.00 : 6fbd3e: 66 90 xchg %ax,%ax 0.00 : 6fbd40: 7f ee jg 6fbd30 0.00 : 6fbd42: e9 62 ff ff ff jmpq 6fbca9 : * the first pattern byte to each text byte to avoid recursing : * more than we have to. This fact also guarantees that we don't : * have to consider a match to the zero-length substring at the : * end of the text. : */ : if (*p == '\\') 0.00 : 6fbd47: 41 80 fd 5c cmp $0x5c,%r13b 0.00 : 6fbd4b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 6fbd50: 75 11 jne 6fbd63 : { : if (plen < 2) 0.00 : 6fbd52: 41 83 fe 01 cmp $0x1,%r14d 0.00 : 6fbd56: 66 90 xchg %ax,%ax 0.00 : 6fbd58: 0f 84 96 00 00 00 je 6fbdf4 : ereport(ERROR, : (errcode(ERRCODE_INVALID_ESCAPE_SEQUENCE), : errmsg("LIKE pattern must not end with escape character"))); : firstpat = GETCHAR(p[1]); 0.00 : 6fbd5e: 45 0f b6 6f 01 movzbl 0x1(%r15),%r13d : } : else : firstpat = GETCHAR(*p); : : while (tlen > 0) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:170 0.74 : 6fbd63: 85 db test %ebx,%ebx 0.00 : 6fbd65: 7e a1 jle 6fbd08 : { : if (GETCHAR(*t) == firstpat) : { : int matched = MatchText(t, tlen, p, plen, : locale, locale_is_c); 0.00 : 6fbd67: 45 0f be c9 movsbl %r9b,%r9d 0.00 : 6fbd6b: 44 89 4d cc mov %r9d,-0x34(%rbp) 0.00 : 6fbd6f: eb 12 jmp 6fbd83 0.00 : 6fbd71: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : : if (matched != LIKE_FALSE) : return matched; /* TRUE or ABORT */ : } : : NextChar(t, tlen); /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:181 42.96 : 6fbd78: 83 eb 01 sub $0x1,%ebx : firstpat = GETCHAR(p[1]); : } : else : firstpat = GETCHAR(*p); : : while (tlen > 0) 0.00 : 6fbd7b: 85 db test %ebx,%ebx 0.00 : 6fbd7d: 7e 89 jle 6fbd08 : : if (matched != LIKE_FALSE) : return matched; /* TRUE or ABORT */ : } : : NextChar(t, tlen); /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:181 2.22 : 6fbd7f: 49 83 c4 01 add $0x1,%r12 : else : firstpat = GETCHAR(*p); : : while (tlen > 0) : { : if (GETCHAR(*t) == firstpat) 0.00 : 6fbd83: 45 3a 2c 24 cmp (%r12),%r13b 0.00 : 6fbd87: 75 ef jne 6fbd78 : { : int matched = MatchText(t, tlen, p, plen, : locale, locale_is_c); /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:175 3.70 : 6fbd89: 44 8b 4d cc mov -0x34(%rbp),%r9d 4.44 : 6fbd8d: 4c 8b 45 d0 mov -0x30(%rbp),%r8 0.00 : 6fbd91: 44 89 f1 mov %r14d,%ecx 0.00 : 6fbd94: 4c 89 fa mov %r15,%rdx 0.00 : 6fbd97: 89 de mov %ebx,%esi 0.00 : 6fbd99: 4c 89 e7 mov %r12,%rdi 0.00 : 6fbd9c: e8 5f fe ff ff callq 6fbc00 : : if (matched != LIKE_FALSE) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like_match.c:177 1.48 : 6fbda1: 85 c0 test %eax,%eax 0.00 : 6fbda3: 74 d3 je 6fbd78 0.00 : 6fbda5: e9 91 fe ff ff jmpq 6fbc3b : { : /* Next pattern byte must match literally, whatever it is */ : NextByte(p, plen); : /* ... and there had better be one, per SQL standard */ : if (plen <= 0) : ereport(ERROR, 0.00 : 6fbdaa: 45 31 c0 xor %r8d,%r8d 0.00 : 6fbdad: b9 5f 2f 8c 00 mov $0x8c2f5f,%ecx 0.00 : 6fbdb2: ba 68 00 00 00 mov $0x68,%edx : * end of the text. : */ : if (*p == '\\') : { : if (plen < 2) : ereport(ERROR, 0.00 : 6fbdb7: be 12 2e 8c 00 mov $0x8c2e12,%esi 0.00 : 6fbdbc: bf 14 00 00 00 mov $0x14,%edi 0.00 : 6fbdc1: e8 fa ec 07 00 callq 77aac0 0.00 : 6fbdc6: 84 c0 test %al,%al 0.00 : 6fbdc8: 75 05 jne 6fbdcf 0.00 : 6fbdca: e8 01 d7 d6 ff callq 4694d0 0.00 : 6fbdcf: bf 40 2e 8c 00 mov $0x8c2e40,%edi 0.00 : 6fbdd4: 31 c0 xor %eax,%eax 0.00 : 6fbdd6: e8 c5 0a 08 00 callq 77c8a0 0.00 : 6fbddb: bf 82 00 08 05 mov $0x5080082,%edi 0.00 : 6fbde0: 89 c3 mov %eax,%ebx 0.00 : 6fbde2: e8 69 0f 08 00 callq 77cd50 0.00 : 6fbde7: 89 de mov %ebx,%esi 0.00 : 6fbde9: 89 c7 mov %eax,%edi 0.00 : 6fbdeb: 31 c0 xor %eax,%eax 0.00 : 6fbded: e8 ee e7 07 00 callq 77a5e0 0.00 : 6fbdf2: eb d6 jmp 6fbdca 0.00 : 6fbdf4: 45 31 c0 xor %r8d,%r8d 0.00 : 6fbdf7: b9 5f 2f 8c 00 mov $0x8c2f5f,%ecx 0.00 : 6fbdfc: ba a4 00 00 00 mov $0xa4,%edx 0.00 : 6fbe01: eb b4 jmp 6fbdb7 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 24.71 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1206 7.06 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 7.06 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1240 3.53 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 3.53 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1226 3.53 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 3.53 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1240 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1164 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1164 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1215 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1215 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1226 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1226 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1178 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1235 2.35 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1241 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1158 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1176 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1206 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1215 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1215 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1226 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1178 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1179 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1179 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 1.18 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1240 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) : { 0.00 : 46f400: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 2.35 : 46f401: 48 89 e5 mov %rsp,%rbp 1.18 : 46f404: 48 89 5d e0 mov %rbx,-0x20(%rbp) 1.18 : 46f408: 4c 89 65 e8 mov %r12,-0x18(%rbp) 3.53 : 46f40c: 48 89 fb mov %rdi,%rbx 2.35 : 46f40f: 4c 89 6d f0 mov %r13,-0x10(%rbp) 0.00 : 46f413: 4c 89 75 f8 mov %r14,-0x8(%rbp) 1.18 : 46f417: 48 83 ec 20 sub $0x20,%rsp : HeapTupleHeader tup; : : /* : * system attributes are handled by heap_getsysattr : */ : if (attnum <= 0) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1164 2.35 : 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) : { /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1156 2.35 : 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; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1158 1.18 : 46f424: 48 8b 53 10 mov 0x10(%rbx),%rdx : HeapTupleHeader tup; : : /* : * system attributes are handled by heap_getsysattr : */ : if (attnum <= 0) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1164 2.35 : 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 1.18 : 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)) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1206 1.18 : 46f444: 0f b7 47 12 movzwl 0x12(%rdi),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1206 24.71 : 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)) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1215 2.35 : 46f451: f6 47 14 01 testb $0x1,0x14(%rdi) 2.35 : 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 1.18 : 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 1.18 : 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) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1226 1.18 : 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 2.35 : 46f47a: 4a 8b 04 f0 mov (%rax,%r14,8),%rax 2.35 : 46f47e: 80 78 61 00 cmpb $0x0,0x61(%rax) 3.53 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1178 1.18 : 46f49f: 0f b6 44 10 ff movzbl -0x1(%rax,%rdx,1),%eax 2.35 : 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 1.18 : 46f4a8: 48 8b 43 28 mov 0x28(%rbx),%rax 1.18 : 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 2.35 : 46f4b5: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 3.53 : 46f4ba: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 46f4bf: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 7.06 : 46f4c4: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1242 1.18 : 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); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1235 2.35 : 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]; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1240 3.53 : 46f508: 48 8b 43 30 mov 0x30(%rbx),%rax 1.18 : 46f50c: 42 0f b6 44 28 ff movzbl -0x1(%rax,%r13,1),%eax /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1240 7.06 : 46f512: 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:1241 2.35 : 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 ---------------------------------------------- 80.52 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:924 3.90 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1099 2.60 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:918 2.60 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:924 2.60 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 1.30 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:918 1.30 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:918 1.30 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:924 1.30 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1028 1.30 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1103 1.30 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1103 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 1.30 : 7a5750: 55 push %rbp 0.00 : 7a5751: 48 89 e5 mov %rsp,%rbp 1.30 : 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 2.60 : 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 2.60 : 7a5772: 0f b7 4b 14 movzwl 0x14(%rbx),%ecx /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:924 80.52 : 7a5776: 0f b7 d1 movzwl %cx,%edx /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:924 1.30 : 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.30 : 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)) 0.00 : 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) 0.00 : 7a5888: 8b 3b mov (%rbx),%edi 2.60 : 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.30 : 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 1.30 : 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 3.90 : 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 0.00 : 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 ---------------------------------------------- 81.82 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:447 3.64 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 3.64 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:519 1.82 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:428 1.82 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:444 1.82 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:467 1.82 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:467 1.82 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 1.82 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:492 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:428 1.82 : 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) 0.00 : 5b97c9: ba 01 00 00 00 mov $0x1,%edx /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:444 1.82 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:447 81.82 : 5b97f6: 0f 85 d4 00 00 00 jne 5b98d0 : pergroupstate->transValueIsNull = false; : pergroupstate->noTransValue = false; : MemoryContextSwitchTo(oldContext); : return; : } : if (pergroupstate->transValueIsNull) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:467 1.82 : 5b97fc: 41 80 7d 08 00 cmpb $0x0,0x8(%r13) 1.82 : 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; /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 1.82 : 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); /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:492 1.82 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 3.64 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:519 3.64 : 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 ---------------------------------------------- 10.42 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:261 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:63 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:63 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:63 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:80 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:106 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:113 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:651 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:675 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:235 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:345 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:63 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:63 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:78 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:83 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:90 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:113 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:667 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:675 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:667 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:234 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:235 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:237 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:237 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:277 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:280 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:393 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:402 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:296 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:296 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:299 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:302 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:213 2.08 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:213 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bdaa0 : : * the other one is "outer". : * ---------------------------------------------------------------- : */ : TupleTableSlot * /* return: a tuple or NULL */ : ExecHashJoin(HashJoinState *node) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:63 4.17 : 5bdaa0: 55 push %rbp 4.17 : 5bdaa1: 48 89 e5 mov %rsp,%rbp 0.00 : 5bdaa4: 41 57 push %r15 2.08 : 5bdaa6: 41 56 push %r14 4.17 : 5bdaa8: 49 89 fe mov %rdi,%r14 0.00 : 5bdaab: 41 55 push %r13 0.00 : 5bdaad: 41 54 push %r12 2.08 : 5bdaaf: 53 push %rbx 0.00 : 5bdab0: 48 83 ec 58 sub $0x58,%rsp : int batchno; : : /* : * get information from HashJoin node : */ : joinqual = node->js.joinqual; 0.00 : 5bdab4: 48 8b 87 80 00 00 00 mov 0x80(%rdi),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:78 2.08 : 5bdabb: 48 89 45 a0 mov %rax,-0x60(%rbp) : otherqual = node->js.ps.qual; 0.00 : 5bdabf: 48 8b 57 28 mov 0x28(%rdi),%rdx 0.00 : 5bdac3: 48 89 55 a8 mov %rdx,-0x58(%rbp) : hashNode = (HashState *) innerPlanState(node); /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:80 4.17 : 5bdac7: 48 8b 4f 38 mov 0x38(%rdi),%rcx 0.00 : 5bdacb: 48 89 4d 98 mov %rcx,-0x68(%rbp) : outerNode = outerPlanState(node); 0.00 : 5bdacf: 48 8b 47 30 mov 0x30(%rdi),%rax 0.00 : 5bdad3: 48 89 45 90 mov %rax,-0x70(%rbp) : hashtable = node->hj_HashTable; 0.00 : 5bdad7: 48 8b 97 a8 00 00 00 mov 0xa8(%rdi),%rdx 0.00 : 5bdade: 48 89 55 b8 mov %rdx,-0x48(%rbp) : econtext = node->js.ps.ps_ExprContext; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:83 2.08 : 5bdae2: 48 8b 4f 60 mov 0x60(%rdi),%rcx 0.00 : 5bdae6: 48 89 4d b0 mov %rcx,-0x50(%rbp) : /* : * Check to see if we're still projecting out tuples from a previous join : * tuple (because there is a function-returning-set in the projection : * expressions). If so, try to project another one. : */ : if (node->js.ps.ps_TupFromTlist) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:90 2.08 : 5bdaea: 80 7f 70 00 cmpb $0x0,0x70(%rdi) 0.00 : 5bdaee: 74 1c je 5bdb0c : { : TupleTableSlot *result; : : result = ExecProject(node->js.ps.ps_ProjInfo, &isDone); 0.00 : 5bdaf0: 48 8b 7f 68 mov 0x68(%rdi),%rdi 0.00 : 5bdaf4: 48 8d 75 d4 lea -0x2c(%rbp),%rsi 0.00 : 5bdaf8: e8 03 f5 fe ff callq 5ad000 : if (isDone == ExprMultipleResult) 0.00 : 5bdafd: 83 7d d4 01 cmpl $0x1,-0x2c(%rbp) 0.00 : 5bdb01: 0f 84 91 04 00 00 je 5bdf98 : return result; : /* Done with that source tuple... */ : node->js.ps.ps_TupFromTlist = false; 0.00 : 5bdb07: 41 c6 46 70 00 movb $0x0,0x70(%r14) : /* : * 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 join tuple. : */ : ResetExprContext(econtext); 0.00 : 5bdb0c: 48 8b 45 b0 mov -0x50(%rbp),%rax 0.00 : 5bdb10: 48 8b 78 28 mov 0x28(%rax),%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:106 4.17 : 5bdb14: e8 97 ae 1d 00 callq 7989b0 : /* : * Find the corresponding bucket for this tuple in the main : * hash table or skew hash table. : */ : node->hj_CurHashValue = hashvalue; : ExecHashGetBucketAndBatch(hashtable, hashvalue, 0.00 : 5bdb19: 49 8d 96 b4 00 00 00 lea 0xb4(%r14),%rdx 0.00 : 5bdb20: 48 89 55 88 mov %rdx,-0x78(%rbp) 0.00 : 5bdb24: 0f 1f 40 00 nopl 0x0(%rax) : /* : * run the hash join state machine : */ : for (;;) : { : switch (node->hj_JoinState) 0.00 : 5bdb28: 41 83 be f0 00 00 00 cmpl $0x6,0xf0(%r14) 0.00 : 5bdb2f: 06 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:113 4.17 : 5bdb30: 76 36 jbe 5bdb68 : return NULL; /* end of join */ : node->hj_JoinState = HJ_NEED_NEW_OUTER; : break; : : default: : elog(ERROR, "unrecognized hashjoin state: %d", 0.00 : 5bdb32: ba c1 ba 88 00 mov $0x88bac1,%edx 0.00 : 5bdb37: be a7 01 00 00 mov $0x1a7,%esi 0.00 : 5bdb3c: bf 58 b9 88 00 mov $0x88b958,%edi 0.00 : 5bdb41: e8 da d8 1b 00 callq 77b420 0.00 : 5bdb46: 41 8b 96 f0 00 00 00 mov 0xf0(%r14),%edx 0.00 : 5bdb4d: be 00 ba 88 00 mov $0x88ba00,%esi 0.00 : 5bdb52: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5bdb57: 31 c0 xor %eax,%eax 0.00 : 5bdb59: e8 d2 d6 1b 00 callq 77b230 0.00 : 5bdb5e: e8 6d b9 ea ff callq 4694d0 0.00 : 5bdb63: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : /* : * run the hash join state machine : */ : for (;;) : { : switch (node->hj_JoinState) 0.00 : 5bdb68: 41 8b 86 f0 00 00 00 mov 0xf0(%r14),%eax 2.08 : 5bdb6f: ff 24 c5 50 ba 88 00 jmpq *0x88ba50(,%rax,8) 0.00 : 5bdb76: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 5bdb7d: 00 00 00 : * : * The only way to make the check is to try to fetch a tuple : * from the outer plan node. If we succeed, we have to stash : * it away for later consumption by ExecHashJoinOuterGetTuple. : */ : if (HJ_FILL_INNER(node)) 0.00 : 5bdb80: 49 83 be d8 00 00 00 cmpq $0x0,0xd8(%r14) 0.00 : 5bdb87: 00 0.00 : 5bdb88: 0f 84 da 05 00 00 je 5be168 : } : else : node->hj_OuterNotEmpty = true; : } : else : node->hj_FirstOuterTupleSlot = NULL; 0.00 : 5bdb8e: 49 c7 86 e8 00 00 00 movq $0x0,0xe8(%r14) 0.00 : 5bdb95: 00 00 00 00 : : /* : * create the hash table : */ : hashtable = ExecHashTableCreate((Hash *) hashNode->ps.plan, 0.00 : 5bdb99: 48 8b 45 98 mov -0x68(%rbp),%rax 0.00 : 5bdb9d: 31 d2 xor %edx,%edx 0.00 : 5bdb9f: 49 83 be d8 00 00 00 cmpq $0x0,0xd8(%r14) 0.00 : 5bdba6: 00 0.00 : 5bdba7: 49 8b b6 a0 00 00 00 mov 0xa0(%r14),%rsi 0.00 : 5bdbae: 48 8b 78 08 mov 0x8(%rax),%rdi 0.00 : 5bdbb2: 0f 95 c2 setne %dl 0.00 : 5bdbb5: e8 e6 ec ff ff callq 5bc8a0 : node->hj_HashTable = hashtable; : : /* : * execute the Hash node, to build the hash table : */ : hashNode->hashtable = hashtable; 0.00 : 5bdbba: 48 8b 55 98 mov -0x68(%rbp),%rdx : node->hj_FirstOuterTupleSlot = NULL; : : /* : * create the hash table : */ : hashtable = ExecHashTableCreate((Hash *) hashNode->ps.plan, 0.00 : 5bdbbe: 48 89 45 b8 mov %rax,-0x48(%rbp) : node->hj_HashOperators, : HJ_FILL_INNER(node)); : node->hj_HashTable = hashtable; 0.00 : 5bdbc2: 49 89 86 a8 00 00 00 mov %rax,0xa8(%r14) : : /* : * execute the Hash node, to build the hash table : */ : hashNode->hashtable = hashtable; : (void) MultiExecProcNode((PlanState *) hashNode); 0.00 : 5bdbc9: 48 89 d7 mov %rdx,%rdi : node->hj_HashTable = hashtable; : : /* : * execute the Hash node, to build the hash table : */ : hashNode->hashtable = hashtable; 0.00 : 5bdbcc: 48 89 42 78 mov %rax,0x78(%rdx) : (void) MultiExecProcNode((PlanState *) hashNode); 0.00 : 5bdbd0: e8 fb e7 fe ff callq 5ac3d0 : /* : * If the inner relation is completely empty, and we're not : * doing a left outer join, we can quit without scanning the : * outer relation. : */ : if (hashtable->totalTuples == 0 && !HJ_FILL_OUTER(node)) 0.00 : 5bdbd5: 66 0f 57 c0 xorpd %xmm0,%xmm0 0.00 : 5bdbd9: 48 8b 4d b8 mov -0x48(%rbp),%rcx 0.00 : 5bdbdd: 66 0f 2e 41 58 ucomisd 0x58(%rcx),%xmm0 0.00 : 5bdbe2: 0f 84 6b 06 00 00 je 5be253 : : /* : * need to remember whether nbatch has increased since we : * began scanning the outer relation : */ : hashtable->nbatch_outstart = hashtable->nbatch; 0.00 : 5bdbe8: 48 8b 55 b8 mov -0x48(%rbp),%rdx 0.00 : 5bdbec: 8b 42 40 mov 0x40(%rdx),%eax 0.00 : 5bdbef: 89 42 4c mov %eax,0x4c(%rdx) : /* : * Reset OuterNotEmpty for scan. (It's OK if we fetched a : * tuple above, because ExecHashJoinOuterGetTuple will : * immediately set it again.) : */ : node->hj_OuterNotEmpty = false; 0.00 : 5bdbf2: 41 c6 86 f5 00 00 00 movb $0x0,0xf5(%r14) 0.00 : 5bdbf9: 00 : : node->hj_JoinState = HJ_NEED_NEW_OUTER; 0.00 : 5bdbfa: 41 c7 86 f0 00 00 00 movl $0x2,0xf0(%r14) 0.00 : 5bdc01: 02 00 00 00 : static TupleTableSlot * : ExecHashJoinOuterGetTuple(PlanState *outerNode, : HashJoinState *hjstate, : uint32 *hashvalue) : { : HashJoinTable hashtable = hjstate->hj_HashTable; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:651 4.17 : 5bdc05: 49 8b 9e a8 00 00 00 mov 0xa8(%r14),%rbx : int curbatch = hashtable->curbatch; 0.00 : 5bdc0c: 8b 43 44 mov 0x44(%rbx),%eax : TupleTableSlot *slot; : : if (curbatch == 0) /* if it is the first pass */ 0.00 : 5bdc0f: 85 c0 test %eax,%eax 0.00 : 5bdc11: 0f 85 a9 00 00 00 jne 5bdcc0 : { : /* : * Check to see if first outer tuple was already fetched by : * ExecHashJoin() and not used yet. : */ : slot = hjstate->hj_FirstOuterTupleSlot; 0.00 : 5bdc17: 4d 8b a6 e8 00 00 00 mov 0xe8(%r14),%r12 : if (!TupIsNull(slot)) 0.00 : 5bdc1e: 4d 85 e4 test %r12,%r12 0.00 : 5bdc21: 74 5d je 5bdc80 0.00 : 5bdc23: 41 80 7c 24 04 00 cmpb $0x0,0x4(%r12) 0.00 : 5bdc29: 75 55 jne 5bdc80 : hjstate->hj_FirstOuterTupleSlot = NULL; 0.00 : 5bdc2b: 49 c7 86 e8 00 00 00 movq $0x0,0xe8(%r14) 0.00 : 5bdc32: 00 00 00 00 0.00 : 5bdc36: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 5bdc3d: 00 00 00 : else : slot = ExecProcNode(outerNode); : : while (!TupIsNull(slot)) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:667 2.08 : 5bdc40: 41 80 7c 24 04 00 cmpb $0x0,0x4(%r12) 0.00 : 5bdc46: 75 50 jne 5bdc98 : { : /* : * We have to compute the tuple's hash value. : */ : ExprContext *econtext = hjstate->js.ps.ps_ExprContext; 0.00 : 5bdc48: 49 8b 76 60 mov 0x60(%r14),%rsi : : econtext->ecxt_outertuple = slot; : if (ExecHashGetHashValue(hashtable, econtext, 0.00 : 5bdc4c: 4c 8d 4d d0 lea -0x30(%rbp),%r9 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:675 2.08 : 5bdc50: b9 01 00 00 00 mov $0x1,%ecx 0.00 : 5bdc55: 48 89 df mov %rbx,%rdi : /* : * We have to compute the tuple's hash value. : */ : ExprContext *econtext = hjstate->js.ps.ps_ExprContext; : : econtext->ecxt_outertuple = slot; 0.00 : 5bdc58: 4c 89 66 18 mov %r12,0x18(%rsi) : if (ExecHashGetHashValue(hashtable, econtext, 0.00 : 5bdc5c: 49 83 be e0 00 00 00 cmpq $0x0,0xe0(%r14) 0.00 : 5bdc63: 00 0.00 : 5bdc64: 49 8b 96 90 00 00 00 mov 0x90(%r14),%rdx 0.00 : 5bdc6b: 41 0f 95 c0 setne %r8b 0.00 : 5bdc6f: 41 83 e0 01 and $0x1,%r8d 0.00 : 5bdc73: e8 18 e2 ff ff callq 5bbe90 4.17 : 5bdc78: 84 c0 test %al,%al 0.00 : 5bdc7a: 0f 85 90 04 00 00 jne 5be110 : : /* : * That tuple couldn't match because of a NULL, so discard it and : * continue with the next one. : */ : slot = ExecProcNode(outerNode); 0.00 : 5bdc80: 48 8b 7d 90 mov -0x70(%rbp),%rdi 0.00 : 5bdc84: e8 17 e8 fe ff callq 5ac4a0 : if (!TupIsNull(slot)) : hjstate->hj_FirstOuterTupleSlot = NULL; : else : slot = ExecProcNode(outerNode); : : while (!TupIsNull(slot)) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:667 2.08 : 5bdc89: 48 85 c0 test %rax,%rax : : /* : * That tuple couldn't match because of a NULL, so discard it and : * continue with the next one. : */ : slot = ExecProcNode(outerNode); 0.00 : 5bdc8c: 49 89 c4 mov %rax,%r12 : if (!TupIsNull(slot)) : hjstate->hj_FirstOuterTupleSlot = NULL; : else : slot = ExecProcNode(outerNode); : : while (!TupIsNull(slot)) 0.00 : 5bdc8f: 75 af jne 5bdc40 0.00 : 5bdc91: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : node, : &hashvalue); : if (TupIsNull(outerTupleSlot)) : { : /* end of batch, or maybe whole join */ : if (HJ_FILL_INNER(node)) 0.00 : 5bdc98: 49 83 be d8 00 00 00 cmpq $0x0,0xd8(%r14) 0.00 : 5bdc9f: 00 0.00 : 5bdca0: 0f 84 0a 03 00 00 je 5bdfb0 : { : /* set up to scan for unmatched inner tuples */ : ExecPrepHashTableForUnmatched(node); 0.00 : 5bdca6: 4c 89 f7 mov %r14,%rdi 0.00 : 5bdca9: e8 52 de ff ff callq 5bbb00 : node->hj_JoinState = HJ_FILL_INNER_TUPLES; 0.00 : 5bdcae: 41 c7 86 f0 00 00 00 movl $0x5,0xf0(%r14) 0.00 : 5bdcb5: 05 00 00 00 0.00 : 5bdcb9: e9 6a fe ff ff jmpq 5bdb28 0.00 : 5bdcbe: 66 90 xchg %ax,%ax : * continue with the next one. : */ : slot = ExecProcNode(outerNode); : } : } : else if (curbatch < hashtable->nbatch) 0.00 : 5bdcc0: 3b 43 40 cmp 0x40(%rbx),%eax 0.00 : 5bdcc3: 7d d3 jge 5bdc98 : { : BufFile *file = hashtable->outerBatchFile[curbatch]; 0.00 : 5bdcc5: 48 63 d0 movslq %eax,%rdx 0.00 : 5bdcc8: 48 8b 43 70 mov 0x70(%rbx),%rax 0.00 : 5bdccc: 48 8b 34 d0 mov (%rax,%rdx,8),%rsi : : /* : * In outer-join cases, we could get here even though the batch file : * is empty. : */ : if (file == NULL) 0.00 : 5bdcd0: 48 85 f6 test %rsi,%rsi 0.00 : 5bdcd3: 74 c3 je 5bdc98 : return NULL; : : slot = ExecHashJoinGetSavedTuple(hjstate, 0.00 : 5bdcd5: 49 8b 8e c8 00 00 00 mov 0xc8(%r14),%rcx 0.00 : 5bdcdc: 48 8d 55 d0 lea -0x30(%rbp),%rdx 0.00 : 5bdce0: 4c 89 f7 mov %r14,%rdi 0.00 : 5bdce3: e8 c8 fc ff ff callq 5bd9b0 : file, : hashvalue, : hjstate->hj_OuterTupleSlot); : if (!TupIsNull(slot)) 0.00 : 5bdce8: 48 85 c0 test %rax,%rax : * is empty. : */ : if (file == NULL) : return NULL; : : slot = ExecHashJoinGetSavedTuple(hjstate, 0.00 : 5bdceb: 49 89 c4 mov %rax,%r12 : file, : hashvalue, : hjstate->hj_OuterTupleSlot); : if (!TupIsNull(slot)) 0.00 : 5bdcee: 74 a8 je 5bdc98 0.00 : 5bdcf0: 80 78 04 00 cmpb $0x0,0x4(%rax) 0.00 : 5bdcf4: 75 a2 jne 5bdc98 : else : node->hj_JoinState = HJ_NEED_NEW_BATCH; : continue; : } : : econtext->ecxt_outertuple = outerTupleSlot; 0.00 : 5bdcf6: 48 8b 4d b0 mov -0x50(%rbp),%rcx 0.00 : 5bdcfa: 4c 89 61 18 mov %r12,0x18(%rcx) : : /* : * Find the corresponding bucket for this tuple in the main : * hash table or skew hash table. : */ : node->hj_CurHashValue = hashvalue; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:234 2.08 : 5bdcfe: 8b 75 d0 mov -0x30(%rbp),%esi : ExecHashGetBucketAndBatch(hashtable, hashvalue, /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:235 2.08 : 5bdd01: 48 8d 4d cc lea -0x34(%rbp),%rcx 0.00 : 5bdd05: 48 8b 55 88 mov -0x78(%rbp),%rdx 0.00 : 5bdd09: 48 8b 7d b8 mov -0x48(%rbp),%rdi : node->hj_JoinState = HJ_NEED_NEW_BATCH; : continue; : } : : econtext->ecxt_outertuple = outerTupleSlot; : node->hj_MatchedOuter = false; 0.00 : 5bdd0d: 41 c6 86 f4 00 00 00 movb $0x0,0xf4(%r14) 0.00 : 5bdd14: 00 : : /* : * Find the corresponding bucket for this tuple in the main : * hash table or skew hash table. : */ : node->hj_CurHashValue = hashvalue; 0.00 : 5bdd15: 41 89 b6 b0 00 00 00 mov %esi,0xb0(%r14) : ExecHashGetBucketAndBatch(hashtable, hashvalue, 4.17 : 5bdd1c: e8 9f dd ff ff callq 5bbac0 : &node->hj_CurBucketNo, &batchno); : node->hj_CurSkewBucketNo = ExecHashGetSkewBucket(hashtable, /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:237 2.08 : 5bdd21: 8b 75 d0 mov -0x30(%rbp),%esi 2.08 : 5bdd24: 48 8b 7d b8 mov -0x48(%rbp),%rdi 0.00 : 5bdd28: e8 83 de ff ff callq 5bbbb0 : : /* : * The tuple might not belong to the current batch (where : * "current batch" includes the skew buckets if any). : */ : if (batchno != hashtable->curbatch && 0.00 : 5bdd2d: 48 8b 55 b8 mov -0x48(%rbp),%rdx : * hash table or skew hash table. : */ : node->hj_CurHashValue = hashvalue; : ExecHashGetBucketAndBatch(hashtable, hashvalue, : &node->hj_CurBucketNo, &batchno); : node->hj_CurSkewBucketNo = ExecHashGetSkewBucket(hashtable, 0.00 : 5bdd31: 41 89 86 b8 00 00 00 mov %eax,0xb8(%r14) : hashvalue); : node->hj_CurTuple = NULL; 0.00 : 5bdd38: 49 c7 86 c0 00 00 00 movq $0x0,0xc0(%r14) 0.00 : 5bdd3f: 00 00 00 00 : : /* : * The tuple might not belong to the current batch (where : * "current batch" includes the skew buckets if any). : */ : if (batchno != hashtable->curbatch && 0.00 : 5bdd43: 8b 45 cc mov -0x34(%rbp),%eax 0.00 : 5bdd46: 39 42 44 cmp %eax,0x44(%rdx) 0.00 : 5bdd49: 74 0e je 5bdd59 0.00 : 5bdd4b: 41 83 be b8 00 00 00 cmpl $0xffffffff,0xb8(%r14) 0.00 : 5bdd52: ff 0.00 : 5bdd53: 0f 84 4d 04 00 00 je 5be1a6 : /* Loop around, staying in HJ_NEED_NEW_OUTER state */ : continue; : } : : /* OK, let's scan the bucket for matches */ : node->hj_JoinState = HJ_SCAN_BUCKET; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:261 10.42 : 5bdd59: 41 c7 86 f0 00 00 00 movl $0x3,0xf0(%r14) 0.00 : 5bdd60: 03 00 00 00 : /* : * We check for interrupts here because this corresponds to : * where we'd fetch a row from a child plan node in other join : * types. : */ : CHECK_FOR_INTERRUPTS(); 0.00 : 5bdd64: 0f b6 05 25 c3 5f 00 movzbl 0x5fc325(%rip),%eax # bba090 0.00 : 5bdd6b: 84 c0 test %al,%al 0.00 : 5bdd6d: 0f 85 8d 03 00 00 jne 5be100 : : /* : * Scan the selected hash bucket for matches to current outer : */ : if (!ExecScanHashBucket(node, econtext)) 0.00 : 5bdd73: 48 8b 75 b0 mov -0x50(%rbp),%rsi 0.00 : 5bdd77: 4c 89 f7 mov %r14,%rdi 0.00 : 5bdd7a: e8 21 e0 ff ff callq 5bbda0 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:277 2.08 : 5bdd7f: 84 c0 test %al,%al 0.00 : 5bdd81: 0f 85 39 02 00 00 jne 5bdfc0 : { : /* out of matches; check for possible outer-join fill */ : node->hj_JoinState = HJ_FILL_OUTER_TUPLE; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:280 2.08 : 5bdd87: 41 c7 86 f0 00 00 00 movl $0x4,0xf0(%r14) 0.00 : 5bdd8e: 04 00 00 00 : continue; 0.00 : 5bdd92: e9 91 fd ff ff jmpq 5bdb28 0.00 : 5bdd97: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5bdd9e: 00 00 : * Returns true if successful, false if there are no more batches. : */ : static bool : ExecHashJoinNewBatch(HashJoinState *hjstate) : { : HashJoinTable hashtable = hjstate->hj_HashTable; 0.00 : 5bdda0: 4d 8b a6 a8 00 00 00 mov 0xa8(%r14),%r12 : BufFile *innerFile; : TupleTableSlot *slot; : uint32 hashvalue; : : nbatch = hashtable->nbatch; : curbatch = hashtable->curbatch; 0.00 : 5bdda7: 41 8b 5c 24 44 mov 0x44(%r12),%ebx : int curbatch; : BufFile *innerFile; : TupleTableSlot *slot; : uint32 hashvalue; : : nbatch = hashtable->nbatch; 0.00 : 5bddac: 45 8b 7c 24 40 mov 0x40(%r12),%r15d : curbatch = hashtable->curbatch; : : if (curbatch > 0) 0.00 : 5bddb1: 85 db test %ebx,%ebx 0.00 : 5bddb3: 0f 8e 77 03 00 00 jle 5be130 : { : /* : * We no longer need the previous outer batch file; close it right : * away to free disk space. : */ : if (hashtable->outerBatchFile[curbatch]) 0.00 : 5bddb9: 48 63 c3 movslq %ebx,%rax 0.00 : 5bddbc: 4c 8d 2c c5 00 00 00 lea 0x0(,%rax,8),%r13 0.00 : 5bddc3: 00 0.00 : 5bddc4: 4c 89 e8 mov %r13,%rax 0.00 : 5bddc7: 49 03 44 24 70 add 0x70(%r12),%rax 0.00 : 5bddcc: 48 8b 38 mov (%rax),%rdi 0.00 : 5bddcf: 48 85 ff test %rdi,%rdi 0.00 : 5bddd2: 74 0d je 5bdde1 : BufFileClose(hashtable->outerBatchFile[curbatch]); 0.00 : 5bddd4: e8 d7 d1 0b 00 callq 67afb0 0.00 : 5bddd9: 4c 89 e8 mov %r13,%rax 0.00 : 5bdddc: 49 03 44 24 70 add 0x70(%r12),%rax : hashtable->outerBatchFile[curbatch] = NULL; 0.00 : 5bdde1: 48 c7 00 00 00 00 00 movq $0x0,(%rax) : * : * 3. Similarly, if we have increased nbatch since starting the outer : * scan, we have to rescan outer batches in case they contain tuples that : * need to be reassigned. : */ : curbatch++; 0.00 : 5bdde8: 44 8d 6b 01 lea 0x1(%rbx),%r13d : while (curbatch < nbatch && 0.00 : 5bddec: 45 39 ef cmp %r13d,%r15d 0.00 : 5bddef: 7f 73 jg 5bde64 0.00 : 5bddf1: e9 7a 04 00 00 jmpq 5be270 0.00 : 5bddf6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 5bddfd: 00 00 00 0.00 : 5bde00: 49 8b 44 24 68 mov 0x68(%r12),%rax 0.00 : 5bde05: 48 83 3c d8 00 cmpq $0x0,(%rax,%rbx,8) 0.00 : 5bde0a: 0f 85 38 02 00 00 jne 5be048 : (hashtable->outerBatchFile[curbatch] == NULL || : hashtable->innerBatchFile[curbatch] == NULL)) : { : if (hashtable->outerBatchFile[curbatch] && 0.00 : 5bde10: 49 83 be e0 00 00 00 cmpq $0x0,0xe0(%r14) 0.00 : 5bde17: 00 0.00 : 5bde18: 0f 85 2a 02 00 00 jne 5be048 : HJ_FILL_INNER(hjstate)) : break; /* must process due to rule 1 */ : if (hashtable->innerBatchFile[curbatch] && : nbatch != hashtable->nbatch_original) : break; /* must process due to rule 2 */ : if (hashtable->outerBatchFile[curbatch] && 0.00 : 5bde1e: 45 3b 7c 24 4c cmp 0x4c(%r12),%r15d 0.00 : 5bde23: 0f 85 1f 02 00 00 jne 5be048 : break; /* must process due to rule 3 */ : /* We can ignore this batch. */ : /* Release associated temp files right away. */ : if (hashtable->innerBatchFile[curbatch]) : BufFileClose(hashtable->innerBatchFile[curbatch]); : hashtable->innerBatchFile[curbatch] = NULL; 0.00 : 5bde29: 48 c7 04 d8 00 00 00 movq $0x0,(%rax,%rbx,8) 0.00 : 5bde30: 00 : if (hashtable->outerBatchFile[curbatch]) 0.00 : 5bde31: 48 8b 45 c0 mov -0x40(%rbp),%rax 0.00 : 5bde35: 49 03 44 24 70 add 0x70(%r12),%rax 0.00 : 5bde3a: 48 8b 38 mov (%rax),%rdi 0.00 : 5bde3d: 48 85 ff test %rdi,%rdi 0.00 : 5bde40: 74 0e je 5bde50 : BufFileClose(hashtable->outerBatchFile[curbatch]); 0.00 : 5bde42: e8 69 d1 0b 00 callq 67afb0 0.00 : 5bde47: 48 8b 45 c0 mov -0x40(%rbp),%rax 0.00 : 5bde4b: 49 03 44 24 70 add 0x70(%r12),%rax : hashtable->outerBatchFile[curbatch] = NULL; : curbatch++; 0.00 : 5bde50: 41 83 c5 01 add $0x1,%r13d : if (hashtable->innerBatchFile[curbatch]) : BufFileClose(hashtable->innerBatchFile[curbatch]); : hashtable->innerBatchFile[curbatch] = NULL; : if (hashtable->outerBatchFile[curbatch]) : BufFileClose(hashtable->outerBatchFile[curbatch]); : hashtable->outerBatchFile[curbatch] = NULL; 0.00 : 5bde54: 48 c7 00 00 00 00 00 movq $0x0,(%rax) : * 3. Similarly, if we have increased nbatch since starting the outer : * scan, we have to rescan outer batches in case they contain tuples that : * need to be reassigned. : */ : curbatch++; : while (curbatch < nbatch && 0.00 : 5bde5b: 45 39 ef cmp %r13d,%r15d 0.00 : 5bde5e: 0f 8e 0c 04 00 00 jle 5be270 0.00 : 5bde64: 49 63 dd movslq %r13d,%rbx 0.00 : 5bde67: 48 8d 0c dd 00 00 00 lea 0x0(,%rbx,8),%rcx 0.00 : 5bde6e: 00 0.00 : 5bde6f: 48 89 4d c0 mov %rcx,-0x40(%rbp) 0.00 : 5bde73: 49 8b 44 24 70 mov 0x70(%r12),%rax 0.00 : 5bde78: 48 83 3c d8 00 cmpq $0x0,(%rax,%rbx,8) 0.00 : 5bde7d: 75 81 jne 5bde00 : hashtable->innerBatchFile[curbatch] == NULL)) : { : if (hashtable->outerBatchFile[curbatch] && : HJ_FILL_OUTER(hjstate)) : break; /* must process due to rule 1 */ : if (hashtable->innerBatchFile[curbatch] && 0.00 : 5bde7f: 49 8b 44 24 68 mov 0x68(%r12),%rax 0.00 : 5bde84: 48 8b 3c d8 mov (%rax,%rbx,8),%rdi 0.00 : 5bde88: 48 85 ff test %rdi,%rdi 0.00 : 5bde8b: 74 9c je 5bde29 0.00 : 5bde8d: 49 83 be d8 00 00 00 cmpq $0x0,0xd8(%r14) 0.00 : 5bde94: 00 0.00 : 5bde95: 0f 85 ad 01 00 00 jne 5be048 : HJ_FILL_INNER(hjstate)) : break; /* must process due to rule 1 */ : if (hashtable->innerBatchFile[curbatch] && 0.00 : 5bde9b: 45 3b 7c 24 48 cmp 0x48(%r12),%r15d 0.00 : 5bdea0: 0f 85 a2 01 00 00 jne 5be048 : nbatch != hashtable->nbatch_outstart) : break; /* must process due to rule 3 */ : /* We can ignore this batch. */ : /* Release associated temp files right away. */ : if (hashtable->innerBatchFile[curbatch]) : BufFileClose(hashtable->innerBatchFile[curbatch]); 0.00 : 5bdea6: e8 05 d1 0b 00 callq 67afb0 0.00 : 5bdeab: 49 8b 44 24 68 mov 0x68(%r12),%rax 0.00 : 5bdeb0: e9 74 ff ff ff jmpq 5bde29 0.00 : 5bdeb5: 0f 1f 00 nopl (%rax) : /* : * We have finished a batch, but we are doing right/full join, : * so any unmatched inner tuples in the hashtable have to be : * emitted before we continue to the next batch. : */ : if (!ExecScanHashTableForUnmatched(node, econtext)) 0.00 : 5bdeb8: 48 8b 75 b0 mov -0x50(%rbp),%rsi 0.00 : 5bdebc: 4c 89 f7 mov %r14,%rdi 0.00 : 5bdebf: e8 ec dd ff ff callq 5bbcb0 0.00 : 5bdec4: 84 c0 test %al,%al 0.00 : 5bdec6: 0f 84 e4 00 00 00 je 5bdfb0 : : /* : * Generate a fake join tuple with nulls for the outer tuple, : * and return it if it passes the non-join quals. : */ : econtext->ecxt_outertuple = node->hj_NullOuterTupleSlot; 0.00 : 5bdecc: 49 8b 86 d8 00 00 00 mov 0xd8(%r14),%rax 0.00 : 5bded3: 48 8b 55 b0 mov -0x50(%rbp),%rdx 0.00 : 5bded7: 48 89 42 18 mov %rax,0x18(%rdx) : : if (otherqual == NIL || /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:393 2.08 : 5bdedb: 48 83 7d a8 00 cmpq $0x0,-0x58(%rbp) 0.00 : 5bdee0: 0f 84 8c 00 00 00 je 5bdf72 0.00 : 5bdee6: 48 8b 75 b0 mov -0x50(%rbp),%rsi 0.00 : 5bdeea: 48 8b 7d a8 mov -0x58(%rbp),%rdi 0.00 : 5bdeee: 31 d2 xor %edx,%edx 0.00 : 5bdef0: e8 1b f0 fe ff callq 5acf10 0.00 : 5bdef5: 84 c0 test %al,%al 0.00 : 5bdef7: 75 79 jne 5bdf72 : (isDone == ExprMultipleResult); : return result; : } : } : else : InstrCountFiltered2(node, 1); 0.00 : 5bdef9: 49 8b 46 18 mov 0x18(%r14),%rax 0.00 : 5bdefd: 48 85 c0 test %rax,%rax 0.00 : 5bdf00: 0f 84 22 fc ff ff je 5bdb28 0.00 : 5bdf06: f2 0f 10 05 4a 12 1f movsd 0x1f124a(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 5bdf0d: 00 0.00 : 5bdf0e: f2 0f 58 80 d0 00 00 addsd 0xd0(%rax),%xmm0 0.00 : 5bdf15: 00 0.00 : 5bdf16: f2 0f 11 80 d0 00 00 movsd %xmm0,0xd0(%rax) 0.00 : 5bdf1d: 00 0.00 : 5bdf1e: e9 05 fc ff ff jmpq 5bdb28 0.00 : 5bdf23: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : * whether to emit a dummy outer-join tuple. Whether we emit : * one or not, the next state is NEED_NEW_OUTER. : */ : node->hj_JoinState = HJ_NEED_NEW_OUTER; : : if (!node->hj_MatchedOuter && /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:345 4.17 : 5bdf28: 41 80 be f4 00 00 00 cmpb $0x0,0xf4(%r14) 0.00 : 5bdf2f: 00 : /* : * The current outer tuple has run out of matches, so check : * whether to emit a dummy outer-join tuple. Whether we emit : * one or not, the next state is NEED_NEW_OUTER. : */ : node->hj_JoinState = HJ_NEED_NEW_OUTER; 0.00 : 5bdf30: 41 c7 86 f0 00 00 00 movl $0x2,0xf0(%r14) 0.00 : 5bdf37: 02 00 00 00 : : if (!node->hj_MatchedOuter && 0.00 : 5bdf3b: 0f 85 e7 fb ff ff jne 5bdb28 0.00 : 5bdf41: 49 8b 86 e0 00 00 00 mov 0xe0(%r14),%rax 0.00 : 5bdf48: 48 85 c0 test %rax,%rax 0.00 : 5bdf4b: 0f 84 d7 fb ff ff je 5bdb28 : { : /* : * Generate a fake join tuple with nulls for the inner : * tuple, and return it if it passes the non-join quals. : */ : econtext->ecxt_innertuple = node->hj_NullInnerTupleSlot; 0.00 : 5bdf51: 48 8b 4d b0 mov -0x50(%rbp),%rcx 0.00 : 5bdf55: 48 89 41 10 mov %rax,0x10(%rcx) : : if (otherqual == NIL || 0.00 : 5bdf59: 48 83 7d a8 00 cmpq $0x0,-0x58(%rbp) 0.00 : 5bdf5e: 74 12 je 5bdf72 0.00 : 5bdf60: 48 8b 7d a8 mov -0x58(%rbp),%rdi 0.00 : 5bdf64: 31 d2 xor %edx,%edx 0.00 : 5bdf66: 48 89 ce mov %rcx,%rsi 0.00 : 5bdf69: e8 a2 ef fe ff callq 5acf10 0.00 : 5bdf6e: 84 c0 test %al,%al 0.00 : 5bdf70: 74 87 je 5bdef9 : if (otherqual == NIL || : ExecQual(otherqual, econtext, false)) : { : TupleTableSlot *result; : : result = ExecProject(node->js.ps.ps_ProjInfo, &isDone); 0.00 : 5bdf72: 49 8b 7e 68 mov 0x68(%r14),%rdi 0.00 : 5bdf76: 48 8d 75 d4 lea -0x2c(%rbp),%rsi 0.00 : 5bdf7a: e8 81 f0 fe ff callq 5ad000 : : if (isDone != ExprEndResult) 0.00 : 5bdf7f: 8b 55 d4 mov -0x2c(%rbp),%edx 0.00 : 5bdf82: 83 fa 02 cmp $0x2,%edx 0.00 : 5bdf85: 0f 84 9d fb ff ff je 5bdb28 : { : node->js.ps.ps_TupFromTlist = 0.00 : 5bdf8b: 83 ea 01 sub $0x1,%edx 0.00 : 5bdf8e: 41 0f 94 46 70 sete 0x70(%r14) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:402 2.08 : 5bdf93: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : default: : elog(ERROR, "unrecognized hashjoin state: %d", : (int) node->hj_JoinState); : } : } : } 0.00 : 5bdf98: 48 83 c4 58 add $0x58,%rsp 0.00 : 5bdf9c: 5b pop %rbx 0.00 : 5bdf9d: 41 5c pop %r12 0.00 : 5bdf9f: 41 5d pop %r13 0.00 : 5bdfa1: 41 5e pop %r14 0.00 : 5bdfa3: 41 5f pop %r15 0.00 : 5bdfa5: c9 leaveq 0.00 : 5bdfa6: c3 retq 0.00 : 5bdfa7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5bdfae: 00 00 : * emitted before we continue to the next batch. : */ : if (!ExecScanHashTableForUnmatched(node, econtext)) : { : /* no more unmatched tuples */ : node->hj_JoinState = HJ_NEED_NEW_BATCH; 0.00 : 5bdfb0: 41 c7 86 f0 00 00 00 movl $0x6,0xf0(%r14) 0.00 : 5bdfb7: 06 00 00 00 : continue; 0.00 : 5bdfbb: e9 68 fb ff ff jmpq 5bdb28 : * table, and return the slot. : * : * Only the joinquals determine tuple match status, but all : * quals must pass to actually return the tuple. : */ : if (joinqual == NIL || ExecQual(joinqual, econtext, false)) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:296 2.08 : 5bdfc0: 48 83 7d a0 00 cmpq $0x0,-0x60(%rbp) 2.08 : 5bdfc5: 74 41 je 5be008 0.00 : 5bdfc7: 48 8b 75 b0 mov -0x50(%rbp),%rsi 0.00 : 5bdfcb: 48 8b 7d a0 mov -0x60(%rbp),%rdi 0.00 : 5bdfcf: 31 d2 xor %edx,%edx 0.00 : 5bdfd1: e8 3a ef fe ff callq 5acf10 0.00 : 5bdfd6: 84 c0 test %al,%al 0.00 : 5bdfd8: 75 2e jne 5be008 : } : else : InstrCountFiltered2(node, 1); : } : else : InstrCountFiltered1(node, 1); 0.00 : 5bdfda: 49 8b 46 18 mov 0x18(%r14),%rax 0.00 : 5bdfde: 48 85 c0 test %rax,%rax 0.00 : 5bdfe1: 0f 84 41 fb ff ff je 5bdb28 0.00 : 5bdfe7: f2 0f 10 05 69 11 1f movsd 0x1f1169(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 5bdfee: 00 0.00 : 5bdfef: f2 0f 58 80 c8 00 00 addsd 0xc8(%rax),%xmm0 0.00 : 5bdff6: 00 0.00 : 5bdff7: f2 0f 11 80 c8 00 00 movsd %xmm0,0xc8(%rax) 0.00 : 5bdffe: 00 0.00 : 5bdfff: e9 24 fb ff ff jmpq 5bdb28 0.00 : 5be004: 0f 1f 40 00 nopl 0x0(%rax) : * quals must pass to actually return the tuple. : */ : if (joinqual == NIL || ExecQual(joinqual, econtext, false)) : { : node->hj_MatchedOuter = true; : HeapTupleHeaderSetMatch(HJTUPLE_MINTUPLE(node->hj_CurTuple)); /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:299 2.08 : 5be008: 49 8b 86 c0 00 00 00 mov 0xc0(%r14),%rax : * Only the joinquals determine tuple match status, but all : * quals must pass to actually return the tuple. : */ : if (joinqual == NIL || ExecQual(joinqual, econtext, false)) : { : node->hj_MatchedOuter = true; 0.00 : 5be00f: 41 c6 86 f4 00 00 00 movb $0x1,0xf4(%r14) 0.00 : 5be016: 01 : HeapTupleHeaderSetMatch(HJTUPLE_MINTUPLE(node->hj_CurTuple)); 0.00 : 5be017: 66 81 48 1a 00 80 orw $0x8000,0x1a(%rax) : : /* In an antijoin, we never return a matched tuple */ : if (node->js.jointype == JOIN_ANTI) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:302 2.08 : 5be01d: 41 8b 46 78 mov 0x78(%r14),%eax 0.00 : 5be021: 83 f8 05 cmp $0x5,%eax 0.00 : 5be024: 0f 84 bd 00 00 00 je 5be0e7 : : /* : * In a semijoin, we'll consider returning the first : * match, but after that we're done with this outer tuple. : */ : if (node->js.jointype == JOIN_SEMI) 0.00 : 5be02a: 83 f8 04 cmp $0x4,%eax 0.00 : 5be02d: 0f 85 a8 fe ff ff jne 5bdedb : node->hj_JoinState = HJ_NEED_NEW_OUTER; 0.00 : 5be033: 41 c7 86 f0 00 00 00 movl $0x2,0xf0(%r14) 0.00 : 5be03a: 02 00 00 00 0.00 : 5be03e: e9 98 fe ff ff jmpq 5bdedb 0.00 : 5be043: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : } : : if (curbatch >= nbatch) : return false; /* no more batches */ : : hashtable->curbatch = curbatch; 0.00 : 5be048: 45 89 6c 24 44 mov %r13d,0x44(%r12) : : /* : * Reload the hash table with the new inner batch (which could be empty) : */ : ExecHashTableReset(hashtable); 0.00 : 5be04d: 4c 89 e7 mov %r12,%rdi 0.00 : 5be050: e8 db db ff ff callq 5bbc30 : : innerFile = hashtable->innerBatchFile[curbatch]; 0.00 : 5be055: 49 8b 44 24 68 mov 0x68(%r12),%rax 0.00 : 5be05a: 48 8b 55 c0 mov -0x40(%rbp),%rdx 0.00 : 5be05e: 48 8b 1c 10 mov (%rax,%rdx,1),%rbx : : if (innerFile != NULL) 0.00 : 5be062: 48 85 db test %rbx,%rbx 0.00 : 5be065: 74 5b je 5be0c2 : { : if (BufFileSeek(innerFile, 0, 0L, SEEK_SET)) 0.00 : 5be067: 31 c9 xor %ecx,%ecx 0.00 : 5be069: 31 d2 xor %edx,%edx 0.00 : 5be06b: 31 f6 xor %esi,%esi 0.00 : 5be06d: 48 89 df mov %rbx,%rdi 0.00 : 5be070: e8 8b ca 0b 00 callq 67ab00 0.00 : 5be075: 85 c0 test %eax,%eax 0.00 : 5be077: 74 15 je 5be08e 0.00 : 5be079: e9 08 02 00 00 jmpq 5be286 0.00 : 5be07e: 66 90 xchg %ax,%ax : { : /* : * NOTE: some tuples may be sent to future batches. Also, it is : * possible for hashtable->nbatch to be increased here! : */ : ExecHashTableInsert(hashtable, slot, hashvalue); 0.00 : 5be080: 8b 55 c8 mov -0x38(%rbp),%edx 0.00 : 5be083: 48 89 c6 mov %rax,%rsi 0.00 : 5be086: 4c 89 e7 mov %r12,%rdi 0.00 : 5be089: e8 82 e3 ff ff callq 5bc410 : if (BufFileSeek(innerFile, 0, 0L, SEEK_SET)) : ereport(ERROR, : (errcode_for_file_access(), : errmsg("could not rewind hash-join temporary file: %m"))); : : while ((slot = ExecHashJoinGetSavedTuple(hjstate, 0.00 : 5be08e: 49 8b 8e d0 00 00 00 mov 0xd0(%r14),%rcx 0.00 : 5be095: 48 8d 55 c8 lea -0x38(%rbp),%rdx 0.00 : 5be099: 48 89 de mov %rbx,%rsi 0.00 : 5be09c: 4c 89 f7 mov %r14,%rdi 0.00 : 5be09f: e8 0c f9 ff ff callq 5bd9b0 0.00 : 5be0a4: 48 85 c0 test %rax,%rax 0.00 : 5be0a7: 75 d7 jne 5be080 : : /* : * after we build the hash table, the inner batch file is no longer : * needed : */ : BufFileClose(innerFile); 0.00 : 5be0a9: 48 89 df mov %rbx,%rdi 0.00 : 5be0ac: e8 ff ce 0b 00 callq 67afb0 : hashtable->innerBatchFile[curbatch] = NULL; 0.00 : 5be0b1: 49 8b 44 24 68 mov 0x68(%r12),%rax 0.00 : 5be0b6: 48 8b 4d c0 mov -0x40(%rbp),%rcx 0.00 : 5be0ba: 48 c7 04 08 00 00 00 movq $0x0,(%rax,%rcx,1) 0.00 : 5be0c1: 00 : } : : /* : * Rewind outer batch file (if present), so that we can start reading it. : */ : if (hashtable->outerBatchFile[curbatch] != NULL) 0.00 : 5be0c2: 49 8b 44 24 70 mov 0x70(%r12),%rax 0.00 : 5be0c7: 48 8b 55 c0 mov -0x40(%rbp),%rdx 0.00 : 5be0cb: 48 8b 3c 10 mov (%rax,%rdx,1),%rdi 0.00 : 5be0cf: 48 85 ff test %rdi,%rdi 0.00 : 5be0d2: 74 13 je 5be0e7 : { : if (BufFileSeek(hashtable->outerBatchFile[curbatch], 0, 0L, SEEK_SET)) 0.00 : 5be0d4: 31 c9 xor %ecx,%ecx 0.00 : 5be0d6: 31 d2 xor %edx,%edx 0.00 : 5be0d8: 31 f6 xor %esi,%esi 0.00 : 5be0da: e8 21 ca 0b 00 callq 67ab00 0.00 : 5be0df: 85 c0 test %eax,%eax 0.00 : 5be0e1: 0f 85 ea 00 00 00 jne 5be1d1 : /* : * Try to advance to next batch. Done if there are no more. : */ : if (!ExecHashJoinNewBatch(node)) : return NULL; /* end of join */ : node->hj_JoinState = HJ_NEED_NEW_OUTER; 0.00 : 5be0e7: 41 c7 86 f0 00 00 00 movl $0x2,0xf0(%r14) 0.00 : 5be0ee: 02 00 00 00 0.00 : 5be0f2: e9 31 fa ff ff jmpq 5bdb28 0.00 : 5be0f7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5be0fe: 00 00 : /* : * We check for interrupts here because this corresponds to : * where we'd fetch a row from a child plan node in other join : * types. : */ : CHECK_FOR_INTERRUPTS(); 0.00 : 5be100: e8 9b e1 0d 00 callq 69c2a0 0.00 : 5be105: e9 69 fc ff ff jmpq 5bdd73 0.00 : 5be10a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : true, /* outer tuple */ : HJ_FILL_OUTER(hjstate), : hashvalue)) : { : /* remember outer relation is not empty for possible rescan */ : hjstate->hj_OuterNotEmpty = true; 0.00 : 5be110: 41 c6 86 f5 00 00 00 movb $0x1,0xf5(%r14) 0.00 : 5be117: 01 : * We don't have an outer tuple, try to get the next one : */ : outerTupleSlot = ExecHashJoinOuterGetTuple(outerNode, : node, : &hashvalue); : if (TupIsNull(outerTupleSlot)) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHashjoin.c:213 2.08 : 5be118: 41 80 7c 24 04 00 cmpb $0x0,0x4(%r12) 0.00 : 5be11e: 0f 85 74 fb ff ff jne 5bdc98 2.08 : 5be124: e9 cd fb ff ff jmpq 5bdcf6 0.00 : 5be129: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * Reset some of the skew optimization state variables, since we no : * longer need to consider skew tuples after the first batch. The : * memory context reset we are about to do will release the skew : * hashtable itself. : */ : hashtable->skewEnabled = false; 0.00 : 5be130: 41 c6 44 24 21 00 movb $0x0,0x21(%r12) : hashtable->skewBucket = NULL; 0.00 : 5be136: 49 c7 44 24 28 00 00 movq $0x0,0x28(%r12) 0.00 : 5be13d: 00 00 : hashtable->skewBucketNums = NULL; 0.00 : 5be13f: 49 c7 44 24 38 00 00 movq $0x0,0x38(%r12) 0.00 : 5be146: 00 00 : hashtable->nSkewBuckets = 0; 0.00 : 5be148: 41 c7 44 24 34 00 00 movl $0x0,0x34(%r12) 0.00 : 5be14f: 00 00 : hashtable->spaceUsedSkew = 0; 0.00 : 5be151: 49 c7 84 24 a8 00 00 movq $0x0,0xa8(%r12) 0.00 : 5be158: 00 00 00 00 00 0.00 : 5be15d: e9 86 fc ff ff jmpq 5bdde8 0.00 : 5be162: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : if (HJ_FILL_INNER(node)) : { : /* no chance to not build the hash table */ : node->hj_FirstOuterTupleSlot = NULL; : } : else if (HJ_FILL_OUTER(node) || 0.00 : 5be168: 49 83 be e0 00 00 00 cmpq $0x0,0xe0(%r14) 0.00 : 5be16f: 00 0.00 : 5be170: 0f 84 aa 00 00 00 je 5be220 : (outerNode->plan->startup_cost < hashNode->ps.plan->total_cost && : !node->hj_OuterNotEmpty)) : { : node->hj_FirstOuterTupleSlot = ExecProcNode(outerNode); 0.00 : 5be176: 48 8b 7d 90 mov -0x70(%rbp),%rdi 0.00 : 5be17a: e8 21 e3 fe ff callq 5ac4a0 : if (TupIsNull(node->hj_FirstOuterTupleSlot)) 0.00 : 5be17f: 48 85 c0 test %rax,%rax : } : else if (HJ_FILL_OUTER(node) || : (outerNode->plan->startup_cost < hashNode->ps.plan->total_cost && : !node->hj_OuterNotEmpty)) : { : node->hj_FirstOuterTupleSlot = ExecProcNode(outerNode); 0.00 : 5be182: 49 89 86 e8 00 00 00 mov %rax,0xe8(%r14) : if (TupIsNull(node->hj_FirstOuterTupleSlot)) 0.00 : 5be189: 0f 84 e8 00 00 00 je 5be277 0.00 : 5be18f: 80 78 04 00 cmpb $0x0,0x4(%rax) 0.00 : 5be193: 0f 85 de 00 00 00 jne 5be277 : { : node->hj_OuterNotEmpty = false; : return NULL; : } : else : node->hj_OuterNotEmpty = true; 0.00 : 5be199: 41 c6 86 f5 00 00 00 movb $0x1,0xf5(%r14) 0.00 : 5be1a0: 01 : if (HJ_FILL_INNER(node)) : { : /* no chance to not build the hash table */ : node->hj_FirstOuterTupleSlot = NULL; : } : else if (HJ_FILL_OUTER(node) || 0.00 : 5be1a1: e9 f3 f9 ff ff jmpq 5bdb99 : /* : * Need to postpone this outer tuple to a later batch. : * Save it in the corresponding outer-batch file. : */ : Assert(batchno > hashtable->curbatch); : ExecHashJoinSaveTuple(ExecFetchSlotMinimalTuple(outerTupleSlot), 0.00 : 5be1a6: 48 98 cltq 0.00 : 5be1a8: 8b 5d d0 mov -0x30(%rbp),%ebx 0.00 : 5be1ab: 4c 89 e7 mov %r12,%rdi 0.00 : 5be1ae: 4c 8d 2c c5 00 00 00 lea 0x0(,%rax,8),%r13 0.00 : 5be1b5: 00 0.00 : 5be1b6: 4c 03 6a 70 add 0x70(%rdx),%r13 0.00 : 5be1ba: e8 91 5d ff ff callq 5b3f50 0.00 : 5be1bf: 89 de mov %ebx,%esi 0.00 : 5be1c1: 48 89 c7 mov %rax,%rdi 0.00 : 5be1c4: 4c 89 ea mov %r13,%rdx 0.00 : 5be1c7: e8 94 f3 ff ff callq 5bd560 : hashvalue, : &hashtable->outerBatchFile[batchno]); : /* Loop around, staying in HJ_NEED_NEW_OUTER state */ : continue; 0.00 : 5be1cc: e9 57 f9 ff ff jmpq 5bdb28 : * Rewind outer batch file (if present), so that we can start reading it. : */ : if (hashtable->outerBatchFile[curbatch] != NULL) : { : if (BufFileSeek(hashtable->outerBatchFile[curbatch], 0, 0L, SEEK_SET)) : ereport(ERROR, 0.00 : 5be1d1: 45 31 c0 xor %r8d,%r8d 0.00 : 5be1d4: b9 f0 ba 88 00 mov $0x88baf0,%ecx 0.00 : 5be1d9: ba 55 03 00 00 mov $0x355,%edx 0.00 : 5be1de: be 58 b9 88 00 mov $0x88b958,%esi 0.00 : 5be1e3: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5be1e8: e8 d3 c8 1b 00 callq 77aac0 0.00 : 5be1ed: 84 c0 test %al,%al 0.00 : 5be1ef: 0f 84 69 f9 ff ff je 5bdb5e 0.00 : 5be1f5: bf d0 b9 88 00 mov $0x88b9d0,%edi 0.00 : 5be1fa: 31 c0 xor %eax,%eax 0.00 : 5be1fc: e8 9f e6 1b 00 callq 77c8a0 0.00 : 5be201: 89 c3 mov %eax,%ebx 0.00 : 5be203: e8 e8 e8 1b 00 callq 77caf0 0.00 : 5be208: 89 de mov %ebx,%esi 0.00 : 5be20a: 89 c7 mov %eax,%edi 0.00 : 5be20c: 31 c0 xor %eax,%eax 0.00 : 5be20e: e8 cd c3 1b 00 callq 77a5e0 0.00 : 5be213: e9 46 f9 ff ff jmpq 5bdb5e 0.00 : 5be218: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5be21f: 00 : if (HJ_FILL_INNER(node)) : { : /* no chance to not build the hash table */ : node->hj_FirstOuterTupleSlot = NULL; : } : else if (HJ_FILL_OUTER(node) || 0.00 : 5be220: 48 8b 4d 90 mov -0x70(%rbp),%rcx 0.00 : 5be224: 48 8b 41 08 mov 0x8(%rcx),%rax 0.00 : 5be228: 48 8b 4d 98 mov -0x68(%rbp),%rcx 0.00 : 5be22c: 48 8b 51 08 mov 0x8(%rcx),%rdx 0.00 : 5be230: f2 0f 10 42 10 movsd 0x10(%rdx),%xmm0 0.00 : 5be235: 66 0f 2e 40 08 ucomisd 0x8(%rax),%xmm0 0.00 : 5be23a: 0f 86 4e f9 ff ff jbe 5bdb8e 0.00 : 5be240: 41 80 be f5 00 00 00 cmpb $0x0,0xf5(%r14) 0.00 : 5be247: 00 0.00 : 5be248: 0f 85 40 f9 ff ff jne 5bdb8e 0.00 : 5be24e: e9 23 ff ff ff jmpq 5be176 : /* : * If the inner relation is completely empty, and we're not : * doing a left outer join, we can quit without scanning the : * outer relation. : */ : if (hashtable->totalTuples == 0 && !HJ_FILL_OUTER(node)) 0.00 : 5be253: 0f 8a 8f f9 ff ff jp 5bdbe8 0.00 : 5be259: 49 83 be e0 00 00 00 cmpq $0x0,0xe0(%r14) 0.00 : 5be260: 00 0.00 : 5be261: 0f 85 81 f9 ff ff jne 5bdbe8 0.00 : 5be267: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5be26e: 00 00 : return NULL; /* end of join */ : node->hj_JoinState = HJ_NEED_NEW_OUTER; : break; : : default: : elog(ERROR, "unrecognized hashjoin state: %d", 0.00 : 5be270: 31 c0 xor %eax,%eax 0.00 : 5be272: e9 21 fd ff ff jmpq 5bdf98 : !node->hj_OuterNotEmpty)) : { : node->hj_FirstOuterTupleSlot = ExecProcNode(outerNode); : if (TupIsNull(node->hj_FirstOuterTupleSlot)) : { : node->hj_OuterNotEmpty = false; 0.00 : 5be277: 41 c6 86 f5 00 00 00 movb $0x0,0xf5(%r14) 0.00 : 5be27e: 00 0.00 : 5be27f: 31 c0 xor %eax,%eax : default: : elog(ERROR, "unrecognized hashjoin state: %d", : (int) node->hj_JoinState); : } : } : } 0.00 : 5be281: e9 12 fd ff ff jmpq 5bdf98 : innerFile = hashtable->innerBatchFile[curbatch]; : : if (innerFile != NULL) : { : if (BufFileSeek(innerFile, 0, 0L, SEEK_SET)) : ereport(ERROR, 0.00 : 5be286: 45 31 c0 xor %r8d,%r8d 0.00 : 5be289: b9 f0 ba 88 00 mov $0x88baf0,%ecx 0.00 : 5be28e: ba 37 03 00 00 mov $0x337,%edx 0.00 : 5be293: e9 46 ff ff ff jmpq 5be1de Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 6.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:74 6.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:74 6.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 6.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 6.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 6.52 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:144 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:99 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:143 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:146 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:70 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:77 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:94 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:136 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:137 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:138 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:139 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:142 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:143 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:146 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 2.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 2.17 /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 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:70 2.17 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:77 2.17 : 5b7bdc: 80 3f 00 cmpb $0x0,(%rdi) : InstrStopNode(Instrumentation *instr, double nTuples) : { : instr_time endtime; : : /* count the returned tuples */ : instr->tuplecount += nTuples; /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:74 6.52 : 5b7bdf: f2 0f 58 47 30 addsd 0x30(%rdi),%xmm0 6.52 : 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) 0.00 : 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); /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 6.52 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 2.17 : 5b7c1c: 48 8b 45 e8 mov -0x18(%rbp),%rax 0.00 : 5b7c20: 48 03 43 20 add 0x20(%rbx),%rax 4.35 : 5b7c24: 48 2b 43 10 sub 0x10(%rbx),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 6.52 : 5b7c28: 48 85 c0 test %rax,%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 2.17 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:83 6.52 : 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) 0.00 : 5b7c83: 75 33 jne 5b7cb8 : BufferUsageAccumDiff(&instr->bufusage, : &pgBufferUsage, &instr->bufusage_start); : : /* Is this the first tuple of this cycle? */ : if (!instr->running) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:94 2.17 : 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 4.35 : 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 2.17 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:137 2.17 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:138 2.17 : 5b7cfc: 48 89 83 e8 00 00 00 mov %rax,0xe8(%rbx) : dst->shared_blks_written += add->shared_blks_written - sub->shared_blks_written; 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:139 2.17 : 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; 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:142 2.17 : 5b7d60: 48 89 83 08 01 00 00 mov %rax,0x108(%rbx) : dst->local_blks_written += add->local_blks_written - sub->local_blks_written; /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:143 2.17 : 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 4.35 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:144 6.52 : 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, 0.00 : 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 0.00 : 5b7dc3: 48 2b 83 88 00 00 00 sub 0x88(%rbx),%rax 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:146 4.35 : 5b7de6: 48 85 c0 test %rax,%rax 0.00 : 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) 2.17 : 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 0.00 : 5b7e4b: 48 2b 83 98 00 00 00 sub 0x98(%rbx),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:148 2.17 : 5b7e52: 48 89 83 38 01 00 00 mov %rax,0x138(%rbx) 2.17 : 5b7e59: 48 8b 05 68 79 60 00 mov 0x607968(%rip),%rax # bbf7c8 2.17 : 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 2.17 : 5b7e6e: 48 85 c0 test %rax,%rax 2.17 : 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) 4.35 : 5b7ec5: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 5b7ecb: 7f e3 jg 5b7eb0 2.17 : 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 ---------------------------------------------- 16.28 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5450 11.63 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5450 11.63 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5450 6.98 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5451 4.65 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5421 4.65 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5424 4.65 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5432 4.65 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5441 4.65 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5451 4.65 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5494 4.65 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5493 2.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5386 2.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5386 2.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5400 2.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5411 2.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5418 2.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5421 2.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5478 2.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5265 2.33 /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 0.00 : 5ad001: 48 89 e5 mov %rsp,%rbp 0.00 : 5ad004: 41 57 push %r15 0.00 : 5ad006: 41 56 push %r14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5386 2.33 : 5ad008: 41 55 push %r13 0.00 : 5ad00a: 41 54 push %r12 0.00 : 5ad00c: 53 push %rbx 2.33 : 5ad00d: 48 89 fb mov %rdi,%rbx 0.00 : 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; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5400 2.33 : 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); 0.00 : 5ad02f: 48 8b 7d b0 mov -0x50(%rbp),%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5411 2.33 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5418 2.33 : 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 4.65 : 5ad048: 8b 73 4c mov 0x4c(%rbx),%esi 2.33 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5424 4.65 : 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; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5432 4.65 : 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; 0.00 : 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 4.65 : 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]; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5451 4.65 : 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 16.28 : 5ad0a3: 41 8b 04 b2 mov (%r10,%rsi,4),%eax 0.00 : 5ad0a7: 48 8b 51 28 mov 0x28(%rcx),%rdx 11.63 : 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 11.63 : 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 6.98 : 5ad0b9: 48 8b 51 30 mov 0x30(%rcx),%rdx 0.00 : 5ad0bd: 0f b6 04 02 movzbl (%rdx,%rax,1),%eax 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5478 2.33 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5265 2.33 : 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 : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5494 4.65 : 5ad1df: 48 83 c4 48 add $0x48,%rsp 0.00 : 5ad1e3: 5b pop %rbx 0.00 : 5ad1e4: 41 5c pop %r12 2.33 : 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); /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5493 4.65 : 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 ---------------------------------------------- 28.57 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:513 16.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:400 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:457 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:510 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:359 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:359 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:364 4.76 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:367 2.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:356 2.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:364 2.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:367 2.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:510 2.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:513 2.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:400 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(); /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:359 4.76 : 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 2.38 : 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 4.76 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:364 2.38 : 5ac4c5: 49 8b 7c 24 18 mov 0x18(%r12),%rdi 4.76 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:367 4.76 : 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)) 2.38 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:510 2.38 : 5ac55d: f2 0f 10 05 f3 2b 20 movsd 0x202bf3(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 5ac564: 00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:510 7.14 : 5ac565: e8 66 b6 00 00 callq 5b7bd0 : : return result; : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:513 2.38 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:513 28.57 : 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); /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:457 14.29 : 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); /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:400 16.67 : 5ac6e0: 4c 89 e7 mov %r12,%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/execProcnode.c:400 2.38 : 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 ---------------------------------------------- 17.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1962 7.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1946 7.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1981 7.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1989 7.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1992 5.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1966 5.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1966 5.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1977 5.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1993 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1962 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/nodes/pg_list.h:87 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1962 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1962 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1966 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1977 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1979 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1979 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1981 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1998 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1998 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1998 2.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1992 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b1430 : : static Datum : ExecMakeFunctionResultNoSets(FuncExprState *fcache, : ExprContext *econtext, : bool *isNull, : ExprDoneCond *isDone) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1946 7.50 : 5b1430: 55 push %rbp 0.00 : 5b1431: 48 89 e5 mov %rsp,%rbp 0.00 : 5b1434: 41 57 push %r15 0.00 : 5b1436: 49 89 d7 mov %rdx,%r15 0.00 : 5b1439: 41 56 push %r14 0.00 : 5b143b: 49 89 f6 mov %rsi,%r14 0.00 : 5b143e: 41 55 push %r13 0.00 : 5b1440: 49 89 fd mov %rdi,%r13 0.00 : 5b1443: 41 54 push %r12 0.00 : 5b1445: 53 push %rbx 0.00 : 5b1446: 48 89 cb mov %rcx,%rbx 0.00 : 5b1449: 48 83 ec 48 sub $0x48,%rsp : FunctionCallInfo fcinfo; : PgStat_FunctionCallUsage fcusage; : int i; : : /* Guard against stack overflow due to overly complex expressions */ : check_stack_depth(); 0.00 : 5b144d: e8 8e a5 0e 00 callq 69b9e0 : : if (isDone) 0.00 : 5b1452: 48 85 db test %rbx,%rbx 0.00 : 5b1455: 74 06 je 5b145d : *isDone = ExprSingleResult; 0.00 : 5b1457: c7 03 00 00 00 00 movl $0x0,(%rbx) : : /* inlined, simplified version of ExecEvalFuncArgs */ : fcinfo = &fcache->fcinfo_data; : i = 0; : foreach(arg, fcache->args) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1962 2.50 : 5b145d: 49 8b 45 18 mov 0x18(%r13),%rax : #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 2.50 : 5b1461: 48 85 c0 test %rax,%rax 0.00 : 5b1464: 0f 84 c2 00 00 00 je 5b152c 0.00 : 5b146a: 4c 8b 60 08 mov 0x8(%rax),%r12 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1962 2.50 : 5b146e: 4d 85 e4 test %r12,%r12 0.00 : 5b1471: 0f 84 b5 00 00 00 je 5b152c 2.50 : 5b1477: 31 db xor %ebx,%ebx 0.00 : 5b1479: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : { : ExprState *argstate = (ExprState *) lfirst(arg); 0.00 : 5b1480: 49 8b 04 24 mov (%r12),%rax : : fcinfo->arg[i] = ExecEvalExpr(argstate, /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1966 5.00 : 5b1484: 49 8d 94 1d b0 03 00 lea 0x3b0(%r13,%rbx,1),%rdx 0.00 : 5b148b: 00 0.00 : 5b148c: 31 c9 xor %ecx,%ecx 0.00 : 5b148e: 4c 89 f6 mov %r14,%rsi 0.00 : 5b1491: 48 89 c7 mov %rax,%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1966 2.50 : 5b1494: ff 50 10 callq *0x10(%rax) 0.00 : 5b1497: 49 89 84 dd 90 00 00 mov %rax,0x90(%r13,%rbx,8) 0.00 : 5b149e: 00 : *isDone = ExprSingleResult; : : /* inlined, simplified version of ExecEvalFuncArgs */ : fcinfo = &fcache->fcinfo_data; : i = 0; : foreach(arg, fcache->args) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1962 17.50 : 5b149f: 4d 8b 64 24 08 mov 0x8(%r12),%r12 : { : ExprState *argstate = (ExprState *) lfirst(arg); : : fcinfo->arg[i] = ExecEvalExpr(argstate, /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1966 5.00 : 5b14a4: 8d 53 01 lea 0x1(%rbx),%edx : *isDone = ExprSingleResult; : : /* inlined, simplified version of ExecEvalFuncArgs */ : fcinfo = &fcache->fcinfo_data; : i = 0; : foreach(arg, fcache->args) 0.00 : 5b14a7: 48 83 c3 01 add $0x1,%rbx 0.00 : 5b14ab: 4d 85 e4 test %r12,%r12 0.00 : 5b14ae: 75 d0 jne 5b1480 : : /* : * If function is strict, and there are any NULL arguments, skip calling : * the function and return NULL. : */ : if (fcache->func.fn_strict) 0.00 : 5b14b0: 41 80 7d 2e 00 cmpb $0x0,0x2e(%r13) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1977 2.50 : 5b14b5: 74 34 je 5b14eb /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1977 5.00 : 5b14b7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5b14be: 00 00 : { : while (--i >= 0) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1979 2.50 : 5b14c0: 83 ea 01 sub $0x1,%edx 2.50 : 5b14c3: 78 26 js 5b14eb : { : if (fcinfo->argnull[i]) 0.00 : 5b14c5: 48 63 c2 movslq %edx,%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1981 2.50 : 5b14c8: 41 80 bc 05 b0 03 00 cmpb $0x0,0x3b0(%r13,%rax,1) 0.00 : 5b14cf: 00 00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1981 7.50 : 5b14d1: 74 ed je 5b14c0 : { : *isNull = true; 0.00 : 5b14d3: 41 c6 07 01 movb $0x1,(%r15) 0.00 : 5b14d7: 31 db xor %ebx,%ebx : *isNull = fcinfo->isnull; : : pgstat_end_function_usage(&fcusage, true); : : return result; : } 0.00 : 5b14d9: 48 83 c4 48 add $0x48,%rsp 0.00 : 5b14dd: 48 89 d8 mov %rbx,%rax 0.00 : 5b14e0: 5b pop %rbx 0.00 : 5b14e1: 41 5c pop %r12 0.00 : 5b14e3: 41 5d pop %r13 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1998 2.50 : 5b14e5: 41 5e pop %r14 0.00 : 5b14e7: 41 5f pop %r15 2.50 : 5b14e9: c9 leaveq 2.50 : 5b14ea: c3 retq : : if (isDone) : *isDone = ExprSingleResult; : : /* inlined, simplified version of ExecEvalFuncArgs */ : fcinfo = &fcache->fcinfo_data; 0.00 : 5b14eb: 49 8d 5d 70 lea 0x70(%r13),%rbx : return (Datum) 0; : } : } : } : : pgstat_init_function_usage(fcinfo, &fcusage); 0.00 : 5b14ef: 4c 8d 65 90 lea -0x70(%rbp),%r12 0.00 : 5b14f3: 48 89 df mov %rbx,%rdi 0.00 : 5b14f6: 4c 89 e6 mov %r12,%rsi /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1989 7.50 : 5b14f9: e8 82 12 09 00 callq 642780 : : fcinfo->isnull = false; : result = FunctionCallInvoke(fcinfo); /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1992 2.50 : 5b14fe: 49 8b 45 70 mov 0x70(%r13),%rax 0.00 : 5b1502: 48 89 df mov %rbx,%rdi : } : } : : pgstat_init_function_usage(fcinfo, &fcusage); : : fcinfo->isnull = false; 0.00 : 5b1505: 41 c6 85 8c 00 00 00 movb $0x0,0x8c(%r13) 0.00 : 5b150c: 00 : result = FunctionCallInvoke(fcinfo); 0.00 : 5b150d: ff 10 callq *(%rax) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1992 7.50 : 5b150f: 48 89 c3 mov %rax,%rbx : *isNull = fcinfo->isnull; 0.00 : 5b1512: 41 0f b6 85 8c 00 00 movzbl 0x8c(%r13),%eax 0.00 : 5b1519: 00 : : pgstat_end_function_usage(&fcusage, true); 0.00 : 5b151a: be 01 00 00 00 mov $0x1,%esi 0.00 : 5b151f: 4c 89 e7 mov %r12,%rdi : : pgstat_init_function_usage(fcinfo, &fcusage); : : fcinfo->isnull = false; : result = FunctionCallInvoke(fcinfo); : *isNull = fcinfo->isnull; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1993 5.00 : 5b1522: 41 88 07 mov %al,(%r15) : : pgstat_end_function_usage(&fcusage, true); 0.00 : 5b1525: e8 a6 10 09 00 callq 6425d0 : : return result; : } 0.00 : 5b152a: eb ad jmp 5b14d9 : *isDone = ExprSingleResult; : : /* inlined, simplified version of ExecEvalFuncArgs */ : fcinfo = &fcache->fcinfo_data; : i = 0; : foreach(arg, fcache->args) 0.00 : 5b152c: 31 d2 xor %edx,%edx 0.00 : 5b152e: eb 80 jmp 5b14b0 Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 15.15 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5169 9.09 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 9.09 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5179 9.09 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5161 9.09 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5190 6.06 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 6.06 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/nodes/pg_list.h:87 6.06 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5167 6.06 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5190 3.03 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 3.03 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 3.03 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 3.03 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 3.03 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 3.03 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5167 3.03 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5169 3.03 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5190 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005acf10 : : * : * ---------------------------------------------------------------- : */ : bool : ExecQual(List *qual, ExprContext *econtext, bool resultForNull) : { 0.00 : 5acf10: 55 push %rbp 0.00 : 5acf11: 48 89 e5 mov %rsp,%rbp 0.00 : 5acf14: 41 57 push %r15 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 3.03 : 5acf16: 41 56 push %r14 3.03 : 5acf18: 41 89 d6 mov %edx,%r14d /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 6.06 : 5acf1b: 41 55 push %r13 0.00 : 5acf1d: 41 54 push %r12 0.00 : 5acf1f: 49 89 f4 mov %rsi,%r12 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 3.03 : 5acf22: 53 push %rbx /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5130 9.09 : 5acf23: 48 83 ec 18 sub $0x18,%rsp : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; : : CurrentMemoryContext = context; /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 3.03 : 5acf27: 48 8b 46 28 mov 0x28(%rsi),%rax : #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 6.06 : 5acf2b: 48 85 ff test %rdi,%rdi : #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 3.03 : 5acf2e: 4c 8b 3d 2b d9 60 00 mov 0x60d92b(%rip),%r15 # bba860 : : CurrentMemoryContext = context; 0.00 : 5acf35: 48 89 05 24 d9 60 00 mov %rax,0x60d924(%rip) # bba860 0.00 : 5acf3c: 74 4a je 5acf88 0.00 : 5acf3e: 48 8b 5f 08 mov 0x8(%rdi),%rbx : * or more NULL subresult, with all the rest TRUE) and the caller has : * specified resultForNull = TRUE. : */ : result = true; : : foreach(l, qual) 0.00 : 5acf42: 48 85 db test %rbx,%rbx 0.00 : 5acf45: 74 41 je 5acf88 0.00 : 5acf47: 4c 8d 6d d7 lea -0x29(%rbp),%r13 0.00 : 5acf4b: eb 11 jmp 5acf5e 0.00 : 5acf4d: 0f 1f 00 nopl (%rax) : : expr_value = ExecEvalExpr(clause, econtext, &isNull, NULL); : : if (isNull) : { : if (resultForNull == false) 0.00 : 5acf50: 45 84 f6 test %r14b,%r14b 0.00 : 5acf53: 74 24 je 5acf79 : * or more NULL subresult, with all the rest TRUE) and the caller has : * specified resultForNull = TRUE. : */ : result = true; : : foreach(l, qual) 0.00 : 5acf55: 48 8b 5b 08 mov 0x8(%rbx),%rbx 0.00 : 5acf59: 48 85 db test %rbx,%rbx 0.00 : 5acf5c: 74 2a je 5acf88 : { : ExprState *clause = (ExprState *) lfirst(l); 0.00 : 5acf5e: 48 8b 03 mov (%rbx),%rax : Datum expr_value; : bool isNull; : : expr_value = ExecEvalExpr(clause, econtext, &isNull, NULL); 0.00 : 5acf61: 31 c9 xor %ecx,%ecx 0.00 : 5acf63: 4c 89 ea mov %r13,%rdx /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5167 6.06 : 5acf66: 4c 89 e6 mov %r12,%rsi 0.00 : 5acf69: 48 89 c7 mov %rax,%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5167 3.03 : 5acf6c: ff 50 10 callq *0x10(%rax) : : if (isNull) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5169 3.03 : 5acf6f: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5169 15.15 : 5acf73: 75 db jne 5acf50 : break; : } : } : else : { : if (!DatumGetBool(expr_value)) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5179 9.09 : 5acf75: 84 c0 test %al,%al 0.00 : 5acf77: 75 dc jne 5acf55 : * or more NULL subresult, with all the rest TRUE) and the caller has : * specified resultForNull = TRUE. : */ : result = true; : : foreach(l, qual) 0.00 : 5acf79: 31 c0 xor %eax,%eax 0.00 : 5acf7b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5acf80: eb 0b jmp 5acf8d 0.00 : 5acf82: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5161 9.09 : 5acf88: b8 01 00 00 00 mov $0x1,%eax 0.00 : 5acf8d: 4c 89 3d cc d8 60 00 mov %r15,0x60d8cc(%rip) # bba860 : } : : MemoryContextSwitchTo(oldContext); : : return result; : } 0.00 : 5acf94: 48 83 c4 18 add $0x18,%rsp /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5190 6.06 : 5acf98: 5b pop %rbx /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5190 3.03 : 5acf99: 41 5c pop %r12 0.00 : 5acf9b: 41 5d pop %r13 0.00 : 5acf9d: 41 5e pop %r14 0.00 : 5acf9f: 41 5f pop %r15 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:5190 9.09 : 5acfa1: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 45.16 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:664 19.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:673 9.68 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:676 6.45 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:673 6.45 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:695 3.23 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:664 3.23 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:669 3.23 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:687 3.23 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:694 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) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:664 45.16 : 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) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:664 3.23 : 5b16a8: 48 89 e5 mov %rsp,%rbp : Var *variable = (Var *) exprstate->expr; : TupleTableSlot *slot; : AttrNumber attnum; : : if (isDone) /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:669 3.23 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:673 19.35 : 5b16b7: 3d e8 fd 00 00 cmp $0xfde8,%eax 0.00 : 5b16bc: 74 1a je 5b16d8 6.45 : 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; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:687 3.23 : 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); /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:694 3.23 : 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; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:676 9.68 : 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 6.45 : 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 ---------------------------------------------- 31.03 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:147 13.79 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:143 10.34 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:147 10.34 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:151 10.34 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:158 6.90 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:143 6.90 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:143 6.90 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:151 3.45 /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) : { /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:143 6.90 : 7989b0: 55 push %rbp 0.00 : 7989b1: 48 89 e5 mov %rsp,%rbp 13.79 : 7989b4: 53 push %rbx 0.00 : 7989b5: 48 89 fb mov %rdi,%rbx 6.90 : 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) /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:147 10.34 : 7989bc: 48 83 7f 18 00 cmpq $0x0,0x18(%rdi) 31.03 : 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) /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:151 10.34 : 7989c8: 80 7b 30 00 cmpb $0x0,0x30(%rbx) 6.90 : 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 3.45 : 7989dc: 48 83 c4 08 add $0x8,%rsp 0.00 : 7989e0: 5b pop %rbx /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/mcxt.c:158 10.34 : 7989e1: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 53.85 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1307 30.77 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1253 3.85 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1287 3.85 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1290 3.85 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1290 3.85 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1296 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000783ac0 : : register_seq_scan(hashp); : } : : void * : hash_seq_search(HASH_SEQ_STATUS *status) : { 0.00 : 783ac0: 55 push %rbp : long segment_ndx; : HASHSEGMENT segp; : uint32 curBucket; : HASHELEMENT *curElem; : : if ((curElem = status->curEntry) != NULL) 0.00 : 783ac1: 48 8b 57 10 mov 0x10(%rdi),%rdx : register_seq_scan(hashp); : } : : void * : hash_seq_search(HASH_SEQ_STATUS *status) : { 0.00 : 783ac5: 48 89 e5 mov %rsp,%rbp : long segment_ndx; : HASHSEGMENT segp; : uint32 curBucket; : HASHELEMENT *curElem; : : if ((curElem = status->curEntry) != NULL) 0.00 : 783ac8: 48 85 d2 test %rdx,%rdx 0.00 : 783acb: 74 1b je 783ae8 : { : /* Continuing scan of curBucket... */ : status->curEntry = curElem->link; 0.00 : 783acd: 48 8b 02 mov (%rdx),%rax : if (status->curEntry == NULL) /* end of this bucket */ /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1253 30.77 : 783ad0: 48 85 c0 test %rax,%rax : HASHELEMENT *curElem; : : if ((curElem = status->curEntry) != NULL) : { : /* Continuing scan of curBucket... */ : status->curEntry = curElem->link; 0.00 : 783ad3: 48 89 47 10 mov %rax,0x10(%rdi) : if (status->curEntry == NULL) /* end of this bucket */ 0.00 : 783ad7: 0f 84 8b 00 00 00 je 783b68 : ++status->curBucket; : return (void *) ELEMENTKEY(curElem); 0.00 : 783add: 48 8d 42 10 lea 0x10(%rdx),%rax : status->curEntry = curElem->link; : if (status->curEntry == NULL) /* end of this bucket */ : ++curBucket; : status->curBucket = curBucket; : return (void *) ELEMENTKEY(curElem); : } 0.00 : 783ae1: c9 leaveq 0.00 : 783ae2: c3 retq 0.00 : 783ae3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : : /* : * Search for next nonempty bucket starting at curBucket. : */ : curBucket = status->curBucket; : hashp = status->hashp; 0.00 : 783ae8: 4c 8b 0f mov (%rdi),%r9 : } : : /* : * Search for next nonempty bucket starting at curBucket. : */ : curBucket = status->curBucket; 0.00 : 783aeb: 8b 77 08 mov 0x8(%rdi),%esi : hashp = status->hashp; : hctl = hashp->hctl; : ssize = hashp->ssize; : max_bucket = hctl->max_bucket; 0.00 : 783aee: 49 8b 01 mov (%r9),%rax : * Search for next nonempty bucket starting at curBucket. : */ : curBucket = status->curBucket; : hashp = status->hashp; : hctl = hashp->hctl; : ssize = hashp->ssize; 0.00 : 783af1: 4d 8b 59 50 mov 0x50(%r9),%r11 : max_bucket = hctl->max_bucket; 0.00 : 783af5: 44 8b 50 28 mov 0x28(%rax),%r10d : : if (curBucket > max_bucket) 0.00 : 783af9: 44 39 d6 cmp %r10d,%esi 0.00 : 783afc: 77 7d ja 783b7b : } : : /* : * first find the right segment in the table directory. : */ : segment_num = curBucket >> hashp->sshift; 0.00 : 783afe: 41 8b 49 58 mov 0x58(%r9),%ecx 0.00 : 783b02: 89 f0 mov %esi,%eax : segment_ndx = MOD(curBucket, ssize); 0.00 : 783b04: 89 f2 mov %esi,%edx : } : : /* : * first find the right segment in the table directory. : */ : segment_num = curBucket >> hashp->sshift; 0.00 : 783b06: d3 e8 shr %cl,%eax 0.00 : 783b08: 41 89 c0 mov %eax,%r8d : segment_ndx = MOD(curBucket, ssize); 0.00 : 783b0b: 49 8d 43 ff lea -0x1(%r11),%rax 0.00 : 783b0f: 21 c2 and %eax,%edx : : segp = hashp->dir[segment_num]; 0.00 : 783b11: 49 8b 41 08 mov 0x8(%r9),%rax 0.00 : 783b15: 4e 8b 0c c0 mov (%rax,%r8,8),%r9 0.00 : 783b19: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * Pick up the first item in this bucket's chain. If chain is not empty : * we can begin searching it. Otherwise we have to advance to find the : * next nonempty bucket. We try to optimize that case since searching a : * near-empty hashtable has to iterate this loop a lot. : */ : while ((curElem = segp[segment_ndx]) == NULL) 0.00 : 783b20: 49 8b 0c d1 mov (%r9,%rdx,8),%rcx /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1287 3.85 : 783b24: 48 85 c9 test %rcx,%rcx 0.00 : 783b27: 75 24 jne 783b4d : { : /* empty bucket, advance to next */ : if (++curBucket > max_bucket) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1290 3.85 : 783b29: 83 c6 01 add $0x1,%esi 3.85 : 783b2c: 41 39 f2 cmp %esi,%r10d 0.00 : 783b2f: 72 47 jb 783b78 : { : status->curBucket = curBucket; : hash_seq_term(status); : return NULL; /* search is done */ : } : if (++segment_ndx >= ssize) /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1296 3.85 : 783b31: 48 83 c2 01 add $0x1,%rdx 0.00 : 783b35: 49 39 d3 cmp %rdx,%r11 0.00 : 783b38: 7f e6 jg 783b20 : { : segment_num++; 0.00 : 783b3a: 49 83 c0 01 add $0x1,%r8 : segment_ndx = 0; : segp = hashp->dir[segment_num]; 0.00 : 783b3e: 31 d2 xor %edx,%edx 0.00 : 783b40: 4e 8b 0c c0 mov (%rax,%r8,8),%r9 : * Pick up the first item in this bucket's chain. If chain is not empty : * we can begin searching it. Otherwise we have to advance to find the : * next nonempty bucket. We try to optimize that case since searching a : * near-empty hashtable has to iterate this loop a lot. : */ : while ((curElem = segp[segment_ndx]) == NULL) 0.00 : 783b44: 49 8b 0c d1 mov (%r9,%rdx,8),%rcx 0.00 : 783b48: 48 85 c9 test %rcx,%rcx 0.00 : 783b4b: 74 dc je 783b29 : segp = hashp->dir[segment_num]; : } : } : : /* Begin scan of curBucket... */ : status->curEntry = curElem->link; 0.00 : 783b4d: 48 8b 01 mov (%rcx),%rax : if (status->curEntry == NULL) /* end of this bucket */ : ++curBucket; /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:1307 53.85 : 783b50: 48 83 f8 01 cmp $0x1,%rax : segp = hashp->dir[segment_num]; : } : } : : /* Begin scan of curBucket... */ : status->curEntry = curElem->link; 0.00 : 783b54: 48 89 47 10 mov %rax,0x10(%rdi) : if (status->curEntry == NULL) /* end of this bucket */ : ++curBucket; : status->curBucket = curBucket; : return (void *) ELEMENTKEY(curElem); 0.00 : 783b58: 48 8d 41 10 lea 0x10(%rcx),%rax : } : : /* Begin scan of curBucket... */ : status->curEntry = curElem->link; : if (status->curEntry == NULL) /* end of this bucket */ : ++curBucket; 0.00 : 783b5c: 83 d6 00 adc $0x0,%esi : status->curBucket = curBucket; 0.00 : 783b5f: 89 77 08 mov %esi,0x8(%rdi) : return (void *) ELEMENTKEY(curElem); : } 0.00 : 783b62: c9 leaveq 0.00 : 783b63: c3 retq 0.00 : 783b64: 0f 1f 40 00 nopl 0x0(%rax) : if ((curElem = status->curEntry) != NULL) : { : /* Continuing scan of curBucket... */ : status->curEntry = curElem->link; : if (status->curEntry == NULL) /* end of this bucket */ : ++status->curBucket; 0.00 : 783b68: 83 47 08 01 addl $0x1,0x8(%rdi) 0.00 : 783b6c: e9 6c ff ff ff jmpq 783add 0.00 : 783b71: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : while ((curElem = segp[segment_ndx]) == NULL) : { : /* empty bucket, advance to next */ : if (++curBucket > max_bucket) : { : status->curBucket = curBucket; 0.00 : 783b78: 89 77 08 mov %esi,0x8(%rdi) : hash_seq_term(status); 0.00 : 783b7b: e8 a0 fe ff ff callq 783a20 0.00 : 783b80: 31 c0 xor %eax,%eax : status->curEntry = curElem->link; : if (status->curEntry == NULL) /* end of this bucket */ : ++curBucket; : status->curBucket = curBucket; : return (void *) ELEMENTKEY(curElem); : } 0.00 : 783b82: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 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 8.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:53 8.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:63 8.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:54 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:56 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:57 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:57 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:57 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 4.17 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:65 4.17 /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 /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:53 8.33 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:54 4.17 : 5b7f0f: 74 4a je 5b7f5b : { : if (INSTR_TIME_IS_ZERO(instr->starttime)) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:56 4.17 : 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); /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:57 4.17 : 5b7f50: 48 8d 7f 08 lea 0x8(%rdi),%rdi 4.17 : 5b7f54: 31 f6 xor %esi,%esi 4.17 : 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 8.33 : 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 4.17 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 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) 12.50 : 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) 0.00 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 4.17 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:64 8.33 : 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) : } /home/Computational/mark/src/postgres-andres/src/backend/executor/instrument.c:65 4.17 : 5b800e: 48 83 c4 08 add $0x8,%rsp 0.00 : 5b8012: 5b pop %rbx 4.17 : 5b8013: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 26.09 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:459 21.74 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:466 8.70 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:450 8.70 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:465 8.70 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:484 8.70 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:484 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:450 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:450 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:472 4.35 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:484 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 */ : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:450 8.70 : 5b4110: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:450 4.35 : 5b4111: 48 89 e5 mov %rsp,%rbp 0.00 : 5b4114: 53 push %rbx 4.35 : 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 26.09 : 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)) 0.00 : 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; /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:465 8.70 : 5b4133: 48 c7 43 38 00 00 00 movq $0x0,0x38(%rbx) 0.00 : 5b413a: 00 : slot->tts_shouldFree = false; /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:466 21.74 : 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)) /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:472 4.35 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:484 8.70 : 5b4165: 5b pop %rbx /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:484 4.35 : 5b4166: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:484 8.70 : 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 0.00 : 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 ---------------------------------------------- 72.73 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1870 9.09 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1874 4.55 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1857 4.55 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1858 4.55 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1872 4.55 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1901 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 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1857 4.55 : 675269: 48 89 5d e8 mov %rbx,-0x18(%rbp) : volatile BufferDesc *bufHdr = &BufferDescriptors[buf_id]; /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1858 4.55 : 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 72.73 : 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 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1872 4.55 : 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 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1874 9.09 : 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 0.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; : } /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1901 4.55 : 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 ---------------------------------------------- 52.38 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:720 33.33 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:697 4.76 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:710 4.76 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:780 4.76 /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 33.33 : 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; /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:710 4.76 : 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 52.38 : 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 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:780 4.76 : 782d59: f3 a6 repz cmpsb %es:(%rdi),%ds:(%rsi) 4.76 : 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 /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 15.79 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1044 10.53 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1350 10.53 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1043 10.53 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1048 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1425 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1455 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1350 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/nodes/pg_list.h:87 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/nodes/pg_list.h:87 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1044 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1048 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1049 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1057 5.26 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1359 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b9d80 : : * stored in the expression context to be used when ExecProject evaluates : * the result tuple. : */ : TupleTableSlot * : ExecAgg(AggState *node) : { 0.00 : 5b9d80: 55 push %rbp 0.00 : 5b9d81: 48 89 e5 mov %rsp,%rbp 0.00 : 5b9d84: 41 57 push %r15 0.00 : 5b9d86: 41 56 push %r14 0.00 : 5b9d88: 49 89 fe mov %rdi,%r14 0.00 : 5b9d8b: 41 55 push %r13 0.00 : 5b9d8d: 41 54 push %r12 0.00 : 5b9d8f: 53 push %rbx 0.00 : 5b9d90: 48 81 ec d8 00 00 00 sub $0xd8,%rsp : /* : * Check to see if we're still projecting out tuples from a previous agg : * tuple (because there is a function-returning-set in the projection : * expressions). If so, try to project another one. : */ : if (node->ss.ps.ps_TupFromTlist) 0.00 : 5b9d97: 80 7f 70 00 cmpb $0x0,0x70(%rdi) 0.00 : 5b9d9b: 74 1c je 5b9db9 : { : TupleTableSlot *result; : ExprDoneCond isDone; : : result = ExecProject(node->ss.ps.ps_ProjInfo, &isDone); 0.00 : 5b9d9d: 48 8b 7f 68 mov 0x68(%rdi),%rdi 0.00 : 5b9da1: 48 8d 75 d4 lea -0x2c(%rbp),%rsi 0.00 : 5b9da5: e8 56 32 ff ff callq 5ad000 : if (isDone == ExprMultipleResult) 0.00 : 5b9daa: 83 7d d4 01 cmpl $0x1,-0x2c(%rbp) 0.00 : 5b9dae: 0f 84 04 02 00 00 je 5b9fb8 : return result; : /* Done with that source tuple... */ : node->ss.ps.ps_TupFromTlist = false; 0.00 : 5b9db4: 41 c6 46 70 00 movb $0x0,0x70(%r14) : /* : * Exit if nothing left to do. (We must do the ps_TupFromTlist check : * first, because in some cases agg_done gets set before we emit the final : * aggregate tuple, and we have to finish running SRFs for it.) : */ : if (node->agg_done) 0.00 : 5b9db9: 31 c0 xor %eax,%eax 0.00 : 5b9dbb: 41 80 be d0 00 00 00 cmpb $0x0,0xd0(%r14) 0.00 : 5b9dc2: 00 0.00 : 5b9dc3: 0f 85 ef 01 00 00 jne 5b9fb8 : return NULL; : : /* Dispatch based on strategy */ : if (((Agg *) node->ss.ps.plan)->aggstrategy == AGG_HASHED) 0.00 : 5b9dc9: 49 8b 46 08 mov 0x8(%r14),%rax 0.00 : 5b9dcd: 48 89 85 10 ff ff ff mov %rax,-0xf0(%rbp) 0.00 : 5b9dd4: 83 78 60 02 cmpl $0x2,0x60(%rax) 0.00 : 5b9dd8: 0f 85 ec 01 00 00 jne 5b9fca : { : if (!node->table_filled) 0.00 : 5b9dde: 31 c0 xor %eax,%eax 0.00 : 5b9de0: 41 80 be 00 01 00 00 cmpb $0x0,0x100(%r14) 0.00 : 5b9de7: 00 0.00 : 5b9de8: 4d 8d be 08 01 00 00 lea 0x108(%r14),%r15 0.00 : 5b9def: 0f 84 5d 07 00 00 je 5ba552 : : /* : * get state info from node : */ : /* econtext is the per-output-tuple expression context */ : econtext = aggstate->ss.ps.ps_ExprContext; 0.00 : 5b9df5: 4d 8b 6e 60 mov 0x60(%r14),%r13 : aggvalues = econtext->ecxt_aggvalues; 0.00 : 5b9df9: 49 8b 55 40 mov 0x40(%r13),%rdx 0.00 : 5b9dfd: 48 89 95 30 ff ff ff mov %rdx,-0xd0(%rbp) : aggnulls = econtext->ecxt_aggnulls; 0.00 : 5b9e04: 49 8b 55 48 mov 0x48(%r13),%rdx 0.00 : 5b9e08: 48 89 95 28 ff ff ff mov %rdx,-0xd8(%rbp) : peragg = aggstate->peragg; 0.00 : 5b9e0f: 49 8b 96 b0 00 00 00 mov 0xb0(%r14),%rdx 0.00 : 5b9e16: 48 89 95 20 ff ff ff mov %rdx,-0xe0(%rbp) : firstSlot = aggstate->ss.ss_ScanTupleSlot; 0.00 : 5b9e1d: 49 8b 96 88 00 00 00 mov 0x88(%r14),%rdx 0.00 : 5b9e24: 48 89 95 18 ff ff ff mov %rdx,-0xe8(%rbp) : : /* : * We loop retrieving groups until we find one satisfying : * aggstate->ss.ps.qual : */ : while (!aggstate->agg_done) 0.00 : 5b9e2b: 84 c0 test %al,%al 0.00 : 5b9e2d: 0f 85 83 01 00 00 jne 5b9fb6 : { : /* : * Find the next entry in the hash table : */ : entry = (AggHashEntry) ScanTupleHashTable(&aggstate->hashiter); 0.00 : 5b9e33: 4c 89 ff mov %r15,%rdi 0.00 : 5b9e36: e8 85 9c 1c 00 callq 783ac0 : if (entry == NULL) 0.00 : 5b9e3b: 48 85 c0 test %rax,%rax : while (!aggstate->agg_done) : { : /* : * Find the next entry in the hash table : */ : entry = (AggHashEntry) ScanTupleHashTable(&aggstate->hashiter); 0.00 : 5b9e3e: 49 89 c4 mov %rax,%r12 : if (entry == NULL) 0.00 : 5b9e41: 0f 84 fc 06 00 00 je 5ba543 : * : * We intentionally don't use ReScanExprContext here; if any aggs have : * registered shutdown callbacks, they mustn't be called yet, since we : * might not be done with that agg. : */ : ResetExprContext(econtext); 0.00 : 5b9e47: 49 8b 7d 28 mov 0x28(%r13),%rdi 0.00 : 5b9e4b: e8 60 eb 1d 00 callq 7989b0 : : /* : * Store the copied first input tuple in the tuple table slot reserved : * for it, so that it can be used in ExecProject. : */ : ExecStoreMinimalTuple(entry->shared.firstTuple, 0.00 : 5b9e50: 48 8b b5 18 ff ff ff mov -0xe8(%rbp),%rsi 0.00 : 5b9e57: 49 8b 3c 24 mov (%r12),%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1425 5.26 : 5b9e5b: 31 d2 xor %edx,%edx 0.00 : 5b9e5d: e8 7e a5 ff ff callq 5b43e0 : : /* : * Finalize each aggregate calculation, and stash results in the : * per-output-tuple context. : */ : for (aggno = 0; aggno < aggstate->numaggs; aggno++) 0.00 : 5b9e62: 41 8b 96 98 00 00 00 mov 0x98(%r14),%edx 0.00 : 5b9e69: 85 d2 test %edx,%edx 0.00 : 5b9e6b: 7e 49 jle 5b9eb6 0.00 : 5b9e6d: 31 db xor %ebx,%ebx : { : AggStatePerAgg peraggstate = &peragg[aggno]; : AggStatePerGroup pergroupstate = &pergroup[aggno]; : : Assert(peraggstate->numSortCols == 0); : finalize_aggregate(aggstate, peraggstate, pergroupstate, 0.00 : 5b9e6f: 48 8b 85 30 ff ff ff mov -0xd0(%rbp),%rax : * Finalize each aggregate calculation, and stash results in the : * per-output-tuple context. : */ : for (aggno = 0; aggno < aggstate->numaggs; aggno++) : { : AggStatePerAgg peraggstate = &peragg[aggno]; 0.00 : 5b9e76: 48 63 fb movslq %ebx,%rdi : : /* : * Finalize each aggregate calculation, and stash results in the : * per-output-tuple context. : */ : for (aggno = 0; aggno < aggstate->numaggs; aggno++) 0.00 : 5b9e79: 83 c3 01 add $0x1,%ebx : { : AggStatePerAgg peraggstate = &peragg[aggno]; : AggStatePerGroup pergroupstate = &pergroup[aggno]; : : Assert(peraggstate->numSortCols == 0); : finalize_aggregate(aggstate, peraggstate, pergroupstate, 0.00 : 5b9e7c: 48 69 f7 a8 04 00 00 imul $0x4a8,%rdi,%rsi 0.00 : 5b9e83: 48 03 b5 20 ff ff ff add -0xe0(%rbp),%rsi 0.00 : 5b9e8a: 48 8d 0c f8 lea (%rax,%rdi,8),%rcx 0.00 : 5b9e8e: 48 89 f8 mov %rdi,%rax 0.00 : 5b9e91: 48 c1 e0 04 shl $0x4,%rax 0.00 : 5b9e95: 49 8d 54 04 08 lea 0x8(%r12,%rax,1),%rdx 0.00 : 5b9e9a: 48 8b 85 28 ff ff ff mov -0xd8(%rbp),%rax 0.00 : 5b9ea1: 4c 8d 04 38 lea (%rax,%rdi,1),%r8 0.00 : 5b9ea5: 4c 89 f7 mov %r14,%rdi 0.00 : 5b9ea8: e8 13 fc ff ff callq 5b9ac0 : : /* : * Finalize each aggregate calculation, and stash results in the : * per-output-tuple context. : */ : for (aggno = 0; aggno < aggstate->numaggs; aggno++) 0.00 : 5b9ead: 41 3b 9e 98 00 00 00 cmp 0x98(%r14),%ebx 0.00 : 5b9eb4: 7c b9 jl 5b9e6f : : /* : * Use the representative input tuple for any references to : * non-aggregated input columns in the qual and tlist. : */ : econtext->ecxt_outertuple = firstSlot; 0.00 : 5b9eb6: 48 8b 95 18 ff ff ff mov -0xe8(%rbp),%rdx : : /* : * Check the qual (HAVING clause); if the group does not match, ignore : * it and loop back to try to process another group. : */ : if (ExecQual(aggstate->ss.ps.qual, econtext, false)) 0.00 : 5b9ebd: 4c 89 ee mov %r13,%rsi : : /* : * Use the representative input tuple for any references to : * non-aggregated input columns in the qual and tlist. : */ : econtext->ecxt_outertuple = firstSlot; 0.00 : 5b9ec0: 49 89 55 18 mov %rdx,0x18(%r13) : : /* : * Check the qual (HAVING clause); if the group does not match, ignore : * it and loop back to try to process another group. : */ : if (ExecQual(aggstate->ss.ps.qual, econtext, false)) 0.00 : 5b9ec4: 49 8b 7e 28 mov 0x28(%r14),%rdi 0.00 : 5b9ec8: 31 d2 xor %edx,%edx 0.00 : 5b9eca: e8 41 30 ff ff callq 5acf10 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1455 5.26 : 5b9ecf: 84 c0 test %al,%al 0.00 : 5b9ed1: 0f 85 4e 06 00 00 jne 5ba525 : (isDone == ExprMultipleResult); : return result; : } : } : else : InstrCountFiltered1(aggstate, 1); 0.00 : 5b9ed7: 49 8b 46 18 mov 0x18(%r14),%rax 0.00 : 5b9edb: 48 85 c0 test %rax,%rax 0.00 : 5b9ede: 74 18 je 5b9ef8 0.00 : 5b9ee0: f2 0f 10 05 70 52 1f movsd 0x1f5270(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 5b9ee7: 00 0.00 : 5b9ee8: f2 0f 58 80 c8 00 00 addsd 0xc8(%rax),%xmm0 0.00 : 5b9eef: 00 0.00 : 5b9ef0: f2 0f 11 80 c8 00 00 movsd %xmm0,0xc8(%rax) 0.00 : 5b9ef7: 00 0.00 : 5b9ef8: 41 0f b6 86 d0 00 00 movzbl 0xd0(%r14),%eax 0.00 : 5b9eff: 00 0.00 : 5b9f00: e9 26 ff ff ff jmpq 5b9e2b : MemoryContextReset(workcontext); : : ExecClearTuple(slot1); : } : : if (slot2) 0.00 : 5b9f05: 4d 85 ff test %r15,%r15 0.00 : 5b9f08: 74 08 je 5b9f12 : ExecClearTuple(slot2); 0.00 : 5b9f0a: 4c 89 ff mov %r15,%rdi 0.00 : 5b9f0d: e8 fe a1 ff ff callq 5b4110 : : tuplesort_end(peraggstate->sortstate); 0.00 : 5b9f12: 49 8b bc 24 f8 00 00 mov 0xf8(%r12),%rdi 0.00 : 5b9f19: 00 0.00 : 5b9f1a: e8 c1 52 1e 00 callq 79f1e0 : peraggstate->sortstate = NULL; 0.00 : 5b9f1f: 49 c7 84 24 f8 00 00 movq $0x0,0xf8(%r12) 0.00 : 5b9f26: 00 00 00 00 00 : process_ordered_aggregate_multi(aggstate, : peraggstate, : pergroupstate); : } : : finalize_aggregate(aggstate, peraggstate, pergroupstate, 0.00 : 5b9f2b: 48 8b 55 88 mov -0x78(%rbp),%rdx 0.00 : 5b9f2f: 48 8b 85 68 ff ff ff mov -0x98(%rbp),%rax 0.00 : 5b9f36: 4c 89 e6 mov %r12,%rsi 0.00 : 5b9f39: 4c 89 f7 mov %r14,%rdi 0.00 : 5b9f3c: 48 8d 0c d0 lea (%rax,%rdx,8),%rcx 0.00 : 5b9f40: 48 8b 85 60 ff ff ff mov -0xa0(%rbp),%rax 0.00 : 5b9f47: 4c 8d 04 10 lea (%rax,%rdx,1),%r8 0.00 : 5b9f4b: 48 8b 95 38 ff ff ff mov -0xc8(%rbp),%rdx 0.00 : 5b9f52: e8 69 fb ff ff callq 5b9ac0 : : /* : * Done scanning input tuple group. Finalize each aggregate : * calculation, and stash results in the per-output-tuple context. : */ : for (aggno = 0; aggno < aggstate->numaggs; aggno++) 0.00 : 5b9f57: 83 85 44 ff ff ff 01 addl $0x1,-0xbc(%rbp) 0.00 : 5b9f5e: 8b 95 44 ff ff ff mov -0xbc(%rbp),%edx 0.00 : 5b9f64: 41 3b 96 98 00 00 00 cmp 0x98(%r14),%edx 0.00 : 5b9f6b: 0f 8c f6 01 00 00 jl 5ba167 : : /* : * Check the qual (HAVING clause); if the group does not match, ignore : * it and loop back to try to process another group. : */ : if (ExecQual(aggstate->ss.ps.qual, econtext, false)) 0.00 : 5b9f71: 49 8b 7e 28 mov 0x28(%r14),%rdi 0.00 : 5b9f75: 48 8b b5 78 ff ff ff mov -0x88(%rbp),%rsi 0.00 : 5b9f7c: 31 d2 xor %edx,%edx 0.00 : 5b9f7e: e8 8d 2f ff ff callq 5acf10 0.00 : 5b9f83: 84 c0 test %al,%al 0.00 : 5b9f85: 0f 85 18 05 00 00 jne 5ba4a3 : (isDone == ExprMultipleResult); : return result; : } : } : else : InstrCountFiltered1(aggstate, 1); 0.00 : 5b9f8b: 49 8b 46 18 mov 0x18(%r14),%rax 0.00 : 5b9f8f: 48 85 c0 test %rax,%rax 0.00 : 5b9f92: 74 18 je 5b9fac 0.00 : 5b9f94: f2 0f 10 05 bc 51 1f movsd 0x1f51bc(%rip),%xmm0 # 7af158 <__func__.15777+0x10> 0.00 : 5b9f9b: 00 0.00 : 5b9f9c: f2 0f 58 80 c8 00 00 addsd 0xc8(%rax),%xmm0 0.00 : 5b9fa3: 00 0.00 : 5b9fa4: f2 0f 11 80 c8 00 00 movsd %xmm0,0xc8(%rax) 0.00 : 5b9fab: 00 : : /* : * We loop retrieving groups until we find one matching : * aggstate->ss.ps.qual : */ : while (!aggstate->agg_done) 0.00 : 5b9fac: 41 80 be d0 00 00 00 cmpb $0x0,0xd0(%r14) 0.00 : 5b9fb3: 00 0.00 : 5b9fb4: 74 75 je 5ba02b 0.00 : 5b9fb6: 31 c0 xor %eax,%eax : agg_fill_hash_table(node); : return agg_retrieve_hash_table(node); : } : else : return agg_retrieve_direct(node); : } 0.00 : 5b9fb8: 48 81 c4 d8 00 00 00 add $0xd8,%rsp 0.00 : 5b9fbf: 5b pop %rbx 0.00 : 5b9fc0: 41 5c pop %r12 0.00 : 5b9fc2: 41 5d pop %r13 0.00 : 5b9fc4: 41 5e pop %r14 0.00 : 5b9fc6: 41 5f pop %r15 0.00 : 5b9fc8: c9 leaveq 0.00 : 5b9fc9: c3 retq : /* : * get state info from node : */ : outerPlan = outerPlanState(aggstate); : /* econtext is the per-output-tuple expression context */ : econtext = aggstate->ss.ps.ps_ExprContext; 0.00 : 5b9fca: 49 8b 56 60 mov 0x60(%r14),%rdx : int aggno; : : /* : * get state info from node : */ : outerPlan = outerPlanState(aggstate); 0.00 : 5b9fce: 49 8b 46 30 mov 0x30(%r14),%rax : /* econtext is the per-output-tuple expression context */ : econtext = aggstate->ss.ps.ps_ExprContext; 0.00 : 5b9fd2: 48 89 95 78 ff ff ff mov %rdx,-0x88(%rbp) : int aggno; : : /* : * get state info from node : */ : outerPlan = outerPlanState(aggstate); 0.00 : 5b9fd9: 48 89 45 80 mov %rax,-0x80(%rbp) : /* econtext is the per-output-tuple expression context */ : econtext = aggstate->ss.ps.ps_ExprContext; : aggvalues = econtext->ecxt_aggvalues; 0.00 : 5b9fdd: 48 8b 42 40 mov 0x40(%rdx),%rax 0.00 : 5b9fe1: 48 89 85 68 ff ff ff mov %rax,-0x98(%rbp) : aggnulls = econtext->ecxt_aggnulls; 0.00 : 5b9fe8: 48 8b 52 48 mov 0x48(%rdx),%rdx : /* tmpcontext is the per-input-tuple expression context */ : tmpcontext = aggstate->tmpcontext; 0.00 : 5b9fec: 49 8b 86 c0 00 00 00 mov 0xc0(%r14),%rax : */ : outerPlan = outerPlanState(aggstate); : /* econtext is the per-output-tuple expression context */ : econtext = aggstate->ss.ps.ps_ExprContext; : aggvalues = econtext->ecxt_aggvalues; : aggnulls = econtext->ecxt_aggnulls; 0.00 : 5b9ff3: 48 89 95 60 ff ff ff mov %rdx,-0xa0(%rbp) : /* tmpcontext is the per-input-tuple expression context */ : tmpcontext = aggstate->tmpcontext; : peragg = aggstate->peragg; 0.00 : 5b9ffa: 49 8b 96 b0 00 00 00 mov 0xb0(%r14),%rdx : /* econtext is the per-output-tuple expression context */ : econtext = aggstate->ss.ps.ps_ExprContext; : aggvalues = econtext->ecxt_aggvalues; : aggnulls = econtext->ecxt_aggnulls; : /* tmpcontext is the per-input-tuple expression context */ : tmpcontext = aggstate->tmpcontext; 0.00 : 5ba001: 48 89 85 70 ff ff ff mov %rax,-0x90(%rbp) : peragg = aggstate->peragg; : pergroup = aggstate->pergroup; 0.00 : 5ba008: 49 8b 86 d8 00 00 00 mov 0xd8(%r14),%rax : econtext = aggstate->ss.ps.ps_ExprContext; : aggvalues = econtext->ecxt_aggvalues; : aggnulls = econtext->ecxt_aggnulls; : /* tmpcontext is the per-input-tuple expression context */ : tmpcontext = aggstate->tmpcontext; : peragg = aggstate->peragg; 0.00 : 5ba00f: 48 89 95 58 ff ff ff mov %rdx,-0xa8(%rbp) : pergroup = aggstate->pergroup; : firstSlot = aggstate->ss.ss_ScanTupleSlot; 0.00 : 5ba016: 49 8b 96 88 00 00 00 mov 0x88(%r14),%rdx : aggvalues = econtext->ecxt_aggvalues; : aggnulls = econtext->ecxt_aggnulls; : /* tmpcontext is the per-input-tuple expression context */ : tmpcontext = aggstate->tmpcontext; : peragg = aggstate->peragg; : pergroup = aggstate->pergroup; 0.00 : 5ba01d: 48 89 85 50 ff ff ff mov %rax,-0xb0(%rbp) : firstSlot = aggstate->ss.ss_ScanTupleSlot; 0.00 : 5ba024: 48 89 95 48 ff ff ff mov %rdx,-0xb8(%rbp) : { : /* : * If we don't already have the first tuple of the new group, fetch it : * from the outer plan. : */ : if (aggstate->grp_firstTuple == NULL) 0.00 : 5ba02b: 49 83 be e0 00 00 00 cmpq $0x0,0xe0(%r14) 0.00 : 5ba032: 00 0.00 : 5ba033: 0f 84 a4 04 00 00 je 5ba4dd : * We use ReScanExprContext not just ResetExprContext because we want : * any registered shutdown callbacks to be called. That allows : * aggregate functions to ensure they've cleaned up any non-memory : * resources. : */ : ReScanExprContext(econtext); 0.00 : 5ba039: 48 8b bd 78 ff ff ff mov -0x88(%rbp),%rdi 0.00 : 5ba040: e8 3b b1 ff ff callq 5b5180 : : MemoryContextResetAndDeleteChildren(aggstate->aggcontext); 0.00 : 5ba045: 49 8b be b8 00 00 00 mov 0xb8(%r14),%rdi 0.00 : 5ba04c: e8 bf eb 1d 00 callq 798c10 : : /* : * Initialize working state for a new input tuple group : */ : initialize_aggregates(aggstate, peragg, pergroup); 0.00 : 5ba051: 48 8b 95 50 ff ff ff mov -0xb0(%rbp),%rdx 0.00 : 5ba058: 48 8b b5 58 ff ff ff mov -0xa8(%rbp),%rsi 0.00 : 5ba05f: 4c 89 f7 mov %r14,%rdi 0.00 : 5ba062: e8 69 f5 ff ff callq 5b95d0 : : if (aggstate->grp_firstTuple != NULL) 0.00 : 5ba067: 49 8b be e0 00 00 00 mov 0xe0(%r14),%rdi 0.00 : 5ba06e: 48 85 ff test %rdi,%rdi 0.00 : 5ba071: 0f 84 c5 00 00 00 je 5ba13c : /* : * Store the copied first input tuple in the tuple table slot : * reserved for it. The tuple will be deleted when it is cleared : * from the slot. : */ : ExecStoreTuple(aggstate->grp_firstTuple, 0.00 : 5ba077: 48 8b b5 48 ff ff ff mov -0xb8(%rbp),%rsi 0.00 : 5ba07e: 31 d2 xor %edx,%edx 0.00 : 5ba080: b9 01 00 00 00 mov $0x1,%ecx 0.00 : 5ba085: e8 f6 a3 ff ff callq 5b4480 : InvalidBuffer, : true); : aggstate->grp_firstTuple = NULL; /* don't keep two pointers */ : : /* set up for first advance_aggregates call */ : tmpcontext->ecxt_outertuple = firstSlot; 0.00 : 5ba08a: 48 8b 85 48 ff ff ff mov -0xb8(%rbp),%rax 0.00 : 5ba091: 48 8b 95 70 ff ff ff mov -0x90(%rbp),%rdx : */ : ExecStoreTuple(aggstate->grp_firstTuple, : firstSlot, : InvalidBuffer, : true); : aggstate->grp_firstTuple = NULL; /* don't keep two pointers */ 0.00 : 5ba098: 49 c7 86 e0 00 00 00 movq $0x0,0xe0(%r14) 0.00 : 5ba09f: 00 00 00 00 : : /* set up for first advance_aggregates call */ : tmpcontext->ecxt_outertuple = firstSlot; 0.00 : 5ba0a3: 48 89 42 18 mov %rax,0x18(%rdx) : * Process each outer-plan tuple, and then fetch the next one, : * until we exhaust the outer plan or cross a group boundary. : */ : for (;;) : { : advance_aggregates(aggstate, pergroup); 0.00 : 5ba0a7: 48 8b b5 50 ff ff ff mov -0xb0(%rbp),%rsi 0.00 : 5ba0ae: 4c 89 f7 mov %r14,%rdi 0.00 : 5ba0b1: e8 9a f8 ff ff callq 5b9950 : : /* Reset per-input-tuple context after each tuple */ : ResetExprContext(tmpcontext); 0.00 : 5ba0b6: 48 8b 95 70 ff ff ff mov -0x90(%rbp),%rdx 0.00 : 5ba0bd: 48 8b 7a 28 mov 0x28(%rdx),%rdi 0.00 : 5ba0c1: e8 ea e8 1d 00 callq 7989b0 : : outerslot = ExecProcNode(outerPlan); 0.00 : 5ba0c6: 48 8b 7d 80 mov -0x80(%rbp),%rdi 0.00 : 5ba0ca: e8 d1 23 ff ff callq 5ac4a0 : if (TupIsNull(outerslot)) 0.00 : 5ba0cf: 48 85 c0 test %rax,%rax : advance_aggregates(aggstate, pergroup); : : /* Reset per-input-tuple context after each tuple */ : ResetExprContext(tmpcontext); : : outerslot = ExecProcNode(outerPlan); 0.00 : 5ba0d2: 48 89 c3 mov %rax,%rbx : if (TupIsNull(outerslot)) 0.00 : 5ba0d5: 0f 84 f5 03 00 00 je 5ba4d0 0.00 : 5ba0db: 80 78 04 00 cmpb $0x0,0x4(%rax) 0.00 : 5ba0df: 0f 85 eb 03 00 00 jne 5ba4d0 : /* no more outer-plan tuples available */ : aggstate->agg_done = true; : break; : } : /* set up for next advance_aggregates call */ : tmpcontext->ecxt_outertuple = outerslot; 0.00 : 5ba0e5: 48 8b 85 70 ff ff ff mov -0x90(%rbp),%rax 0.00 : 5ba0ec: 48 89 58 18 mov %rbx,0x18(%rax) : : /* : * If we are grouping, check whether we've crossed a group : * boundary. : */ : if (node->aggstrategy == AGG_SORTED) 0.00 : 5ba0f0: 48 8b 95 10 ff ff ff mov -0xf0(%rbp),%rdx 0.00 : 5ba0f7: 83 7a 60 01 cmpl $0x1,0x60(%rdx) 0.00 : 5ba0fb: 75 aa jne 5ba0a7 : { : if (!execTuplesMatch(firstSlot, 0.00 : 5ba0fd: 48 8b 85 70 ff ff ff mov -0x90(%rbp),%rax 0.00 : 5ba104: 48 8b 4a 68 mov 0x68(%rdx),%rcx 0.00 : 5ba108: 48 89 de mov %rbx,%rsi 0.00 : 5ba10b: 8b 52 64 mov 0x64(%rdx),%edx 0.00 : 5ba10e: 4d 8b 86 a0 00 00 00 mov 0xa0(%r14),%r8 0.00 : 5ba115: 48 8b bd 48 ff ff ff mov -0xb8(%rbp),%rdi 0.00 : 5ba11c: 4c 8b 48 28 mov 0x28(%rax),%r9 0.00 : 5ba120: e8 1b f3 fe ff callq 5a9440 0.00 : 5ba125: 84 c0 test %al,%al 0.00 : 5ba127: 0f 85 7a ff ff ff jne 5ba0a7 : tmpcontext->ecxt_per_tuple_memory)) : { : /* : * Save the first input tuple of the next group. : */ : aggstate->grp_firstTuple = ExecCopySlotTuple(outerslot); 0.00 : 5ba12d: 48 89 df mov %rbx,%rdi 0.00 : 5ba130: e8 7b 9e ff ff callq 5b3fb0 0.00 : 5ba135: 49 89 86 e0 00 00 00 mov %rax,0xe0(%r14) : * qual, and the tlist. (If we are not grouping, and there are no : * input rows at all, we will come here with an empty firstSlot ... : * but if not grouping, there can't be any references to : * non-aggregated input columns, so no problem.) : */ : econtext->ecxt_outertuple = firstSlot; 0.00 : 5ba13c: 48 8b 85 48 ff ff ff mov -0xb8(%rbp),%rax 0.00 : 5ba143: 48 8b 95 78 ff ff ff mov -0x88(%rbp),%rdx 0.00 : 5ba14a: 48 89 42 18 mov %rax,0x18(%rdx) : : /* : * Done scanning input tuple group. Finalize each aggregate : * calculation, and stash results in the per-output-tuple context. : */ : for (aggno = 0; aggno < aggstate->numaggs; aggno++) 0.00 : 5ba14e: 41 8b 86 98 00 00 00 mov 0x98(%r14),%eax 0.00 : 5ba155: 85 c0 test %eax,%eax 0.00 : 5ba157: 0f 8e 14 fe ff ff jle 5b9f71 0.00 : 5ba15d: c7 85 44 ff ff ff 00 movl $0x0,-0xbc(%rbp) 0.00 : 5ba164: 00 00 00 : { : AggStatePerAgg peraggstate = &peragg[aggno]; 0.00 : 5ba167: 48 63 95 44 ff ff ff movslq -0xbc(%rbp),%rdx 0.00 : 5ba16e: 4c 8b a5 58 ff ff ff mov -0xa8(%rbp),%r12 0.00 : 5ba175: 48 69 c2 a8 04 00 00 imul $0x4a8,%rdx,%rax 0.00 : 5ba17c: 48 89 55 88 mov %rdx,-0x78(%rbp) 0.00 : 5ba180: 49 01 c4 add %rax,%r12 : AggStatePerGroup pergroupstate = &pergroup[aggno]; 0.00 : 5ba183: 48 89 d0 mov %rdx,%rax 0.00 : 5ba186: 48 c1 e0 04 shl $0x4,%rax 0.00 : 5ba18a: 48 03 85 50 ff ff ff add -0xb0(%rbp),%rax 0.00 : 5ba191: 48 89 85 38 ff ff ff mov %rax,-0xc8(%rbp) : : if (peraggstate->numSortCols > 0) 0.00 : 5ba198: 41 8b 84 24 8c 00 00 mov 0x8c(%r12),%eax 0.00 : 5ba19f: 00 0.00 : 5ba1a0: 85 c0 test %eax,%eax 0.00 : 5ba1a2: 0f 8e 83 fd ff ff jle 5b9f2b : { : if (peraggstate->numInputs == 1) 0.00 : 5ba1a8: 41 83 7c 24 14 01 cmpl $0x1,0x14(%r12) 0.00 : 5ba1ae: 0f 84 3e 01 00 00 je 5ba2f2 : static void : process_ordered_aggregate_multi(AggState *aggstate, : AggStatePerAgg peraggstate, : AggStatePerGroup pergroupstate) : { : MemoryContext workcontext = aggstate->tmpcontext->ecxt_per_tuple_memory; 0.00 : 5ba1b4: 49 8b 86 c0 00 00 00 mov 0xc0(%r14),%rax 0.00 : 5ba1bb: 48 8b 40 28 mov 0x28(%rax),%rax 0.00 : 5ba1bf: 48 89 45 c0 mov %rax,-0x40(%rbp) : FunctionCallInfo fcinfo = &peraggstate->transfn_fcinfo; : TupleTableSlot *slot1 = peraggstate->evalslot; : TupleTableSlot *slot2 = peraggstate->uniqslot; : int numTransInputs = peraggstate->numTransInputs; : int numDistinctCols = peraggstate->numDistinctCols; 0.00 : 5ba1c3: 41 8b 84 24 90 00 00 mov 0x90(%r12),%eax 0.00 : 5ba1ca: 00 : AggStatePerAgg peraggstate, : AggStatePerGroup pergroupstate) : { : MemoryContext workcontext = aggstate->tmpcontext->ecxt_per_tuple_memory; : FunctionCallInfo fcinfo = &peraggstate->transfn_fcinfo; : TupleTableSlot *slot1 = peraggstate->evalslot; 0.00 : 5ba1cb: 49 8b 9c 24 e8 00 00 mov 0xe8(%r12),%rbx 0.00 : 5ba1d2: 00 : TupleTableSlot *slot2 = peraggstate->uniqslot; 0.00 : 5ba1d3: 4d 8b bc 24 f0 00 00 mov 0xf0(%r12),%r15 0.00 : 5ba1da: 00 : int numTransInputs = peraggstate->numTransInputs; 0.00 : 5ba1db: 45 8b 6c 24 18 mov 0x18(%r12),%r13d : int numDistinctCols = peraggstate->numDistinctCols; 0.00 : 5ba1e0: 89 45 bc mov %eax,-0x44(%rbp) : bool haveOldValue = false; : int i; : : tuplesort_performsort(peraggstate->sortstate); 0.00 : 5ba1e3: 49 8b bc 24 f8 00 00 mov 0xf8(%r12),%rdi 0.00 : 5ba1ea: 00 0.00 : 5ba1eb: e8 00 7e 1e 00 callq 7a1ff0 : : ExecClearTuple(slot1); 0.00 : 5ba1f0: 48 89 df mov %rbx,%rdi 0.00 : 5ba1f3: e8 18 9f ff ff callq 5b4110 : if (slot2) 0.00 : 5ba1f8: 4d 85 ff test %r15,%r15 0.00 : 5ba1fb: 74 08 je 5ba205 : ExecClearTuple(slot2); 0.00 : 5ba1fd: 4c 89 ff mov %r15,%rdi 0.00 : 5ba200: e8 0b 9f ff ff callq 5b4110 0.00 : 5ba205: c6 45 bb 00 movb $0x0,-0x45(%rbp) 0.00 : 5ba209: eb 3d jmp 5ba248 : * transfn. (This will help execTuplesMatch too, so we do it : * immediately.) : */ : slot_getsomeattrs(slot1, numTransInputs); : : if (numDistinctCols == 0 || 0.00 : 5ba20b: 80 7d bb 00 cmpb $0x0,-0x45(%rbp) 0.00 : 5ba20f: 90 nop 0.00 : 5ba210: 74 6c je 5ba27e 0.00 : 5ba212: 49 8b 8c 24 98 00 00 mov 0x98(%r12),%rcx 0.00 : 5ba219: 00 0.00 : 5ba21a: 4c 8b 4d c0 mov -0x40(%rbp),%r9 0.00 : 5ba21e: 4c 89 fe mov %r15,%rsi 0.00 : 5ba221: 4d 8b 84 24 b8 00 00 mov 0xb8(%r12),%r8 0.00 : 5ba228: 00 0.00 : 5ba229: 8b 55 bc mov -0x44(%rbp),%edx 0.00 : 5ba22c: 48 89 df mov %rbx,%rdi 0.00 : 5ba22f: e8 0c f2 fe ff callq 5a9440 0.00 : 5ba234: 84 c0 test %al,%al 0.00 : 5ba236: 74 46 je 5ba27e 0.00 : 5ba238: c6 45 bb 01 movb $0x1,-0x45(%rbp) 0.00 : 5ba23c: 0f 1f 40 00 nopl 0x0(%rax) : : /* Reset context each time, unless execTuplesMatch did it for us */ : if (numDistinctCols == 0) : MemoryContextReset(workcontext); : : ExecClearTuple(slot1); 0.00 : 5ba240: 48 89 df mov %rbx,%rdi 0.00 : 5ba243: e8 c8 9e ff ff callq 5b4110 : : ExecClearTuple(slot1); : if (slot2) : ExecClearTuple(slot2); : : while (tuplesort_gettupleslot(peraggstate->sortstate, true, slot1)) 0.00 : 5ba248: 49 8b bc 24 f8 00 00 mov 0xf8(%r12),%rdi 0.00 : 5ba24f: 00 0.00 : 5ba250: 48 89 da mov %rbx,%rdx 0.00 : 5ba253: be 01 00 00 00 mov $0x1,%esi 0.00 : 5ba258: e8 33 40 1e 00 callq 79e290 0.00 : 5ba25d: 84 c0 test %al,%al 0.00 : 5ba25f: 0f 84 a0 fc ff ff je 5b9f05 : /* : * Extract the first numTransInputs columns as datums to pass to the : * transfn. (This will help execTuplesMatch too, so we do it : * immediately.) : */ : slot_getsomeattrs(slot1, numTransInputs); 0.00 : 5ba265: 44 89 ee mov %r13d,%esi 0.00 : 5ba268: 48 89 df mov %rbx,%rdi 0.00 : 5ba26b: e8 f0 4f eb ff callq 46f260 : : if (numDistinctCols == 0 || 0.00 : 5ba270: 8b 45 bc mov -0x44(%rbp),%eax 0.00 : 5ba273: 85 c0 test %eax,%eax 0.00 : 5ba275: 0f 94 85 0f ff ff ff sete -0xf1(%rbp) 0.00 : 5ba27c: 75 8d jne 5ba20b : peraggstate->equalfns, : workcontext)) : { : /* Load values into fcinfo */ : /* Start from 1, since the 0th arg will be the transition value */ : for (i = 0; i < numTransInputs; i++) 0.00 : 5ba27e: 45 85 ed test %r13d,%r13d 0.00 : 5ba281: 7e 2e jle 5ba2b1 0.00 : 5ba283: 31 d2 xor %edx,%edx 0.00 : 5ba285: 0f 1f 00 nopl (%rax) : { : fcinfo->arg[i + 1] = slot1->tts_values[i]; 0.00 : 5ba288: 48 8b 43 28 mov 0x28(%rbx),%rax 0.00 : 5ba28c: 48 8b 04 d0 mov (%rax,%rdx,8),%rax 0.00 : 5ba290: 49 89 84 d4 28 01 00 mov %rax,0x128(%r12,%rdx,8) 0.00 : 5ba297: 00 : fcinfo->argnull[i + 1] = slot1->tts_isnull[i]; 0.00 : 5ba298: 48 8b 43 30 mov 0x30(%rbx),%rax 0.00 : 5ba29c: 0f b6 04 10 movzbl (%rax,%rdx,1),%eax 0.00 : 5ba2a0: 41 88 84 14 41 04 00 mov %al,0x441(%r12,%rdx,1) 0.00 : 5ba2a7: 00 0.00 : 5ba2a8: 48 83 c2 01 add $0x1,%rdx : peraggstate->equalfns, : workcontext)) : { : /* Load values into fcinfo */ : /* Start from 1, since the 0th arg will be the transition value */ : for (i = 0; i < numTransInputs; i++) 0.00 : 5ba2ac: 41 39 d5 cmp %edx,%r13d 0.00 : 5ba2af: 7f d7 jg 5ba288 : { : fcinfo->arg[i + 1] = slot1->tts_values[i]; : fcinfo->argnull[i + 1] = slot1->tts_isnull[i]; : } : : advance_transition_function(aggstate, peraggstate, pergroupstate); 0.00 : 5ba2b1: 48 8b 95 38 ff ff ff mov -0xc8(%rbp),%rdx 0.00 : 5ba2b8: 4c 89 e6 mov %r12,%rsi 0.00 : 5ba2bb: 4c 89 f7 mov %r14,%rdi 0.00 : 5ba2be: e8 cd f4 ff ff callq 5b9790 : : if (numDistinctCols > 0) 0.00 : 5ba2c3: 8b 45 bc mov -0x44(%rbp),%eax 0.00 : 5ba2c6: 85 c0 test %eax,%eax 0.00 : 5ba2c8: 7e 0d jle 5ba2d7 0.00 : 5ba2ca: 48 89 df mov %rbx,%rdi 0.00 : 5ba2cd: c6 45 bb 01 movb $0x1,-0x45(%rbp) 0.00 : 5ba2d1: 4c 89 fb mov %r15,%rbx 0.00 : 5ba2d4: 49 89 ff mov %rdi,%r15 : haveOldValue = true; : } : } : : /* Reset context each time, unless execTuplesMatch did it for us */ : if (numDistinctCols == 0) 0.00 : 5ba2d7: 80 bd 0f ff ff ff 00 cmpb $0x0,-0xf1(%rbp) 0.00 : 5ba2de: 0f 84 5c ff ff ff je 5ba240 : MemoryContextReset(workcontext); 0.00 : 5ba2e4: 48 8b 7d c0 mov -0x40(%rbp),%rdi 0.00 : 5ba2e8: e8 c3 e6 1d 00 callq 7989b0 0.00 : 5ba2ed: e9 4e ff ff ff jmpq 5ba240 : AggStatePerGroup pergroupstate) : { : Datum oldVal = (Datum) 0; : bool oldIsNull = true; : bool haveOldVal = false; : MemoryContext workcontext = aggstate->tmpcontext->ecxt_per_tuple_memory; 0.00 : 5ba2f2: 49 8b 86 c0 00 00 00 mov 0xc0(%r14),%rax : : tuplesort_performsort(peraggstate->sortstate); : : /* Load the column into argument 1 (arg 0 will be transition value) */ : newVal = fcinfo->arg + 1; : isNull = fcinfo->argnull + 1; 0.00 : 5ba2f9: 45 31 ed xor %r13d,%r13d 0.00 : 5ba2fc: bb 01 00 00 00 mov $0x1,%ebx 0.00 : 5ba301: 45 31 ff xor %r15d,%r15d : AggStatePerGroup pergroupstate) : { : Datum oldVal = (Datum) 0; : bool oldIsNull = true; : bool haveOldVal = false; : MemoryContext workcontext = aggstate->tmpcontext->ecxt_per_tuple_memory; 0.00 : 5ba304: 48 8b 40 28 mov 0x28(%rax),%rax 0.00 : 5ba308: 48 89 45 a8 mov %rax,-0x58(%rbp) : MemoryContext oldContext; : bool isDistinct = (peraggstate->numDistinctCols > 0); 0.00 : 5ba30c: 41 8b 84 24 90 00 00 mov 0x90(%r12),%eax 0.00 : 5ba313: 00 0.00 : 5ba314: 89 45 b4 mov %eax,-0x4c(%rbp) : Datum *newVal; : bool *isNull; : : Assert(peraggstate->numDistinctCols < 2); : : tuplesort_performsort(peraggstate->sortstate); 0.00 : 5ba317: 49 8b bc 24 f8 00 00 mov 0xf8(%r12),%rdi 0.00 : 5ba31e: 00 0.00 : 5ba31f: e8 cc 7c 1e 00 callq 7a1ff0 : : /* Load the column into argument 1 (arg 0 will be transition value) */ : newVal = fcinfo->arg + 1; 0.00 : 5ba324: 49 8d 94 24 28 01 00 lea 0x128(%r12),%rdx 0.00 : 5ba32b: 00 : isNull = fcinfo->argnull + 1; 0.00 : 5ba32c: 49 8d 84 24 41 04 00 lea 0x441(%r12),%rax 0.00 : 5ba333: 00 : Assert(peraggstate->numDistinctCols < 2); : : tuplesort_performsort(peraggstate->sortstate); : : /* Load the column into argument 1 (arg 0 will be transition value) */ : newVal = fcinfo->arg + 1; 0.00 : 5ba334: 48 89 55 98 mov %rdx,-0x68(%rbp) : isNull = fcinfo->argnull + 1; 0.00 : 5ba338: 48 89 45 90 mov %rax,-0x70(%rbp) 0.00 : 5ba33c: eb 3c jmp 5ba37a : if (!peraggstate->inputtypeByVal && !*isNull) : pfree(DatumGetPointer(*newVal)); : } : else : { : advance_transition_function(aggstate, peraggstate, pergroupstate); 0.00 : 5ba33e: 48 8b 95 38 ff ff ff mov -0xc8(%rbp),%rdx 0.00 : 5ba345: 4c 89 e6 mov %r12,%rsi 0.00 : 5ba348: 4c 89 f7 mov %r14,%rdi 0.00 : 5ba34b: e8 40 f4 ff ff callq 5b9790 : /* forget the old value, if any */ : if (!oldIsNull && !peraggstate->inputtypeByVal) 0.00 : 5ba350: 84 db test %bl,%bl 0.00 : 5ba352: 0f 84 98 00 00 00 je 5ba3f0 : pfree(DatumGetPointer(oldVal)); : /* and remember the new one for subsequent equality checks */ : oldVal = *newVal; : oldIsNull = *isNull; 0.00 : 5ba358: 41 0f b6 9c 24 41 04 movzbl 0x441(%r12),%ebx 0.00 : 5ba35f: 00 00 : advance_transition_function(aggstate, peraggstate, pergroupstate); : /* forget the old value, if any */ : if (!oldIsNull && !peraggstate->inputtypeByVal) : pfree(DatumGetPointer(oldVal)); : /* and remember the new one for subsequent equality checks */ : oldVal = *newVal; 0.00 : 5ba361: 4d 8b bc 24 28 01 00 mov 0x128(%r12),%r15 0.00 : 5ba368: 00 : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; : : CurrentMemoryContext = context; 0.00 : 5ba369: 48 8b 55 a0 mov -0x60(%rbp),%rdx 0.00 : 5ba36d: 41 bd 01 00 00 00 mov $0x1,%r13d 0.00 : 5ba373: 48 89 15 e6 04 60 00 mov %rdx,0x6004e6(%rip) # bba860 : * Note: if input type is pass-by-ref, the datums returned by the sort are : * freshly palloc'd in the per-query context, so we must be careful to : * pfree them when they are no longer needed. : */ : : while (tuplesort_getdatum(peraggstate->sortstate, true, 0.00 : 5ba37a: 49 8b bc 24 f8 00 00 mov 0xf8(%r12),%rdi 0.00 : 5ba381: 00 0.00 : 5ba382: 48 8b 4d 90 mov -0x70(%rbp),%rcx 0.00 : 5ba386: be 01 00 00 00 mov $0x1,%esi 0.00 : 5ba38b: 48 8b 55 98 mov -0x68(%rbp),%rdx 0.00 : 5ba38f: e8 2c 3e 1e 00 callq 79e1c0 0.00 : 5ba394: 84 c0 test %al,%al 0.00 : 5ba396: 0f 84 e0 00 00 00 je 5ba47c : { : /* : * Clear and select the working context for evaluation of the equality : * function and transition function. : */ : MemoryContextReset(workcontext); 0.00 : 5ba39c: 48 8b 7d a8 mov -0x58(%rbp),%rdi 0.00 : 5ba3a0: e8 0b e6 1d 00 callq 7989b0 0.00 : 5ba3a5: 48 8b 45 a8 mov -0x58(%rbp),%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 : 5ba3a9: 48 8b 15 b0 04 60 00 mov 0x6004b0(%rip),%rdx # bba860 : : CurrentMemoryContext = context; 0.00 : 5ba3b0: 48 89 05 a9 04 60 00 mov %rax,0x6004a9(%rip) # bba860 : /* : * If DISTINCT mode, and not distinct from prior, skip it. : * : * Note: we assume equality functions don't care about collation. : */ : if (isDistinct && 0.00 : 5ba3b7: 8b 45 b4 mov -0x4c(%rbp),%eax : #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 : 5ba3ba: 48 89 55 a0 mov %rdx,-0x60(%rbp) 0.00 : 5ba3be: 85 c0 test %eax,%eax 0.00 : 5ba3c0: 0f 8e 78 ff ff ff jle 5ba33e 0.00 : 5ba3c6: 45 84 ed test %r13b,%r13b 0.00 : 5ba3c9: 0f 84 6f ff ff ff je 5ba33e 0.00 : 5ba3cf: 84 db test %bl,%bl 0.00 : 5ba3d1: 75 39 jne 5ba40c 0.00 : 5ba3d3: 41 80 bc 24 41 04 00 cmpb $0x0,0x441(%r12) 0.00 : 5ba3da: 00 00 0.00 : 5ba3dc: 74 50 je 5ba42e : if (!peraggstate->inputtypeByVal && !*isNull) : pfree(DatumGetPointer(*newVal)); : } : else : { : advance_transition_function(aggstate, peraggstate, pergroupstate); 0.00 : 5ba3de: 48 8b 95 38 ff ff ff mov -0xc8(%rbp),%rdx 0.00 : 5ba3e5: 4c 89 e6 mov %r12,%rsi 0.00 : 5ba3e8: 4c 89 f7 mov %r14,%rdi 0.00 : 5ba3eb: e8 a0 f3 ff ff callq 5b9790 : /* forget the old value, if any */ : if (!oldIsNull && !peraggstate->inputtypeByVal) 0.00 : 5ba3f0: 41 80 bc 24 d0 00 00 cmpb $0x0,0xd0(%r12) 0.00 : 5ba3f7: 00 00 0.00 : 5ba3f9: 0f 85 59 ff ff ff jne 5ba358 : pfree(DatumGetPointer(oldVal)); 0.00 : 5ba3ff: 4c 89 ff mov %r15,%rdi 0.00 : 5ba402: e8 79 e7 1d 00 callq 798b80 0.00 : 5ba407: e9 4c ff ff ff jmpq 5ba358 : /* : * If DISTINCT mode, and not distinct from prior, skip it. : * : * Note: we assume equality functions don't care about collation. : */ : if (isDistinct && 0.00 : 5ba40c: 41 80 bc 24 41 04 00 cmpb $0x0,0x441(%r12) 0.00 : 5ba413: 00 00 0.00 : 5ba415: 75 35 jne 5ba44c : if (!peraggstate->inputtypeByVal && !*isNull) : pfree(DatumGetPointer(*newVal)); : } : else : { : advance_transition_function(aggstate, peraggstate, pergroupstate); 0.00 : 5ba417: 48 8b 95 38 ff ff ff mov -0xc8(%rbp),%rdx 0.00 : 5ba41e: 4c 89 e6 mov %r12,%rsi 0.00 : 5ba421: 4c 89 f7 mov %r14,%rdi 0.00 : 5ba424: e8 67 f3 ff ff callq 5b9790 0.00 : 5ba429: e9 2a ff ff ff jmpq 5ba358 : /* : * If DISTINCT mode, and not distinct from prior, skip it. : * : * Note: we assume equality functions don't care about collation. : */ : if (isDistinct && 0.00 : 5ba42e: 49 8b 8c 24 28 01 00 mov 0x128(%r12),%rcx 0.00 : 5ba435: 00 0.00 : 5ba436: 49 8b bc 24 b8 00 00 mov 0xb8(%r12),%rdi 0.00 : 5ba43d: 00 0.00 : 5ba43e: 31 f6 xor %esi,%esi 0.00 : 5ba440: 4c 89 fa mov %r15,%rdx 0.00 : 5ba443: e8 e8 3b 1c 00 callq 77e030 0.00 : 5ba448: 84 c0 test %al,%al 0.00 : 5ba44a: 74 92 je 5ba3de : (!oldIsNull && !*isNull && : DatumGetBool(FunctionCall2(&peraggstate->equalfns[0], : oldVal, *newVal))))) : { : /* equal to prior, so forget this one */ : if (!peraggstate->inputtypeByVal && !*isNull) 0.00 : 5ba44c: 41 80 bc 24 d0 00 00 cmpb $0x0,0xd0(%r12) 0.00 : 5ba453: 00 00 0.00 : 5ba455: 0f 85 0e ff ff ff jne 5ba369 0.00 : 5ba45b: 41 80 bc 24 41 04 00 cmpb $0x0,0x441(%r12) 0.00 : 5ba462: 00 00 0.00 : 5ba464: 0f 85 ff fe ff ff jne 5ba369 : pfree(DatumGetPointer(*newVal)); 0.00 : 5ba46a: 49 8b bc 24 28 01 00 mov 0x128(%r12),%rdi 0.00 : 5ba471: 00 0.00 : 5ba472: e8 09 e7 1d 00 callq 798b80 0.00 : 5ba477: e9 ed fe ff ff jmpq 5ba369 : } : : MemoryContextSwitchTo(oldContext); : } : : if (!oldIsNull && !peraggstate->inputtypeByVal) 0.00 : 5ba47c: 84 db test %bl,%bl 0.00 : 5ba47e: 0f 85 8e fa ff ff jne 5b9f12 0.00 : 5ba484: 41 80 bc 24 d0 00 00 cmpb $0x0,0xd0(%r12) 0.00 : 5ba48b: 00 00 0.00 : 5ba48d: 0f 1f 00 nopl (%rax) 0.00 : 5ba490: 0f 85 7c fa ff ff jne 5b9f12 : pfree(DatumGetPointer(oldVal)); 0.00 : 5ba496: 4c 89 ff mov %r15,%rdi 0.00 : 5ba499: e8 e2 e6 1d 00 callq 798b80 0.00 : 5ba49e: e9 6f fa ff ff jmpq 5b9f12 : * and the representative input tuple. : */ : TupleTableSlot *result; : ExprDoneCond isDone; : : result = ExecProject(aggstate->ss.ps.ps_ProjInfo, &isDone); 0.00 : 5ba4a3: 49 8b 7e 68 mov 0x68(%r14),%rdi 0.00 : 5ba4a7: 48 8d 75 d4 lea -0x2c(%rbp),%rsi 0.00 : 5ba4ab: e8 50 2b ff ff callq 5ad000 : : if (isDone != ExprEndResult) 0.00 : 5ba4b0: 8b 55 d4 mov -0x2c(%rbp),%edx 0.00 : 5ba4b3: 83 fa 02 cmp $0x2,%edx 0.00 : 5ba4b6: 0f 84 f0 fa ff ff je 5b9fac : { : aggstate->ss.ps.ps_TupFromTlist = 0.00 : 5ba4bc: 83 ea 01 sub $0x1,%edx 0.00 : 5ba4bf: 41 0f 94 46 70 sete 0x70(%r14) 0.00 : 5ba4c4: e9 ef fa ff ff jmpq 5b9fb8 0.00 : 5ba4c9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : : outerslot = ExecProcNode(outerPlan); : if (TupIsNull(outerslot)) : { : /* no more outer-plan tuples available */ : aggstate->agg_done = true; 0.00 : 5ba4d0: 41 c6 86 d0 00 00 00 movb $0x1,0xd0(%r14) 0.00 : 5ba4d7: 01 0.00 : 5ba4d8: e9 5f fc ff ff jmpq 5ba13c : * If we don't already have the first tuple of the new group, fetch it : * from the outer plan. : */ : if (aggstate->grp_firstTuple == NULL) : { : outerslot = ExecProcNode(outerPlan); 0.00 : 5ba4dd: 48 8b 7d 80 mov -0x80(%rbp),%rdi 0.00 : 5ba4e1: e8 ba 1f ff ff callq 5ac4a0 : if (!TupIsNull(outerslot)) 0.00 : 5ba4e6: 48 85 c0 test %rax,%rax : * If we don't already have the first tuple of the new group, fetch it : * from the outer plan. : */ : if (aggstate->grp_firstTuple == NULL) : { : outerslot = ExecProcNode(outerPlan); 0.00 : 5ba4e9: 48 89 c7 mov %rax,%rdi : if (!TupIsNull(outerslot)) 0.00 : 5ba4ec: 74 06 je 5ba4f4 0.00 : 5ba4ee: 80 78 04 00 cmpb $0x0,0x4(%rax) 0.00 : 5ba4f2: 74 1f je 5ba513 : else : { : /* outer plan produced no tuples at all */ : aggstate->agg_done = true; : /* If we are grouping, we should produce no tuples too */ : if (node->aggstrategy != AGG_PLAIN) 0.00 : 5ba4f4: 48 8b 85 10 ff ff ff mov -0xf0(%rbp),%rax : aggstate->grp_firstTuple = ExecCopySlotTuple(outerslot); : } : else : { : /* outer plan produced no tuples at all */ : aggstate->agg_done = true; 0.00 : 5ba4fb: 41 c6 86 d0 00 00 00 movb $0x1,0xd0(%r14) 0.00 : 5ba502: 01 : /* If we are grouping, we should produce no tuples too */ : if (node->aggstrategy != AGG_PLAIN) 0.00 : 5ba503: 8b 40 60 mov 0x60(%rax),%eax 0.00 : 5ba506: 85 c0 test %eax,%eax 0.00 : 5ba508: 0f 84 2b fb ff ff je 5ba039 0.00 : 5ba50e: e9 a3 fa ff ff jmpq 5b9fb6 : { : /* : * Make a copy of the first input tuple; we will use this for : * comparisons (in group mode) and for projection. : */ : aggstate->grp_firstTuple = ExecCopySlotTuple(outerslot); 0.00 : 5ba513: e8 98 9a ff ff callq 5b3fb0 0.00 : 5ba518: 49 89 86 e0 00 00 00 mov %rax,0xe0(%r14) 0.00 : 5ba51f: 90 nop 0.00 : 5ba520: e9 14 fb ff ff jmpq 5ba039 : * and the representative input tuple. : */ : TupleTableSlot *result; : ExprDoneCond isDone; : : result = ExecProject(aggstate->ss.ps.ps_ProjInfo, &isDone); 0.00 : 5ba525: 49 8b 7e 68 mov 0x68(%r14),%rdi 0.00 : 5ba529: 48 8d 75 d4 lea -0x2c(%rbp),%rsi 0.00 : 5ba52d: e8 ce 2a ff ff callq 5ad000 : : if (isDone != ExprEndResult) 0.00 : 5ba532: 8b 55 d4 mov -0x2c(%rbp),%edx 0.00 : 5ba535: 83 fa 02 cmp $0x2,%edx 0.00 : 5ba538: 0f 84 ba f9 ff ff je 5b9ef8 0.00 : 5ba53e: e9 79 ff ff ff jmpq 5ba4bc : */ : entry = (AggHashEntry) ScanTupleHashTable(&aggstate->hashiter); : if (entry == NULL) : { : /* No more entries in hashtable, so done */ : aggstate->agg_done = TRUE; 0.00 : 5ba543: 41 c6 86 d0 00 00 00 movb $0x1,0xd0(%r14) 0.00 : 5ba54a: 01 0.00 : 5ba54b: 31 c0 xor %eax,%eax 0.00 : 5ba54d: e9 66 fa ff ff jmpq 5b9fb8 : TupleTableSlot *outerslot; : : /* : * get state info from node : */ : outerPlan = outerPlanState(aggstate); 0.00 : 5ba552: 4d 8b 6e 30 mov 0x30(%r14),%r13 : /* tmpcontext is the per-input-tuple expression context */ : tmpcontext = aggstate->tmpcontext; 0.00 : 5ba556: 4d 8b be c0 00 00 00 mov 0xc0(%r14),%r15 : * Process each outer-plan tuple, and then fetch the next one, until we : * exhaust the outer plan. : */ : for (;;) : { : outerslot = ExecProcNode(outerPlan); 0.00 : 5ba55d: 4c 89 ef mov %r13,%rdi 0.00 : 5ba560: e8 3b 1f ff ff callq 5ac4a0 : if (TupIsNull(outerslot)) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1350 10.53 : 5ba565: 48 85 c0 test %rax,%rax : * Process each outer-plan tuple, and then fetch the next one, until we : * exhaust the outer plan. : */ : for (;;) : { : outerslot = ExecProcNode(outerPlan); 0.00 : 5ba568: 48 89 c3 mov %rax,%rbx : if (TupIsNull(outerslot)) 0.00 : 5ba56b: 0f 84 db 00 00 00 je 5ba64c 0.00 : 5ba571: 80 78 04 00 cmpb $0x0,0x4(%rax) 5.26 : 5ba575: 0f 85 d1 00 00 00 jne 5ba64c : break; : /* set up for advance_aggregates call */ : tmpcontext->ecxt_outertuple = outerslot; 0.00 : 5ba57b: 49 89 47 18 mov %rax,0x18(%r15) : * When called, CurrentMemoryContext should be the per-query context. : */ : static AggHashEntry : lookup_hash_entry(AggState *aggstate, TupleTableSlot *inputslot) : { : TupleTableSlot *hashslot = aggstate->hashslot; 0.00 : 5ba57f: 4d 8b a6 f0 00 00 00 mov 0xf0(%r14),%r12 : ListCell *l; : AggHashEntry entry; : bool isnew; : : /* if first time through, initialize hashslot by cloning input slot */ : if (hashslot->tts_tupleDescriptor == NULL) 0.00 : 5ba586: 49 83 7c 24 10 00 cmpq $0x0,0x10(%r12) 0.00 : 5ba58c: 75 14 jne 5ba5a2 : { : ExecSetSlotDescriptor(hashslot, inputslot->tts_tupleDescriptor); 0.00 : 5ba58e: 48 8b 70 10 mov 0x10(%rax),%rsi 0.00 : 5ba592: 4c 89 e7 mov %r12,%rdi 0.00 : 5ba595: e8 16 a0 ff ff callq 5b45b0 : /* Make sure all unused columns are NULLs */ : ExecStoreAllNullTuple(hashslot); 0.00 : 5ba59a: 4c 89 e7 mov %r12,%rdi 0.00 : 5ba59d: e8 1e 9d ff ff callq 5b42c0 : } : : /* transfer just the needed columns into hashslot */ : slot_getsomeattrs(inputslot, linitial_int(aggstate->hash_needed)); 0.00 : 5ba5a2: 49 8b 96 f8 00 00 00 mov 0xf8(%r14),%rdx : #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 : 5ba5a9: 31 c0 xor %eax,%eax 0.00 : 5ba5ab: 48 85 d2 test %rdx,%rdx 0.00 : 5ba5ae: 74 04 je 5ba5b4 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/nodes/pg_list.h:87 5.26 : 5ba5b0: 48 8b 42 08 mov 0x8(%rdx),%rax 0.00 : 5ba5b4: 8b 30 mov (%rax),%esi /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1043 10.53 : 5ba5b6: 48 89 df mov %rbx,%rdi 0.00 : 5ba5b9: e8 a2 4c eb ff callq 46f260 : foreach(l, aggstate->hash_needed) 0.00 : 5ba5be: 49 8b 86 f8 00 00 00 mov 0xf8(%r14),%rax 0.00 : 5ba5c5: 48 85 c0 test %rax,%rax 0.00 : 5ba5c8: 74 3a je 5ba604 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/nodes/pg_list.h:87 5.26 : 5ba5ca: 48 8b 70 08 mov 0x8(%rax),%rsi /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1044 5.26 : 5ba5ce: 48 85 f6 test %rsi,%rsi 0.00 : 5ba5d1: 74 31 je 5ba604 : { : int varNumber = lfirst_int(l) - 1; : : hashslot->tts_values[varNumber] = inputslot->tts_values[varNumber]; 0.00 : 5ba5d3: 8b 06 mov (%rsi),%eax 0.00 : 5ba5d5: 48 8b 53 28 mov 0x28(%rbx),%rdx 0.00 : 5ba5d9: 49 8b 4c 24 28 mov 0x28(%r12),%rcx 0.00 : 5ba5de: 83 e8 01 sub $0x1,%eax 0.00 : 5ba5e1: 48 98 cltq /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1048 5.26 : 5ba5e3: 48 8b 14 c2 mov (%rdx,%rax,8),%rdx 10.53 : 5ba5e7: 48 89 14 c1 mov %rdx,(%rcx,%rax,8) : hashslot->tts_isnull[varNumber] = inputslot->tts_isnull[varNumber]; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1049 5.26 : 5ba5eb: 48 8b 53 30 mov 0x30(%rbx),%rdx 0.00 : 5ba5ef: 49 8b 4c 24 30 mov 0x30(%r12),%rcx 0.00 : 5ba5f4: 0f b6 14 02 movzbl (%rdx,%rax,1),%edx 0.00 : 5ba5f8: 88 14 01 mov %dl,(%rcx,%rax,1) : ExecStoreAllNullTuple(hashslot); : } : : /* transfer just the needed columns into hashslot */ : slot_getsomeattrs(inputslot, linitial_int(aggstate->hash_needed)); : foreach(l, aggstate->hash_needed) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1044 15.79 : 5ba5fb: 48 8b 76 08 mov 0x8(%rsi),%rsi 0.00 : 5ba5ff: 48 85 f6 test %rsi,%rsi 0.00 : 5ba602: 75 cf jne 5ba5d3 : hashslot->tts_values[varNumber] = inputslot->tts_values[varNumber]; : hashslot->tts_isnull[varNumber] = inputslot->tts_isnull[varNumber]; : } : : /* find or create the hashtable entry using the filtered tuple */ : entry = (AggHashEntry) LookupTupleHashEntry(aggstate->hashtable, 0.00 : 5ba604: 49 8b be e8 00 00 00 mov 0xe8(%r14),%rdi 0.00 : 5ba60b: 48 8d 55 d4 lea -0x2c(%rbp),%rdx 0.00 : 5ba60f: 4c 89 e6 mov %r12,%rsi 0.00 : 5ba612: e8 59 e8 fe ff callq 5a8e70 : hashslot, : &isnew); : : if (isnew) 0.00 : 5ba617: 80 7d d4 00 cmpb $0x0,-0x2c(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1057 5.26 : 5ba61b: 48 8d 58 08 lea 0x8(%rax),%rbx 0.00 : 5ba61f: 74 12 je 5ba633 : { : /* initialize aggregates for new tuple group */ : initialize_aggregates(aggstate, aggstate->peragg, entry->pergroup); 0.00 : 5ba621: 49 8b b6 b0 00 00 00 mov 0xb0(%r14),%rsi 0.00 : 5ba628: 48 89 da mov %rbx,%rdx 0.00 : 5ba62b: 4c 89 f7 mov %r14,%rdi 0.00 : 5ba62e: e8 9d ef ff ff callq 5b95d0 : : /* Find or build hashtable entry for this tuple's group */ : entry = lookup_hash_entry(aggstate, outerslot); : : /* Advance the aggregates */ : advance_aggregates(aggstate, entry->pergroup); /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:1359 5.26 : 5ba633: 4c 89 f7 mov %r14,%rdi 0.00 : 5ba636: 48 89 de mov %rbx,%rsi 0.00 : 5ba639: e8 12 f3 ff ff callq 5b9950 : : /* Reset per-input-tuple context after each tuple */ : ResetExprContext(tmpcontext); 0.00 : 5ba63e: 49 8b 7f 28 mov 0x28(%r15),%rdi 0.00 : 5ba642: e8 69 e3 1d 00 callq 7989b0 0.00 : 5ba647: e9 11 ff ff ff jmpq 5ba55d : } : : aggstate->table_filled = true; : /* Initialize to walk the hash table */ : ResetTupleHashIterator(aggstate->hashtable, &aggstate->hashiter); 0.00 : 5ba64c: 49 8b 86 e8 00 00 00 mov 0xe8(%r14),%rax : : /* Reset per-input-tuple context after each tuple */ : ResetExprContext(tmpcontext); : } : : aggstate->table_filled = true; 0.00 : 5ba653: 41 c6 86 00 01 00 00 movb $0x1,0x100(%r14) 0.00 : 5ba65a: 01 : /* Initialize to walk the hash table */ : ResetTupleHashIterator(aggstate->hashtable, &aggstate->hashiter); 0.00 : 5ba65b: 4d 8d be 08 01 00 00 lea 0x108(%r14),%r15 0.00 : 5ba662: 48 8b 38 mov (%rax),%rdi 0.00 : 5ba665: e8 f6 92 1c 00 callq 783960 0.00 : 5ba66a: 49 8b 86 e8 00 00 00 mov 0xe8(%r14),%rax 0.00 : 5ba671: 4c 89 ff mov %r15,%rdi 0.00 : 5ba674: 48 8b 30 mov (%rax),%rsi 0.00 : 5ba677: e8 b4 97 1c 00 callq 783e30 0.00 : 5ba67c: 41 0f b6 86 d0 00 00 movzbl 0xd0(%r14),%eax 0.00 : 5ba683: 00 0.00 : 5ba684: e9 6c f7 ff ff jmpq 5b9df5 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: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:870 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:877 5.88 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:909 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 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); 0.00 : 4960f1: 48 8d 47 48 lea 0x48(%rdi),%rax : static void : heapgettup_pagemode(HeapScanDesc scan, : ScanDirection dir, : int nkeys, : ScanKey key) : { 0.00 : 4960f5: 48 89 e5 mov %rsp,%rbp 0.00 : 4960f8: 41 57 push %r15 0.00 : 4960fa: 41 56 push %r14 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:730 5.88 : 4960fc: 41 55 push %r13 5.88 : 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) : { 0.00 : 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 0.00 : 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 5.88 : 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) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:877 5.88 : 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) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:909 5.88 : 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 0.00 : 496459: 89 55 c4 mov %edx,-0x3c(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:774 5.88 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:965 5.88 : 49657e: 41 5d pop %r13 0.00 : 496580: 41 5e pop %r14 0.00 : 496582: 41 5f pop %r15 0.00 : 496584: c9 leaveq 5.88 : 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 ---------------------------------------------- 94.12 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:867 5.88 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:853 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.00 : 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.00 : 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.00 : 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.00 : 5bc4a6: f2 41 0f 10 4d 60 movsd 0x60(%r13),%xmm1 0.00 : 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); /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:853 5.88 : 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.00 : 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); 0.00 : 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.00 : 5bc4ea: 48 8b 04 d0 mov (%rax,%rdx,8),%rax /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:867 94.12 : 5bc4ee: 49 89 04 24 mov %rax,(%r12) : hashtable->buckets[bucketno] = hashTuple; 0.00 : 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.00 : 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.00 : 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.00 : 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.00 : 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 ---------------------------------------------- 18.75 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 12.50 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:511 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 6.25 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 6.25 /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) : { 0.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 12.50 : 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) : { /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:511 6.25 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:519 6.25 : 490678: 89 f8 mov %edi,%eax 0.00 : 49067a: c1 c8 07 ror $0x7,%eax 6.25 : 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); 0.00 : 490686: 89 f0 mov %esi,%eax 0.00 : 490688: 89 f2 mov %esi,%edx 0.00 : 49068a: c1 ca 10 ror $0x10,%edx 18.75 : 49068d: 35 64 d8 6a 2a xor $0x2a6ad864,%eax 0.00 : 490692: 29 d0 sub %edx,%eax 6.25 : 490694: 89 c2 mov %eax,%edx 12.50 : 490696: 89 c1 mov %eax,%ecx 0.00 : 490698: c1 c9 1c ror $0x1c,%ecx 12.50 : 49069b: 31 fa xor %edi,%edx 0.00 : 49069d: 29 ca sub %ecx,%edx 6.25 : 49069f: 89 d1 mov %edx,%ecx 0.00 : 4906a1: c1 ca 12 ror $0x12,%edx 0.00 : 4906a4: 31 f1 xor %esi,%ecx 0.00 : 4906a6: 29 d1 sub %edx,%ecx 0.00 : 4906a8: 31 c8 xor %ecx,%eax 12.50 : 4906aa: c1 c9 08 ror $0x8,%ecx 0.00 : 4906ad: 29 c8 sub %ecx,%eax Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:195 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:230 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:111 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:111 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:111 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:111 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:140 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:140 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:165 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:41 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:43 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:195 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:200 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:210 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:111 6.25 : 5b3751: 48 89 e5 mov %rsp,%rbp 0.00 : 5b3754: 41 57 push %r15 6.25 : 5b3756: 41 56 push %r14 6.25 : 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 6.25 : 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; 0.00 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:140 6.25 : 5b378e: 41 80 7c 24 70 00 cmpb $0x0,0x70(%r12) 0.00 : 5b3794: 0f 85 a6 01 00 00 jne 5b3940 6.25 : 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(); /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:165 6.25 : 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; /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:41 6.25 : 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 6.25 : 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 0.00 : 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 12.50 : 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 6.25 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:200 6.25 : 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) 0.00 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:210 6.25 : 5b38b9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : /* : * Tuple fails qual, so free per-tuple memory and try again. : */ : ResetExprContext(econtext); : } : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execScan.c:230 12.50 : 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 0.00 : 5b38cc: 41 5e pop %r14 0.00 : 5b38ce: 41 5f pop %r15 0.00 : 5b38d0: c9 leaveq 0.00 : 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 0.00 : 5b38db: ff 55 b8 callq *-0x48(%rbp) 0.00 : 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 /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:995 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:970 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:970 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:984 6.25 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:995 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) : { 0.00 : 5bbe90: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:923 6.25 : 5bbe91: 48 89 e5 mov %rsp,%rbp 0.00 : 5bbe94: 41 57 push %r15 0.00 : 5bbe96: 49 89 ff mov %rdi,%r15 6.25 : 5bbe99: 41 56 push %r14 0.00 : 5bbe9b: 49 89 f6 mov %rsi,%r14 6.25 : 5bbe9e: 41 55 push %r13 0.00 : 5bbea0: 41 54 push %r12 12.50 : 5bbea2: 49 89 d4 mov %rdx,%r12 0.00 : 5bbea5: 53 push %rbx 6.25 : 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; /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 6.25 : 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 6.25 : 5bbec6: 48 89 45 c0 mov %rax,-0x40(%rbp) : : CurrentMemoryContext = context; 0.00 : 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; 0.00 : 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 0.00 : 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 0.00 : 5bbf0f: 48 89 c7 mov %rax,%rdi 0.00 : 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 6.25 : 5bbf15: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) 6.25 : 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 6.25 : 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; 0.00 : 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 12.50 : 5bbf88: 48 8b 45 c0 mov -0x40(%rbp),%rax 0.00 : 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 12.50 : 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 6.25 : 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 /lib64/libc-2.11.3.so ---------------------------------------------- 53.33 ??:0 20.00 ??:0 13.33 ??:0 13.33 ??:0 Percent | Source code & Disassembly of /lib64/libc-2.11.3.so ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000099390 <__gettimeofday>: ??:0 13.33 : 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> 13.33 : 9939b: 48 c1 c8 11 ror $0x11,%rax 20.00 : 9939f: 64 48 33 04 25 30 00 xor %fs:0x30,%rax 0.00 : 993a6: 00 00 53.33 : 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 /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:534 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:544 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:534 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:531 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:531 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:536 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:556 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:606 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:600 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:600 7.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:603 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b9950 : : * : * When called, CurrentMemoryContext should be the per-query context. : */ : static void : advance_aggregates(AggState *aggstate, AggStatePerGroup pergroup) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:531 7.14 : 5b9950: 55 push %rbp 0.00 : 5b9951: 48 89 e5 mov %rsp,%rbp 0.00 : 5b9954: 41 57 push %r15 0.00 : 5b9956: 49 89 ff mov %rdi,%r15 0.00 : 5b9959: 41 56 push %r14 0.00 : 5b995b: 41 55 push %r13 7.14 : 5b995d: 41 54 push %r12 0.00 : 5b995f: 53 push %rbx 0.00 : 5b9960: 48 83 ec 18 sub $0x18,%rsp 0.00 : 5b9964: 48 89 75 c0 mov %rsi,-0x40(%rbp) : int aggno; : : for (aggno = 0; aggno < aggstate->numaggs; aggno++) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:534 14.29 : 5b9968: 44 8b 9f 98 00 00 00 mov 0x98(%rdi),%r11d 0.00 : 5b996f: 45 85 db test %r11d,%r11d 0.00 : 5b9972: 0f 8e c1 00 00 00 jle 5b9a39 0.00 : 5b9978: 45 31 f6 xor %r14d,%r14d 0.00 : 5b997b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : { : AggStatePerAgg peraggstate = &aggstate->peragg[aggno]; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:536 7.14 : 5b9980: 4d 63 ee movslq %r14d,%r13 0.00 : 5b9983: 49 69 dd a8 04 00 00 imul $0x4a8,%r13,%rbx 0.00 : 5b998a: 49 03 9f b0 00 00 00 add 0xb0(%r15),%rbx : AggStatePerGroup pergroupstate = &pergroup[aggno]; : ExprState *filter = peraggstate->aggrefstate->aggfilter; 0.00 : 5b9991: 48 8b 03 mov (%rbx),%rax : int numTransInputs = peraggstate->numTransInputs; 0.00 : 5b9994: 44 8b 63 18 mov 0x18(%rbx),%r12d : : for (aggno = 0; aggno < aggstate->numaggs; aggno++) : { : AggStatePerAgg peraggstate = &aggstate->peragg[aggno]; : AggStatePerGroup pergroupstate = &pergroup[aggno]; : ExprState *filter = peraggstate->aggrefstate->aggfilter; 0.00 : 5b9998: 48 8b 78 28 mov 0x28(%rax),%rdi : int numTransInputs = peraggstate->numTransInputs; : int i; : TupleTableSlot *slot; : : /* Skip anything FILTERed out */ : if (filter) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:544 14.29 : 5b999c: 48 85 ff test %rdi,%rdi 0.00 : 5b999f: 74 1c je 5b99bd : { : Datum res; : bool isnull; : : res = ExecEvalExprSwitchContext(filter, aggstate->tmpcontext, 0.00 : 5b99a1: 49 8b b7 c0 00 00 00 mov 0xc0(%r15),%rsi 0.00 : 5b99a8: 48 8d 55 d7 lea -0x29(%rbp),%rdx 0.00 : 5b99ac: 31 c9 xor %ecx,%ecx 0.00 : 5b99ae: e8 2d 35 ff ff callq 5acee0 : &isnull, NULL); : if (isnull || !DatumGetBool(res)) 0.00 : 5b99b3: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) 0.00 : 5b99b7: 75 6f jne 5b9a28 0.00 : 5b99b9: 84 c0 test %al,%al 0.00 : 5b99bb: 74 6b je 5b9a28 : continue; : } : : /* Evaluate the current input expressions for this aggregate */ : slot = ExecProject(peraggstate->evalproj, NULL); /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:556 7.14 : 5b99bd: 48 8b bb e0 00 00 00 mov 0xe0(%rbx),%rdi 0.00 : 5b99c4: 31 f6 xor %esi,%esi 0.00 : 5b99c6: e8 35 36 ff ff callq 5ad000 : : if (peraggstate->numSortCols > 0) 0.00 : 5b99cb: 44 8b 93 8c 00 00 00 mov 0x8c(%rbx),%r10d : if (isnull || !DatumGetBool(res)) : continue; : } : : /* Evaluate the current input expressions for this aggregate */ : slot = ExecProject(peraggstate->evalproj, NULL); 0.00 : 5b99d2: 48 89 c1 mov %rax,%rcx : : if (peraggstate->numSortCols > 0) 0.00 : 5b99d5: 45 85 d2 test %r10d,%r10d 0.00 : 5b99d8: 7e 76 jle 5b9a50 : * storing the row in the sorter, to save space if there are a lot : * of nulls. Note that we must only check numTransInputs columns, : * not numInputs, since nullity in columns used only for sorting : * is not relevant here. : */ : if (peraggstate->transfn.fn_strict) 0.00 : 5b99da: 80 7b 36 00 cmpb $0x0,0x36(%rbx) 0.00 : 5b99de: 74 2c je 5b9a0c : { : for (i = 0; i < numTransInputs; i++) 0.00 : 5b99e0: 45 85 e4 test %r12d,%r12d 0.00 : 5b99e3: 7e 27 jle 5b9a0c : { : if (slot->tts_isnull[i]) 0.00 : 5b99e5: 48 8b 40 30 mov 0x30(%rax),%rax 0.00 : 5b99e9: 31 d2 xor %edx,%edx 0.00 : 5b99eb: 80 38 00 cmpb $0x0,(%rax) 0.00 : 5b99ee: 48 89 c6 mov %rax,%rsi 0.00 : 5b99f1: 74 11 je 5b9a04 0.00 : 5b99f3: eb 33 jmp 5b9a28 0.00 : 5b99f5: 0f 1f 00 nopl (%rax) 0.00 : 5b99f8: 0f b6 46 01 movzbl 0x1(%rsi),%eax 0.00 : 5b99fc: 48 83 c6 01 add $0x1,%rsi 0.00 : 5b9a00: 84 c0 test %al,%al 0.00 : 5b9a02: 75 24 jne 5b9a28 : * not numInputs, since nullity in columns used only for sorting : * is not relevant here. : */ : if (peraggstate->transfn.fn_strict) : { : for (i = 0; i < numTransInputs; i++) 0.00 : 5b9a04: 83 c2 01 add $0x1,%edx 0.00 : 5b9a07: 41 39 d4 cmp %edx,%r12d 0.00 : 5b9a0a: 7f ec jg 5b99f8 : if (i < numTransInputs) : continue; : } : : /* OK, put the tuple into the tuplesort object */ : if (peraggstate->numInputs == 1) 0.00 : 5b9a0c: 83 7b 14 01 cmpl $0x1,0x14(%rbx) 0.00 : 5b9a10: 0f 84 8a 00 00 00 je 5b9aa0 : tuplesort_putdatum(peraggstate->sortstate, : slot->tts_values[0], : slot->tts_isnull[0]); : else : tuplesort_puttupleslot(peraggstate->sortstate, slot); 0.00 : 5b9a16: 48 8b bb f8 00 00 00 mov 0xf8(%rbx),%rdi 0.00 : 5b9a1d: 48 89 ce mov %rcx,%rsi 0.00 : 5b9a20: e8 0b 56 1e 00 callq 79f030 0.00 : 5b9a25: 0f 1f 00 nopl (%rax) : static void : advance_aggregates(AggState *aggstate, AggStatePerGroup pergroup) : { : int aggno; : : for (aggno = 0; aggno < aggstate->numaggs; aggno++) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:534 14.29 : 5b9a28: 41 83 c6 01 add $0x1,%r14d 0.00 : 5b9a2c: 45 39 b7 98 00 00 00 cmp %r14d,0x98(%r15) 0.00 : 5b9a33: 0f 8f 47 ff ff ff jg 5b9980 : } : : advance_transition_function(aggstate, peraggstate, pergroupstate); : } : } : } 0.00 : 5b9a39: 48 83 c4 18 add $0x18,%rsp /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:606 7.14 : 5b9a3d: 5b pop %rbx 0.00 : 5b9a3e: 41 5c pop %r12 0.00 : 5b9a40: 41 5d pop %r13 0.00 : 5b9a42: 41 5e pop %r14 0.00 : 5b9a44: 41 5f pop %r15 0.00 : 5b9a46: c9 leaveq 0.00 : 5b9a47: c3 retq 0.00 : 5b9a48: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 5b9a4f: 00 : if (peraggstate->numInputs == 1) : tuplesort_putdatum(peraggstate->sortstate, : slot->tts_values[0], : slot->tts_isnull[0]); : else : tuplesort_puttupleslot(peraggstate->sortstate, slot); 0.00 : 5b9a50: 31 d2 xor %edx,%edx : FunctionCallInfo fcinfo = &peraggstate->transfn_fcinfo; : : /* Load values into fcinfo */ : /* Start from 1, since the 0th arg will be the transition value */ : Assert(slot->tts_nvalid >= numTransInputs); : for (i = 0; i < numTransInputs; i++) 0.00 : 5b9a52: 45 85 e4 test %r12d,%r12d 0.00 : 5b9a55: 7e 31 jle 5b9a88 0.00 : 5b9a57: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5b9a5e: 00 00 : { : fcinfo->arg[i + 1] = slot->tts_values[i]; 0.00 : 5b9a60: 48 8b 41 28 mov 0x28(%rcx),%rax 0.00 : 5b9a64: 48 8b 04 d0 mov (%rax,%rdx,8),%rax 0.00 : 5b9a68: 48 89 84 d3 28 01 00 mov %rax,0x128(%rbx,%rdx,8) 0.00 : 5b9a6f: 00 : fcinfo->argnull[i + 1] = slot->tts_isnull[i]; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:600 7.14 : 5b9a70: 48 8b 41 30 mov 0x30(%rcx),%rax 0.00 : 5b9a74: 0f b6 04 10 movzbl (%rax,%rdx,1),%eax 0.00 : 5b9a78: 88 84 13 41 04 00 00 mov %al,0x441(%rbx,%rdx,1) 7.14 : 5b9a7f: 48 83 c2 01 add $0x1,%rdx : FunctionCallInfo fcinfo = &peraggstate->transfn_fcinfo; : : /* Load values into fcinfo */ : /* Start from 1, since the 0th arg will be the transition value */ : Assert(slot->tts_nvalid >= numTransInputs); : for (i = 0; i < numTransInputs; i++) 0.00 : 5b9a83: 41 39 d4 cmp %edx,%r12d 0.00 : 5b9a86: 7f d8 jg 5b9a60 : { : fcinfo->arg[i + 1] = slot->tts_values[i]; : fcinfo->argnull[i + 1] = slot->tts_isnull[i]; : } : : advance_transition_function(aggstate, peraggstate, pergroupstate); 0.00 : 5b9a88: 48 8b 55 c0 mov -0x40(%rbp),%rdx 0.00 : 5b9a8c: 49 c1 e5 04 shl $0x4,%r13 0.00 : 5b9a90: 48 89 de mov %rbx,%rsi 0.00 : 5b9a93: 4c 89 ff mov %r15,%rdi 0.00 : 5b9a96: 4c 01 ea add %r13,%rdx /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:603 7.14 : 5b9a99: e8 f2 fc ff ff callq 5b9790 0.00 : 5b9a9e: eb 88 jmp 5b9a28 : continue; : } : : /* OK, put the tuple into the tuplesort object */ : if (peraggstate->numInputs == 1) : tuplesort_putdatum(peraggstate->sortstate, 0.00 : 5b9aa0: 48 8b 41 30 mov 0x30(%rcx),%rax 0.00 : 5b9aa4: 48 8b bb f8 00 00 00 mov 0xf8(%rbx),%rdi 0.00 : 5b9aab: 0f be 10 movsbl (%rax),%edx 0.00 : 5b9aae: 48 8b 41 28 mov 0x28(%rcx),%rax 0.00 : 5b9ab2: 48 8b 30 mov (%rax),%rsi 0.00 : 5b9ab5: e8 66 54 1e 00 callq 79ef20 0.00 : 5b9aba: e9 69 ff ff ff jmpq 5b9a28 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 15.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:504 15.38 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:504 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:479 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:483 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:513 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:515 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:515 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:504 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:504 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:526 7.69 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:526 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005a9120 : : * Also, the caller must select an appropriate memory context for running : * the hash functions. (dynahash.c doesn't change CurrentMemoryContext.) : */ : static uint32 : TupleHashTableHash(const void *key, Size keysize) : { 0.00 : 5a9120: 55 push %rbp 0.00 : 5a9121: 48 89 e5 mov %rsp,%rbp 0.00 : 5a9124: 41 57 push %r15 0.00 : 5a9126: 41 56 push %r14 0.00 : 5a9128: 41 55 push %r13 0.00 : 5a912a: 41 54 push %r12 0.00 : 5a912c: 53 push %rbx /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:479 7.69 : 5a912d: 48 83 ec 18 sub $0x18,%rsp : MinimalTuple tuple = ((const TupleHashEntryData *) key)->firstTuple; : TupleTableSlot *slot; : TupleHashTable hashtable = CurTupleHashTable; 0.00 : 5a9131: 48 8b 1d 88 07 5d 00 mov 0x5d0788(%rip),%rbx # b798c0 : * the hash functions. (dynahash.c doesn't change CurrentMemoryContext.) : */ : static uint32 : TupleHashTableHash(const void *key, Size keysize) : { : MinimalTuple tuple = ((const TupleHashEntryData *) key)->firstTuple; 0.00 : 5a9138: 48 8b 3f mov (%rdi),%rdi : TupleTableSlot *slot; : TupleHashTable hashtable = CurTupleHashTable; : int numCols = hashtable->numCols; 0.00 : 5a913b: 8b 43 08 mov 0x8(%rbx),%eax : AttrNumber *keyColIdx = hashtable->keyColIdx; : FmgrInfo *hashfunctions; : uint32 hashkey = 0; : int i; : : if (tuple == NULL) 0.00 : 5a913e: 48 85 ff test %rdi,%rdi : TupleHashTableHash(const void *key, Size keysize) : { : MinimalTuple tuple = ((const TupleHashEntryData *) key)->firstTuple; : TupleTableSlot *slot; : TupleHashTable hashtable = CurTupleHashTable; : int numCols = hashtable->numCols; /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:483 7.69 : 5a9141: 89 45 c4 mov %eax,-0x3c(%rbp) : AttrNumber *keyColIdx = hashtable->keyColIdx; 0.00 : 5a9144: 4c 8b 63 10 mov 0x10(%rbx),%r12 : FmgrInfo *hashfunctions; : uint32 hashkey = 0; : int i; : : if (tuple == NULL) 0.00 : 5a9148: 0f 84 8a 00 00 00 je 5a91d8 : } : else : { : /* Process a tuple already stored in the table */ : /* (this case never actually occurs in current dynahash.c code) */ : slot = hashtable->tableslot; 0.00 : 5a914e: 4c 8b 7b 40 mov 0x40(%rbx),%r15 : ExecStoreMinimalTuple(tuple, slot, false); 0.00 : 5a9152: 31 d2 xor %edx,%edx 0.00 : 5a9154: 4c 89 fe mov %r15,%rsi 0.00 : 5a9157: e8 84 b2 00 00 callq 5b43e0 : hashfunctions = hashtable->tab_hash_funcs; 0.00 : 5a915c: 48 8b 43 18 mov 0x18(%rbx),%rax : } : : for (i = 0; i < numCols; i++) 0.00 : 5a9160: 8b 55 c4 mov -0x3c(%rbp),%edx 0.00 : 5a9163: 45 31 ed xor %r13d,%r13d 0.00 : 5a9166: 85 d2 test %edx,%edx 0.00 : 5a9168: 7e 58 jle 5a91c2 0.00 : 5a916a: 49 89 c6 mov %rax,%r14 0.00 : 5a916d: 45 31 ed xor %r13d,%r13d 0.00 : 5a9170: 31 db xor %ebx,%ebx /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:504 15.38 : 5a9172: eb 14 jmp 5a9188 0.00 : 5a9174: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 5a9178: 83 c3 01 add $0x1,%ebx 0.00 : 5a917b: 49 83 c4 02 add $0x2,%r12 0.00 : 5a917f: 49 83 c6 30 add $0x30,%r14 0.00 : 5a9183: 39 5d c4 cmp %ebx,-0x3c(%rbp) 0.00 : 5a9186: 7e 3a jle 5a91c2 : bool isNull; : : /* rotate hashkey left 1 bit at each step */ : hashkey = (hashkey << 1) | ((hashkey & 0x80000000) ? 1 : 0); : : attr = slot_getattr(slot, att, &isNull); 0.00 : 5a9188: 41 0f bf 34 24 movswl (%r12),%esi 0.00 : 5a918d: 48 8d 55 d7 lea -0x29(%rbp),%rdx 0.00 : 5a9191: 4c 89 ff mov %r15,%rdi : AttrNumber att = keyColIdx[i]; : Datum attr; : bool isNull; : : /* rotate hashkey left 1 bit at each step */ : hashkey = (hashkey << 1) | ((hashkey & 0x80000000) ? 1 : 0); 0.00 : 5a9194: 41 d1 c5 rol %r13d : : attr = slot_getattr(slot, att, &isNull); /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:513 7.69 : 5a9197: e8 64 62 ec ff callq 46f400 : : if (!isNull) /* treat nulls as having hash key 0 */ /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:515 7.69 : 5a919c: 80 7d d7 00 cmpb $0x0,-0x29(%rbp) 7.69 : 5a91a0: 75 d6 jne 5a9178 : { : uint32 hkey; : : hkey = DatumGetUInt32(FunctionCall1(&hashfunctions[i], 0.00 : 5a91a2: 31 f6 xor %esi,%esi 0.00 : 5a91a4: 4c 89 f7 mov %r14,%rdi 0.00 : 5a91a7: 48 89 c2 mov %rax,%rdx 0.00 : 5a91aa: e8 21 4f 1d 00 callq 77e0d0 : slot = hashtable->tableslot; : ExecStoreMinimalTuple(tuple, slot, false); : hashfunctions = hashtable->tab_hash_funcs; : } : : for (i = 0; i < numCols; i++) /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:504 7.69 : 5a91af: 83 c3 01 add $0x1,%ebx : { : uint32 hkey; : : hkey = DatumGetUInt32(FunctionCall1(&hashfunctions[i], : attr)); : hashkey ^= hkey; 0.00 : 5a91b2: 41 31 c5 xor %eax,%r13d : slot = hashtable->tableslot; : ExecStoreMinimalTuple(tuple, slot, false); : hashfunctions = hashtable->tab_hash_funcs; : } : : for (i = 0; i < numCols; i++) 7.69 : 5a91b5: 49 83 c4 02 add $0x2,%r12 0.00 : 5a91b9: 49 83 c6 30 add $0x30,%r14 15.38 : 5a91bd: 39 5d c4 cmp %ebx,-0x3c(%rbp) 0.00 : 5a91c0: 7f c6 jg 5a9188 : hashkey ^= hkey; : } : } : : return hashkey; : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:526 7.69 : 5a91c2: 48 83 c4 18 add $0x18,%rsp 0.00 : 5a91c6: 44 89 e8 mov %r13d,%eax 7.69 : 5a91c9: 5b pop %rbx 0.00 : 5a91ca: 41 5c pop %r12 0.00 : 5a91cc: 41 5d pop %r13 0.00 : 5a91ce: 41 5e pop %r14 0.00 : 5a91d0: 41 5f pop %r15 0.00 : 5a91d2: c9 leaveq 0.00 : 5a91d3: c3 retq 0.00 : 5a91d4: 0f 1f 40 00 nopl 0x0(%rax) : int i; : : if (tuple == NULL) : { : /* Process the current input tuple for the table */ : slot = hashtable->inputslot; 0.00 : 5a91d8: 4c 8b 7b 48 mov 0x48(%rbx),%r15 : hashfunctions = hashtable->in_hash_funcs; 0.00 : 5a91dc: 48 8b 43 50 mov 0x50(%rbx),%rax 0.00 : 5a91e0: e9 7b ff ff ff jmpq 5a9160 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 23.08 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:153 15.38 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:157 7.69 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:294 7.69 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:294 7.69 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:294 7.69 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:303 7.69 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:303 7.69 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:311 7.69 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:311 7.69 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:304 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006fd330 : : PG_RETURN_BOOL(result); : } : : Datum : textnlike(PG_FUNCTION_ARGS) : { 0.00 : 6fd330: 55 push %rbp 0.00 : 6fd331: 48 89 e5 mov %rsp,%rbp 0.00 : 6fd334: 48 89 5d e0 mov %rbx,-0x20(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:294 7.69 : 6fd338: 4c 89 65 e8 mov %r12,-0x18(%rbp) 7.69 : 6fd33c: 48 89 fb mov %rdi,%rbx 0.00 : 6fd33f: 4c 89 75 f8 mov %r14,-0x8(%rbp) 0.00 : 6fd343: 4c 89 6d f0 mov %r13,-0x10(%rbp) 7.69 : 6fd347: 48 83 ec 20 sub $0x20,%rsp : text *str = PG_GETARG_TEXT_PP(0); 0.00 : 6fd34b: 48 8b 7f 20 mov 0x20(%rdi),%rdi 0.00 : 6fd34f: e8 8c 19 08 00 callq 77ece0 : text *pat = PG_GETARG_TEXT_PP(1); 0.00 : 6fd354: 48 8b 7b 28 mov 0x28(%rbx),%rdi : } : : Datum : textnlike(PG_FUNCTION_ARGS) : { : text *str = PG_GETARG_TEXT_PP(0); 0.00 : 6fd358: 49 89 c4 mov %rax,%r12 : char *s, : *p; : int slen, : plen; : : s = VARDATA_ANY(str); 0.00 : 6fd35b: 4d 8d 74 24 01 lea 0x1(%r12),%r14 : : Datum : textnlike(PG_FUNCTION_ARGS) : { : text *str = PG_GETARG_TEXT_PP(0); : text *pat = PG_GETARG_TEXT_PP(1); 0.00 : 6fd360: e8 7b 19 08 00 callq 77ece0 : char *s, : *p; : int slen, : plen; : : s = VARDATA_ANY(str); /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:303 7.69 : 6fd365: 41 0f b6 14 24 movzbl (%r12),%edx : : Datum : textnlike(PG_FUNCTION_ARGS) : { : text *str = PG_GETARG_TEXT_PP(0); : text *pat = PG_GETARG_TEXT_PP(1); 0.00 : 6fd36a: 48 89 c6 mov %rax,%rsi : char *s, : *p; : int slen, : plen; : : s = VARDATA_ANY(str); 7.69 : 6fd36d: 49 8d 44 24 04 lea 0x4(%r12),%rax 0.00 : 6fd372: 89 d1 mov %edx,%ecx 0.00 : 6fd374: 83 e1 01 and $0x1,%ecx 0.00 : 6fd377: 4c 0f 44 f0 cmove %rax,%r14 : slen = VARSIZE_ANY_EXHDR(str); 0.00 : 6fd37b: 80 fa 01 cmp $0x1,%dl 0.00 : 6fd37e: 0f 84 cc 00 00 00 je 6fd450 0.00 : 6fd384: 85 c9 test %ecx,%ecx 0.00 : 6fd386: 0f 85 84 00 00 00 jne 6fd410 0.00 : 6fd38c: 41 8b 04 24 mov (%r12),%eax 0.00 : 6fd390: c1 e8 02 shr $0x2,%eax 0.00 : 6fd393: 44 8d 68 fc lea -0x4(%rax),%r13d : p = VARDATA_ANY(pat); 0.00 : 6fd397: 0f b6 16 movzbl (%rsi),%edx 0.00 : 6fd39a: 4c 8d 66 01 lea 0x1(%rsi),%r12 0.00 : 6fd39e: 48 8d 46 04 lea 0x4(%rsi),%rax 0.00 : 6fd3a2: 89 d1 mov %edx,%ecx 0.00 : 6fd3a4: 83 e1 01 and $0x1,%ecx 0.00 : 6fd3a7: 4c 0f 44 e0 cmove %rax,%r12 : plen = VARSIZE_ANY_EXHDR(pat); 0.00 : 6fd3ab: 80 fa 01 cmp $0x1,%dl 0.00 : 6fd3ae: 0f 84 cc 00 00 00 je 6fd480 0.00 : 6fd3b4: 85 c9 test %ecx,%ecx 0.00 : 6fd3b6: 74 68 je 6fd420 0.00 : 6fd3b8: d0 ea shr %dl 0.00 : 6fd3ba: 0f b6 c2 movzbl %dl,%eax 0.00 : 6fd3bd: 8d 58 ff lea -0x1(%rax),%ebx : : /* Generic for all cases not requiring inline case-folding */ : static inline int : GenericMatchText(char *s, int slen, char *p, int plen) : { : if (pg_database_encoding_max_length() == 1) 0.00 : 6fd3c0: e8 cb e4 08 00 callq 78b890 0.00 : 6fd3c5: 83 e8 01 sub $0x1,%eax 0.00 : 6fd3c8: 74 68 je 6fd432 : return SB_MatchText(s, slen, p, plen, 0, true); : else if (GetDatabaseEncoding() == PG_UTF8) 0.00 : 6fd3ca: e8 11 b5 08 00 callq 7888e0 0.00 : 6fd3cf: 83 f8 06 cmp $0x6,%eax 0.00 : 6fd3d2: 0f 84 d0 00 00 00 je 6fd4a8 : return UTF8_MatchText(s, slen, p, plen, 0, true); : else : return MB_MatchText(s, slen, p, plen, 0, true); 0.00 : 6fd3d8: 41 b9 01 00 00 00 mov $0x1,%r9d 0.00 : 6fd3de: 45 31 c0 xor %r8d,%r8d 0.00 : 6fd3e1: 89 d9 mov %ebx,%ecx 0.00 : 6fd3e3: 4c 89 e2 mov %r12,%rdx 0.00 : 6fd3e6: 44 89 ee mov %r13d,%esi 0.00 : 6fd3e9: 4c 89 f7 mov %r14,%rdi 0.00 : 6fd3ec: e8 9f f3 ff ff callq 6fc790 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:157 15.38 : 6fd3f1: 83 e8 01 sub $0x1,%eax : plen = VARSIZE_ANY_EXHDR(pat); : : result = (GenericMatchText(s, slen, p, plen) != LIKE_TRUE); : : PG_RETURN_BOOL(result); : } 0.00 : 6fd3f4: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 6fd3f8: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 : if (pg_database_encoding_max_length() == 1) : return SB_MatchText(s, slen, p, plen, 0, true); : else if (GetDatabaseEncoding() == PG_UTF8) : return UTF8_MatchText(s, slen, p, plen, 0, true); : else : return MB_MatchText(s, slen, p, plen, 0, true); 0.00 : 6fd3fd: 0f 95 c0 setne %al : plen = VARSIZE_ANY_EXHDR(pat); : : result = (GenericMatchText(s, slen, p, plen) != LIKE_TRUE); : : PG_RETURN_BOOL(result); : } 0.00 : 6fd400: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 0.00 : 6fd405: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 : if (pg_database_encoding_max_length() == 1) : return SB_MatchText(s, slen, p, plen, 0, true); : else if (GetDatabaseEncoding() == PG_UTF8) : return UTF8_MatchText(s, slen, p, plen, 0, true); : else : return MB_MatchText(s, slen, p, plen, 0, true); 0.00 : 6fd40a: 0f b6 c0 movzbl %al,%eax : plen = VARSIZE_ANY_EXHDR(pat); : : result = (GenericMatchText(s, slen, p, plen) != LIKE_TRUE); : : PG_RETURN_BOOL(result); : } /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:311 7.69 : 6fd40d: c9 leaveq 7.69 : 6fd40e: c3 retq 0.00 : 6fd40f: 90 nop : *p; : int slen, : plen; : : s = VARDATA_ANY(str); : slen = VARSIZE_ANY_EXHDR(str); 0.00 : 6fd410: d0 ea shr %dl /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:304 7.69 : 6fd412: 0f b6 c2 movzbl %dl,%eax 0.00 : 6fd415: 44 8d 68 ff lea -0x1(%rax),%r13d 0.00 : 6fd419: e9 79 ff ff ff jmpq 6fd397 0.00 : 6fd41e: 66 90 xchg %ax,%ax : p = VARDATA_ANY(pat); : plen = VARSIZE_ANY_EXHDR(pat); 0.00 : 6fd420: 8b 06 mov (%rsi),%eax 0.00 : 6fd422: c1 e8 02 shr $0x2,%eax 0.00 : 6fd425: 8d 58 fc lea -0x4(%rax),%ebx : : /* Generic for all cases not requiring inline case-folding */ : static inline int : GenericMatchText(char *s, int slen, char *p, int plen) : { : if (pg_database_encoding_max_length() == 1) 0.00 : 6fd428: e8 63 e4 08 00 callq 78b890 0.00 : 6fd42d: 83 e8 01 sub $0x1,%eax 0.00 : 6fd430: 75 98 jne 6fd3ca : return SB_MatchText(s, slen, p, plen, 0, true); 0.00 : 6fd432: 41 b9 01 00 00 00 mov $0x1,%r9d 0.00 : 6fd438: 45 31 c0 xor %r8d,%r8d 0.00 : 6fd43b: 89 d9 mov %ebx,%ecx 0.00 : 6fd43d: 4c 89 e2 mov %r12,%rdx 0.00 : 6fd440: 44 89 ee mov %r13d,%esi 0.00 : 6fd443: 4c 89 f7 mov %r14,%rdi 0.00 : 6fd446: e8 b5 e7 ff ff callq 6fbc00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/like.c:153 23.08 : 6fd44b: eb a4 jmp 6fd3f1 0.00 : 6fd44d: 0f 1f 00 nopl (%rax) : *p; : int slen, : plen; : : s = VARDATA_ANY(str); : slen = VARSIZE_ANY_EXHDR(str); 0.00 : 6fd450: 41 0f b6 44 24 01 movzbl 0x1(%r12),%eax 0.00 : 6fd456: 41 bd 08 00 00 00 mov $0x8,%r13d 0.00 : 6fd45c: 3c 01 cmp $0x1,%al 0.00 : 6fd45e: 0f 84 33 ff ff ff je 6fd397 0.00 : 6fd464: 3c 12 cmp $0x12,%al 0.00 : 6fd466: 41 bd 01 00 00 00 mov $0x1,%r13d 0.00 : 6fd46c: b8 10 00 00 00 mov $0x10,%eax 0.00 : 6fd471: 44 0f 44 e8 cmove %eax,%r13d 0.00 : 6fd475: e9 1d ff ff ff jmpq 6fd397 0.00 : 6fd47a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : p = VARDATA_ANY(pat); : plen = VARSIZE_ANY_EXHDR(pat); 0.00 : 6fd480: 0f b6 46 01 movzbl 0x1(%rsi),%eax 0.00 : 6fd484: bb 08 00 00 00 mov $0x8,%ebx 0.00 : 6fd489: 3c 01 cmp $0x1,%al 0.00 : 6fd48b: 0f 84 2f ff ff ff je 6fd3c0 0.00 : 6fd491: 3c 12 cmp $0x12,%al 0.00 : 6fd493: bb 01 00 00 00 mov $0x1,%ebx 0.00 : 6fd498: b8 10 00 00 00 mov $0x10,%eax 0.00 : 6fd49d: 0f 44 d8 cmove %eax,%ebx 0.00 : 6fd4a0: e9 1b ff ff ff jmpq 6fd3c0 0.00 : 6fd4a5: 0f 1f 00 nopl (%rax) : GenericMatchText(char *s, int slen, char *p, int plen) : { : if (pg_database_encoding_max_length() == 1) : return SB_MatchText(s, slen, p, plen, 0, true); : else if (GetDatabaseEncoding() == PG_UTF8) : return UTF8_MatchText(s, slen, p, plen, 0, true); 0.00 : 6fd4a8: 41 b9 01 00 00 00 mov $0x1,%r9d 0.00 : 6fd4ae: 45 31 c0 xor %r8d,%r8d 0.00 : 6fd4b1: 89 d9 mov %ebx,%ecx 0.00 : 6fd4b3: 4c 89 e2 mov %r12,%rdx 0.00 : 6fd4b6: 44 89 ee mov %r13d,%esi 0.00 : 6fd4b9: 4c 89 f7 mov %r14,%rdi 0.00 : 6fd4bc: e8 ff e4 ff ff callq 6fb9c0 0.00 : 6fd4c1: e9 2b ff ff ff jmpq 6fd3f1 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/heap/heapam.c:394 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:402 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:396 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:401 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:406 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:409 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:409 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:411 8.33 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:414 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 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:396 8.33 : 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); /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:401 8.33 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:402 16.67 : 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); 0.00 : 495fc4: 0f b7 c0 movzwl %ax,%eax 0.00 : 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) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:406 8.33 : 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 25.00 : 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 8.33 : 496030: 48 8b 75 88 mov -0x78(%rbp),%rsi 8.33 : 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, /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:411 8.33 : 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); 0.00 : 496041: 88 45 ae mov %al,-0x52(%rbp) : : CheckForSerializableConflictOut(valid, scan->rs_rd, &loctup, 0.00 : 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) /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:414 8.33 : 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 ---------------------------------------------- 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/common/heaptuple.c:1296 30.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1334 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: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) : { /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1296 30.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) 20.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 */ 0.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 0.00 : 46f2a0: 25 ff 07 00 00 and $0x7ff,%eax : attno = Min(attno, attnum); 0.00 : 46f2a5: 39 c6 cmp %eax,%esi 0.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) : } /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1334 30.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 0.00 : 46f2f2: c9 leaveq 20.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/access/heap/heapam.c:1506 30.00 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1508 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1483 10.00 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1494 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) : { /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1483 20.00 : 496e90: 55 push %rbp 0.00 : 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) 0.00 : 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 10.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/heapam.c:1506 40.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 30.00 : 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 0.00 : 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 ---------------------------------------------- 20.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:374 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:333 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:333 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:374 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:366 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:367 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:401 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:410 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005a8e70 : : * zeroed. : */ : TupleHashEntry : LookupTupleHashEntry(TupleHashTable hashtable, TupleTableSlot *slot, : bool *isnew) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:333 10.00 : 5a8e70: 55 push %rbp 10.00 : 5a8e71: 48 89 e5 mov %rsp,%rbp 0.00 : 5a8e74: 4c 89 65 e0 mov %r12,-0x20(%rbp) 0.00 : 5a8e78: 4c 89 6d e8 mov %r13,-0x18(%rbp) 0.00 : 5a8e7c: 49 89 fc mov %rdi,%r12 0.00 : 5a8e7f: 4c 89 75 f0 mov %r14,-0x10(%rbp) 0.00 : 5a8e83: 48 89 5d d8 mov %rbx,-0x28(%rbp) 0.00 : 5a8e87: 49 89 f6 mov %rsi,%r14 0.00 : 5a8e8a: 4c 89 7d f8 mov %r15,-0x8(%rbp) 0.00 : 5a8e8e: 48 83 ec 50 sub $0x50,%rsp : TupleHashTable saveCurHT; : TupleHashEntryData dummy; : bool found; : : /* If first time through, clone the input slot to make table slot */ : if (hashtable->tableslot == NULL) 0.00 : 5a8e92: 48 83 7f 40 00 cmpq $0x0,0x40(%rdi) : * zeroed. : */ : TupleHashEntry : LookupTupleHashEntry(TupleHashTable hashtable, TupleTableSlot *slot, : bool *isnew) : { 0.00 : 5a8e97: 49 89 d5 mov %rdx,%r13 : TupleHashTable saveCurHT; : TupleHashEntryData dummy; : bool found; : : /* If first time through, clone the input slot to make table slot */ : if (hashtable->tableslot == NULL) 0.00 : 5a8e9a: 0f 84 08 01 00 00 je 5a8fa8 : #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 : 5a8ea0: 48 8b 05 b9 19 61 00 mov 0x6119b9(%rip),%rax # bba860 : saveCurHT = CurTupleHashTable; : CurTupleHashTable = hashtable; : : /* Search the hash table */ : dummy.firstTuple = NULL; /* flag to reference inputslot */ : entry = (TupleHashEntry) hash_search(hashtable->hashtab, 0.00 : 5a8ea7: 31 d2 xor %edx,%edx 0.00 : 5a8ea9: 48 8d 4d cf lea -0x31(%rbp),%rcx /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:374 10.00 : 5a8ead: 4d 85 ed test %r13,%r13 0.00 : 5a8eb0: 48 8d 75 c0 lea -0x40(%rbp),%rsi : : saveCurHT = CurTupleHashTable; : CurTupleHashTable = hashtable; : : /* Search the hash table */ : dummy.firstTuple = NULL; /* flag to reference inputslot */ 0.00 : 5a8eb4: 48 c7 45 c0 00 00 00 movq $0x0,-0x40(%rbp) 0.00 : 5a8ebb: 00 : entry = (TupleHashEntry) hash_search(hashtable->hashtab, 0.00 : 5a8ebc: 0f 95 c2 setne %dl 0.00 : 5a8ebf: 48 89 45 b8 mov %rax,-0x48(%rbp) : : CurrentMemoryContext = context; 0.00 : 5a8ec3: 49 8b 44 24 30 mov 0x30(%r12),%rax 0.00 : 5a8ec8: 48 89 05 91 19 61 00 mov %rax,0x611991(%rip) # bba860 : * : * We save and restore CurTupleHashTable just in case someone manages to : * invoke this code re-entrantly. : */ : hashtable->inputslot = slot; : hashtable->in_hash_funcs = hashtable->tab_hash_funcs; 0.00 : 5a8ecf: 49 8b 44 24 18 mov 0x18(%r12),%rax : * Set up data needed by hash and match functions : * : * We save and restore CurTupleHashTable just in case someone manages to : * invoke this code re-entrantly. : */ : hashtable->inputslot = slot; 0.00 : 5a8ed4: 4d 89 74 24 48 mov %r14,0x48(%r12) : hashtable->in_hash_funcs = hashtable->tab_hash_funcs; /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:366 10.00 : 5a8ed9: 49 89 44 24 50 mov %rax,0x50(%r12) : hashtable->cur_eq_funcs = hashtable->tab_eq_funcs; /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:367 10.00 : 5a8ede: 49 8b 44 24 20 mov 0x20(%r12),%rax 0.00 : 5a8ee3: 49 89 44 24 58 mov %rax,0x58(%r12) : : saveCurHT = CurTupleHashTable; 0.00 : 5a8ee8: 4c 8b 3d d1 09 5d 00 mov 0x5d09d1(%rip),%r15 # b798c0 : CurTupleHashTable = hashtable; 0.00 : 5a8eef: 4c 89 25 ca 09 5d 00 mov %r12,0x5d09ca(%rip) # b798c0 : : /* Search the hash table */ : dummy.firstTuple = NULL; /* flag to reference inputslot */ : entry = (TupleHashEntry) hash_search(hashtable->hashtab, 0.00 : 5a8ef6: 49 8b 3c 24 mov (%r12),%rdi /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:374 20.00 : 5a8efa: e8 a1 b7 1d 00 callq 7846a0 : &dummy, : isnew ? HASH_ENTER : HASH_FIND, : &found); : : if (isnew) 0.00 : 5a8eff: 4d 85 ed test %r13,%r13 : saveCurHT = CurTupleHashTable; : CurTupleHashTable = hashtable; : : /* Search the hash table */ : dummy.firstTuple = NULL; /* flag to reference inputslot */ : entry = (TupleHashEntry) hash_search(hashtable->hashtab, 0.00 : 5a8f02: 48 89 c3 mov %rax,%rbx : &dummy, : isnew ? HASH_ENTER : HASH_FIND, : &found); : : if (isnew) 0.00 : 5a8f05: 74 41 je 5a8f48 : { : if (found) 0.00 : 5a8f07: 80 7d cf 00 cmpb $0x0,-0x31(%rbp) 0.00 : 5a8f0b: 75 6b jne 5a8f78 : * : * Zero any caller-requested space in the entry. (This zaps the : * "key data" dynahash.c copied into the new entry, but we don't : * care since we're about to overwrite it anyway.) : */ : MemSet(entry, 0, hashtable->entrysize); 0.00 : 5a8f0d: 49 8b 54 24 38 mov 0x38(%r12),%rdx 0.00 : 5a8f12: 48 09 d0 or %rdx,%rax 0.00 : 5a8f15: a8 07 test $0x7,%al 0.00 : 5a8f17: 75 09 jne 5a8f22 0.00 : 5a8f19: 48 81 fa 00 04 00 00 cmp $0x400,%rdx 0.00 : 5a8f20: 76 5e jbe 5a8f80 0.00 : 5a8f22: 31 f6 xor %esi,%esi 0.00 : 5a8f24: 48 89 df mov %rbx,%rdi 0.00 : 5a8f27: e8 f4 04 ec ff callq 469420 0.00 : 5a8f2c: 49 8b 44 24 28 mov 0x28(%r12),%rax : : /* Copy the first tuple into the table context */ : MemoryContextSwitchTo(hashtable->tablecxt); : entry->firstTuple = ExecCopySlotMinimalTuple(slot); 0.00 : 5a8f31: 4c 89 f7 mov %r14,%rdi 0.00 : 5a8f34: 48 89 05 25 19 61 00 mov %rax,0x611925(%rip) # bba860 0.00 : 5a8f3b: e8 c0 af 00 00 callq 5b3f00 0.00 : 5a8f40: 48 89 03 mov %rax,(%rbx) : : *isnew = true; /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:401 10.00 : 5a8f43: 41 c6 45 00 01 movb $0x1,0x0(%r13) /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 10.00 : 5a8f48: 48 8b 45 b8 mov -0x48(%rbp),%rax : } : } : : CurTupleHashTable = saveCurHT; 0.00 : 5a8f4c: 4c 89 3d 6d 09 5d 00 mov %r15,0x5d096d(%rip) # b798c0 : : MemoryContextSwitchTo(oldContext); : : return entry; : } 0.00 : 5a8f53: 4c 8b 65 e0 mov -0x20(%rbp),%r12 0.00 : 5a8f57: 4c 8b 6d e8 mov -0x18(%rbp),%r13 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:410 10.00 : 5a8f5b: 4c 8b 75 f0 mov -0x10(%rbp),%r14 0.00 : 5a8f5f: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 5a8f63: 48 89 05 f6 18 61 00 mov %rax,0x6118f6(%rip) # bba860 0.00 : 5a8f6a: 48 89 d8 mov %rbx,%rax 0.00 : 5a8f6d: 48 8b 5d d8 mov -0x28(%rbp),%rbx 0.00 : 5a8f71: c9 leaveq 0.00 : 5a8f72: c3 retq 0.00 : 5a8f73: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : if (isnew) : { : if (found) : { : /* found pre-existing entry */ : *isnew = false; 0.00 : 5a8f78: 41 c6 45 00 00 movb $0x0,0x0(%r13) 0.00 : 5a8f7d: eb c9 jmp 5a8f48 0.00 : 5a8f7f: 90 nop : * : * Zero any caller-requested space in the entry. (This zaps the : * "key data" dynahash.c copied into the new entry, but we don't : * care since we're about to overwrite it anyway.) : */ : MemSet(entry, 0, hashtable->entrysize); 0.00 : 5a8f80: 48 8d 14 13 lea (%rbx,%rdx,1),%rdx 0.00 : 5a8f84: 48 89 d8 mov %rbx,%rax 0.00 : 5a8f87: 48 39 d3 cmp %rdx,%rbx 0.00 : 5a8f8a: 73 a0 jae 5a8f2c 0.00 : 5a8f8c: 0f 1f 40 00 nopl 0x0(%rax) 0.00 : 5a8f90: 48 c7 00 00 00 00 00 movq $0x0,(%rax) 0.00 : 5a8f97: 48 83 c0 08 add $0x8,%rax 0.00 : 5a8f9b: 48 39 c2 cmp %rax,%rdx 0.00 : 5a8f9e: 77 f0 ja 5a8f90 0.00 : 5a8fa0: eb 8a jmp 5a8f2c 0.00 : 5a8fa2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5a8fa8: 48 8b 47 28 mov 0x28(%rdi),%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 : 5a8fac: 48 8b 1d ad 18 61 00 mov 0x6118ad(%rip),%rbx # bba860 : : CurrentMemoryContext = context; 0.00 : 5a8fb3: 48 89 05 a6 18 61 00 mov %rax,0x6118a6(%rip) # bba860 : : /* : * We copy the input tuple descriptor just for safety --- we assume : * all input tuples will have equivalent descriptors. : */ : tupdesc = CreateTupleDescCopy(slot->tts_tupleDescriptor); 0.00 : 5a8fba: 48 8b 7e 10 mov 0x10(%rsi),%rdi 0.00 : 5a8fbe: e8 bd be ec ff callq 474e80 0.00 : 5a8fc3: 48 89 c7 mov %rax,%rdi : hashtable->tableslot = MakeSingleTupleTableSlot(tupdesc); 0.00 : 5a8fc6: e8 85 b7 00 00 callq 5b4750 0.00 : 5a8fcb: 49 89 44 24 40 mov %rax,0x40(%r12) 0.00 : 5a8fd0: 48 89 1d 89 18 61 00 mov %rbx,0x611889(%rip) # bba860 0.00 : 5a8fd7: e9 c4 fe ff ff jmpq 5a8ea0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 40.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:100 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:87 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:95 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:111 10.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:77 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005a9440 : : TupleTableSlot *slot2, : int numCols, : AttrNumber *matchColIdx, : FmgrInfo *eqfunctions, : MemoryContext evalContext) : { 0.00 : 5a9440: 55 push %rbp 0.00 : 5a9441: 48 89 e5 mov %rsp,%rbp 0.00 : 5a9444: 41 57 push %r15 0.00 : 5a9446: 49 89 cf mov %rcx,%r15 0.00 : 5a9449: 41 56 push %r14 0.00 : 5a944b: 41 55 push %r13 0.00 : 5a944d: 41 54 push %r12 0.00 : 5a944f: 41 89 d4 mov %edx,%r12d : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; : : CurrentMemoryContext = context; 0.00 : 5a9452: 45 89 e5 mov %r12d,%r13d 0.00 : 5a9455: 53 push %rbx 0.00 : 5a9456: 4c 89 cb mov %r9,%rbx 0.00 : 5a9459: 48 83 ec 38 sub $0x38,%rsp 0.00 : 5a945d: 48 89 7d b8 mov %rdi,-0x48(%rbp) : MemoryContext oldContext; : bool result; : int i; : : /* Reset and switch into the temp context. */ : MemoryContextReset(evalContext); 0.00 : 5a9461: 4c 89 cf mov %r9,%rdi : TupleTableSlot *slot2, : int numCols, : AttrNumber *matchColIdx, : FmgrInfo *eqfunctions, : MemoryContext evalContext) : { 0.00 : 5a9464: 48 89 75 b0 mov %rsi,-0x50(%rbp) 0.00 : 5a9468: 4c 89 45 a8 mov %r8,-0x58(%rbp) : MemoryContext oldContext; : bool result; : int i; : : /* Reset and switch into the temp context. */ : MemoryContextReset(evalContext); 0.00 : 5a946c: e8 3f f5 1e 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 : 5a9471: 48 8b 05 e8 13 61 00 mov 0x6113e8(%rip),%rax # bba860 : : CurrentMemoryContext = context; 0.00 : 5a9478: 48 89 1d e1 13 61 00 mov %rbx,0x6113e1(%rip) # bba860 : #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 : 5a947f: 48 89 45 c0 mov %rax,-0x40(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:93 10.00 : 5a9483: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : * comparing at the last field (least significant sort key). That's the : * most likely to be different if we are dealing with sorted input. : */ : result = true; : : for (i = numCols; --i >= 0;) 0.00 : 5a9488: 41 83 ed 01 sub $0x1,%r13d 0.00 : 5a948c: 78 72 js 5a9500 : { : AttrNumber att = matchColIdx[i]; 0.00 : 5a948e: 4d 63 e5 movslq %r13d,%r12 : Datum attr1, : attr2; : bool isNull1, : isNull2; : : attr1 = slot_getattr(slot1, att, &isNull1); 0.00 : 5a9491: 48 8b 7d b8 mov -0x48(%rbp),%rdi 0.00 : 5a9495: 48 8d 55 d7 lea -0x29(%rbp),%rdx 0.00 : 5a9499: 43 0f bf 1c 67 movswl (%r15,%r12,2),%ebx 0.00 : 5a949e: 89 de mov %ebx,%esi 0.00 : 5a94a0: e8 5b 5f ec ff callq 46f400 : : attr2 = slot_getattr(slot2, att, &isNull2); 0.00 : 5a94a5: 48 8b 7d b0 mov -0x50(%rbp),%rdi 0.00 : 5a94a9: 48 8d 55 d6 lea -0x2a(%rbp),%rdx 0.00 : 5a94ad: 89 de mov %ebx,%esi : Datum attr1, : attr2; : bool isNull1, : isNull2; : : attr1 = slot_getattr(slot1, att, &isNull1); 0.00 : 5a94af: 49 89 c6 mov %rax,%r14 : : attr2 = slot_getattr(slot2, att, &isNull2); /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:87 10.00 : 5a94b2: e8 49 5f ec ff callq 46f400 : : if (isNull1 != isNull2) 0.00 : 5a94b7: 0f b6 55 d7 movzbl -0x29(%rbp),%edx 0.00 : 5a94bb: 3a 55 d6 cmp -0x2a(%rbp),%dl 0.00 : 5a94be: 75 21 jne 5a94e1 : { : result = false; /* one null and one not; they aren't equal */ : break; : } : : if (isNull1) /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:95 10.00 : 5a94c0: 84 d2 test %dl,%dl 0.00 : 5a94c2: 75 c4 jne 5a9488 : continue; /* both are null, treat as equal */ : : /* Apply the type-specific equality function */ : : if (!DatumGetBool(FunctionCall2(&eqfunctions[i], 0.00 : 5a94c4: 4b 8d 3c 64 lea (%r12,%r12,2),%rdi 0.00 : 5a94c8: 31 f6 xor %esi,%esi 0.00 : 5a94ca: 48 89 c1 mov %rax,%rcx 0.00 : 5a94cd: 4c 89 f2 mov %r14,%rdx 0.00 : 5a94d0: 48 c1 e7 04 shl $0x4,%rdi 0.00 : 5a94d4: 48 03 7d a8 add -0x58(%rbp),%rdi 0.00 : 5a94d8: e8 53 4b 1d 00 callq 77e030 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:100 40.00 : 5a94dd: 84 c0 test %al,%al 0.00 : 5a94df: 75 a7 jne 5a9488 : * comparing at the last field (least significant sort key). That's the : * most likely to be different if we are dealing with sorted input. : */ : result = true; : : for (i = numCols; --i >= 0;) 0.00 : 5a94e1: 31 c0 xor %eax,%eax : : CurrentMemoryContext = context; /home/Computational/mark/src/postgres-andres/src/backend/executor/../../../src/include/utils/palloc.h:95 10.00 : 5a94e3: 48 8b 55 c0 mov -0x40(%rbp),%rdx 0.00 : 5a94e7: 48 89 15 72 13 61 00 mov %rdx,0x611372(%rip) # bba860 : } : : MemoryContextSwitchTo(oldContext); : : return result; : } 0.00 : 5a94ee: 48 83 c4 38 add $0x38,%rsp /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:111 10.00 : 5a94f2: 5b pop %rbx 0.00 : 5a94f3: 41 5c pop %r12 0.00 : 5a94f5: 41 5d pop %r13 0.00 : 5a94f7: 41 5e pop %r14 0.00 : 5a94f9: 41 5f pop %r15 0.00 : 5a94fb: c9 leaveq 0.00 : 5a94fc: c3 retq 0.00 : 5a94fd: 0f 1f 00 nopl (%rax) : * comparing at the last field (least significant sort key). That's the : * most likely to be different if we are dealing with sorted input. : */ : result = true; : : for (i = numCols; --i >= 0;) /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:77 10.00 : 5a9500: b8 01 00 00 00 mov $0x1,%eax 0.00 : 5a9505: eb dc jmp 5a94e3 Sorted summary for file ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 44.44 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:49 22.22 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:48 22.22 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:48 11.11 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:47 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) : { /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:47 11.11 : 4906f0: 55 push %rbp : return hash_uint32(PG_GETARG_INT32(0)); /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:48 22.22 : 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)); : } /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:49 44.44 : 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 22.22 : 4906f9: e9 62 ff ff ff jmpq 490660 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 44.44 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:541 22.22 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:573 11.11 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:558 11.11 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:564 11.11 /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:573 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005a9510 : : * Also, the caller must select an appropriate memory context for running : * the compare functions. (dynahash.c doesn't change CurrentMemoryContext.) : */ : static int : TupleHashTableMatch(const void *key1, const void *key2, Size keysize) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:541 44.44 : 5a9510: 55 push %rbp : * LookupTupleHashEntry's dummy TupleHashEntryData. The other direction : * could be supported too, but is not currently used by dynahash.c. : */ : Assert(tuple1 != NULL); : slot1 = hashtable->tableslot; : ExecStoreMinimalTuple(tuple1, slot1, false); 0.00 : 5a9511: 31 d2 xor %edx,%edx : * Also, the caller must select an appropriate memory context for running : * the compare functions. (dynahash.c doesn't change CurrentMemoryContext.) : */ : static int : TupleHashTableMatch(const void *key1, const void *key2, Size keysize) : { 0.00 : 5a9513: 48 89 e5 mov %rsp,%rbp 0.00 : 5a9516: 41 54 push %r12 0.00 : 5a9518: 53 push %rbx : #ifdef USE_ASSERT_CHECKING : MinimalTuple tuple2 = ((const TupleHashEntryData *) key2)->firstTuple; : #endif : TupleTableSlot *slot1; : TupleTableSlot *slot2; : TupleHashTable hashtable = CurTupleHashTable; 0.00 : 5a9519: 48 8b 1d a0 03 5d 00 mov 0x5d03a0(%rip),%rbx # b798c0 : * LookupTupleHashEntry's dummy TupleHashEntryData. The other direction : * could be supported too, but is not currently used by dynahash.c. : */ : Assert(tuple1 != NULL); : slot1 = hashtable->tableslot; : ExecStoreMinimalTuple(tuple1, slot1, false); 0.00 : 5a9520: 48 8b 3f mov (%rdi),%rdi : * argument being an actual table entry, and the second argument being : * LookupTupleHashEntry's dummy TupleHashEntryData. The other direction : * could be supported too, but is not currently used by dynahash.c. : */ : Assert(tuple1 != NULL); : slot1 = hashtable->tableslot; /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:558 11.11 : 5a9523: 4c 8b 63 40 mov 0x40(%rbx),%r12 : ExecStoreMinimalTuple(tuple1, slot1, false); 0.00 : 5a9527: 4c 89 e6 mov %r12,%rsi 0.00 : 5a952a: e8 b1 ae 00 00 callq 5b43e0 : Assert(tuple2 == NULL); : slot2 = hashtable->inputslot; : : /* For crosstype comparisons, the inputslot must be first */ : if (execTuplesMatch(slot2, 0.00 : 5a952f: 48 8b 4b 10 mov 0x10(%rbx),%rcx 0.00 : 5a9533: 8b 53 08 mov 0x8(%rbx),%edx 0.00 : 5a9536: 4c 89 e6 mov %r12,%rsi /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:564 11.11 : 5a9539: 48 8b 7b 48 mov 0x48(%rbx),%rdi 0.00 : 5a953d: 4c 8b 4b 30 mov 0x30(%rbx),%r9 0.00 : 5a9541: 4c 8b 43 58 mov 0x58(%rbx),%r8 0.00 : 5a9545: e8 f6 fe ff ff callq 5a9440 0.00 : 5a954a: 84 c0 test %al,%al : hashtable->cur_eq_funcs, : hashtable->tempcxt)) : return 0; : else : return 1; : } 0.00 : 5a954c: 5b pop %rbx : ExecStoreMinimalTuple(tuple1, slot1, false); : Assert(tuple2 == NULL); : slot2 = hashtable->inputslot; : : /* For crosstype comparisons, the inputslot must be first */ : if (execTuplesMatch(slot2, 0.00 : 5a954d: 0f 94 c0 sete %al 0.00 : 5a9550: 0f b6 c0 movzbl %al,%eax : hashtable->cur_eq_funcs, : hashtable->tempcxt)) : return 0; : else : return 1; : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execGrouping.c:573 22.22 : 5a9553: 41 5c pop %r12 11.11 : 5a9555: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 55.56 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1165 33.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1163 11.11 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1148 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bbcb0 : : * econtext->ecxt_innertuple, using hjstate->hj_HashTupleSlot as the slot : * for the latter. : */ : bool : ExecScanHashTableForUnmatched(HashJoinState *hjstate, ExprContext *econtext) : { 0.00 : 5bbcb0: 55 push %rbp 0.00 : 5bbcb1: 48 89 e5 mov %rsp,%rbp 0.00 : 5bbcb4: 41 55 push %r13 0.00 : 5bbcb6: 49 89 f5 mov %rsi,%r13 0.00 : 5bbcb9: 41 54 push %r12 0.00 : 5bbcbb: 49 89 fc mov %rdi,%r12 0.00 : 5bbcbe: 53 push %rbx 0.00 : 5bbcbf: 48 83 ec 08 sub $0x8,%rsp : HashJoinTable hashtable = hjstate->hj_HashTable; : HashJoinTuple hashTuple = hjstate->hj_CurTuple; 0.00 : 5bbcc3: 48 8b 9f c0 00 00 00 mov 0xc0(%rdi),%rbx : * for the latter. : */ : bool : ExecScanHashTableForUnmatched(HashJoinState *hjstate, ExprContext *econtext) : { : HashJoinTable hashtable = hjstate->hj_HashTable; 0.00 : 5bbcca: 48 8b b7 a8 00 00 00 mov 0xa8(%rdi),%rsi : /* : * hj_CurTuple is the address of the tuple last returned from the : * current bucket, or NULL if it's time to start scanning a new : * bucket. : */ : if (hashTuple != NULL) 0.00 : 5bbcd1: 48 85 db test %rbx,%rbx 0.00 : 5bbcd4: 74 08 je 5bbcde : hashTuple = hashTuple->next; 0.00 : 5bbcd6: 48 8b 1b mov (%rbx),%rbx : hjstate->hj_CurSkewBucketNo++; : } : else : break; /* finished all buckets */ : : while (hashTuple != NULL) 0.00 : 5bbcd9: 48 85 db test %rbx,%rbx 0.00 : 5bbcdc: 75 32 jne 5bbd10 : * current bucket, or NULL if it's time to start scanning a new : * bucket. : */ : if (hashTuple != NULL) : hashTuple = hashTuple->next; : else if (hjstate->hj_CurBucketNo < hashtable->nbuckets) 0.00 : 5bbcde: 41 8b 8c 24 b4 00 00 mov 0xb4(%r12),%ecx 0.00 : 5bbce5: 00 0.00 : 5bbce6: 3b 0e cmp (%rsi),%ecx 0.00 : 5bbce8: 7d 45 jge 5bbd2f /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1148 11.11 : 5bbcea: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : { : hashTuple = hashtable->buckets[hjstate->hj_CurBucketNo]; 0.00 : 5bbcf0: 48 8b 56 18 mov 0x18(%rsi),%rdx 0.00 : 5bbcf4: 48 63 c1 movslq %ecx,%rax 0.00 : 5bbcf7: 48 8b 1c c2 mov (%rdx,%rax,8),%rbx : hjstate->hj_CurBucketNo++; 0.00 : 5bbcfb: 8d 41 01 lea 0x1(%rcx),%eax 0.00 : 5bbcfe: 41 89 84 24 b4 00 00 mov %eax,0xb4(%r12) 0.00 : 5bbd05: 00 : hjstate->hj_CurSkewBucketNo++; : } : else : break; /* finished all buckets */ : : while (hashTuple != NULL) 0.00 : 5bbd06: 48 85 db test %rbx,%rbx 0.00 : 5bbd09: 74 d3 je 5bbcde 0.00 : 5bbd0b: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : { : if (!HeapTupleHeaderHasMatch(HJTUPLE_MINTUPLE(hashTuple))) 0.00 : 5bbd10: 48 8d 7b 10 lea 0x10(%rbx),%rdi 0.00 : 5bbd14: 66 83 7f 0a 00 cmpw $0x0,0xa(%rdi) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1165 55.56 : 5bbd19: 79 4a jns 5bbd65 : : hjstate->hj_CurTuple = hashTuple; : return true; : } : : hashTuple = hashTuple->next; 0.00 : 5bbd1b: 48 8b 1b mov (%rbx),%rbx : hjstate->hj_CurSkewBucketNo++; : } : else : break; /* finished all buckets */ : : while (hashTuple != NULL) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1163 33.33 : 5bbd1e: 48 85 db test %rbx,%rbx 0.00 : 5bbd21: 75 ed jne 5bbd10 : * current bucket, or NULL if it's time to start scanning a new : * bucket. : */ : if (hashTuple != NULL) : hashTuple = hashTuple->next; : else if (hjstate->hj_CurBucketNo < hashtable->nbuckets) 0.00 : 5bbd23: 41 8b 8c 24 b4 00 00 mov 0xb4(%r12),%ecx 0.00 : 5bbd2a: 00 0.00 : 5bbd2b: 3b 0e cmp (%rsi),%ecx 0.00 : 5bbd2d: 7c c1 jl 5bbcf0 : { : hashTuple = hashtable->buckets[hjstate->hj_CurBucketNo]; : hjstate->hj_CurBucketNo++; : } : else if (hjstate->hj_CurSkewBucketNo < hashtable->nSkewBuckets) 0.00 : 5bbd2f: 41 8b 8c 24 b8 00 00 mov 0xb8(%r12),%ecx 0.00 : 5bbd36: 00 : hjstate->hj_CurSkewBucketNo++; : } : else : break; /* finished all buckets */ : : while (hashTuple != NULL) 0.00 : 5bbd37: 31 c0 xor %eax,%eax : else if (hjstate->hj_CurBucketNo < hashtable->nbuckets) : { : hashTuple = hashtable->buckets[hjstate->hj_CurBucketNo]; : hjstate->hj_CurBucketNo++; : } : else if (hjstate->hj_CurSkewBucketNo < hashtable->nSkewBuckets) 0.00 : 5bbd39: 3b 4e 34 cmp 0x34(%rsi),%ecx 0.00 : 5bbd3c: 7d 50 jge 5bbd8e : { : int j = hashtable->skewBucketNums[hjstate->hj_CurSkewBucketNo]; : : hashTuple = hashtable->skewBucket[j]->tuples; 0.00 : 5bbd3e: 48 8b 46 38 mov 0x38(%rsi),%rax 0.00 : 5bbd42: 48 63 d1 movslq %ecx,%rdx 0.00 : 5bbd45: 48 63 14 90 movslq (%rax,%rdx,4),%rdx 0.00 : 5bbd49: 48 8b 46 28 mov 0x28(%rsi),%rax 0.00 : 5bbd4d: 48 8b 04 d0 mov (%rax,%rdx,8),%rax 0.00 : 5bbd51: 48 8b 58 08 mov 0x8(%rax),%rbx : hjstate->hj_CurSkewBucketNo++; 0.00 : 5bbd55: 8d 41 01 lea 0x1(%rcx),%eax 0.00 : 5bbd58: 41 89 84 24 b8 00 00 mov %eax,0xb8(%r12) 0.00 : 5bbd5f: 00 0.00 : 5bbd60: e9 74 ff ff ff jmpq 5bbcd9 : if (!HeapTupleHeaderHasMatch(HJTUPLE_MINTUPLE(hashTuple))) : { : TupleTableSlot *inntuple; : : /* insert hashtable's tuple into exec slot */ : inntuple = ExecStoreMinimalTuple(HJTUPLE_MINTUPLE(hashTuple), 0.00 : 5bbd65: 49 8b b4 24 d0 00 00 mov 0xd0(%r12),%rsi 0.00 : 5bbd6c: 00 0.00 : 5bbd6d: 31 d2 xor %edx,%edx 0.00 : 5bbd6f: e8 6c 86 ff ff callq 5b43e0 : /* : * Reset temp memory each time; although this function doesn't : * do any qual eval, the caller will, so let's keep it : * parallel to ExecScanHashBucket. : */ : ResetExprContext(econtext); 0.00 : 5bbd74: 49 8b 7d 28 mov 0x28(%r13),%rdi : : /* insert hashtable's tuple into exec slot */ : inntuple = ExecStoreMinimalTuple(HJTUPLE_MINTUPLE(hashTuple), : hjstate->hj_HashTupleSlot, : false); /* do not pfree */ : econtext->ecxt_innertuple = inntuple; 0.00 : 5bbd78: 49 89 45 10 mov %rax,0x10(%r13) : /* : * Reset temp memory each time; although this function doesn't : * do any qual eval, the caller will, so let's keep it : * parallel to ExecScanHashBucket. : */ : ResetExprContext(econtext); 0.00 : 5bbd7c: e8 2f cc 1d 00 callq 7989b0 : : hjstate->hj_CurTuple = hashTuple; 0.00 : 5bbd81: 49 89 9c 24 c0 00 00 mov %rbx,0xc0(%r12) 0.00 : 5bbd88: 00 0.00 : 5bbd89: b8 01 00 00 00 mov $0x1,%eax : : /* : * no more unmatched tuples : */ : return false; : } 0.00 : 5bbd8e: 48 83 c4 08 add $0x8,%rsp 0.00 : 5bbd92: 5b pop %rbx 0.00 : 5bbd93: 41 5c pop %r12 0.00 : 5bbd95: 41 5d pop %r13 0.00 : 5bbd97: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1576 22.22 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1616 11.11 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1576 11.11 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1577 11.11 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1616 11.11 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1616 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006425d0 : : * calls for what the user considers a single call of the function. The : * finalize flag should be TRUE on the last call. : */ : void : pgstat_end_function_usage(PgStat_FunctionCallUsage *fcu, bool finalize) : { 0.00 : 6425d0: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1576 33.33 : 6425d1: 48 89 e5 mov %rsp,%rbp 0.00 : 6425d4: 41 55 push %r13 0.00 : 6425d6: 41 89 f5 mov %esi,%r13d 0.00 : 6425d9: 41 54 push %r12 0.00 : 6425db: 49 89 fc mov %rdi,%r12 0.00 : 6425de: 53 push %rbx 11.11 : 6425df: 48 83 ec 18 sub $0x18,%rsp : PgStat_FunctionCounts *fs = fcu->fs; /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1577 11.11 : 6425e3: 48 8b 1f mov (%rdi),%rbx : instr_time f_total; : instr_time f_others; : instr_time f_self; : : /* stats not wanted? */ : if (fs == NULL) 0.00 : 6425e6: 48 85 db test %rbx,%rbx 0.00 : 6425e9: 0f 84 6f 01 00 00 je 64275e : return; : : /* total elapsed time in this function call */ : INSTR_TIME_SET_CURRENT(f_total); 0.00 : 6425ef: 48 8d 7d d0 lea -0x30(%rbp),%rdi 0.00 : 6425f3: 31 f6 xor %esi,%esi 0.00 : 6425f5: e8 c6 6f e2 ff callq 4695c0 : INSTR_TIME_SUBTRACT(f_total, fcu->f_start); 0.00 : 6425fa: 48 8b 4d d8 mov -0x28(%rbp),%rcx 0.00 : 6425fe: 49 2b 4c 24 30 sub 0x30(%r12),%rcx 0.00 : 642603: 48 8b 45 d0 mov -0x30(%rbp),%rax 0.00 : 642607: 49 2b 44 24 28 sub 0x28(%r12),%rax 0.00 : 64260c: 48 85 c9 test %rcx,%rcx 0.00 : 64260f: 48 89 4d d8 mov %rcx,-0x28(%rbp) 0.00 : 642613: 49 89 c1 mov %rax,%r9 0.00 : 642616: 48 89 45 d0 mov %rax,-0x30(%rbp) 0.00 : 64261a: 79 1c jns 642638 0.00 : 64261c: 0f 1f 40 00 nopl 0x0(%rax) : * calls for what the user considers a single call of the function. The : * finalize flag should be TRUE on the last call. : */ : void : pgstat_end_function_usage(PgStat_FunctionCallUsage *fcu, bool finalize) : { 0.00 : 642620: 48 83 e8 01 sub $0x1,%rax : if (fs == NULL) : return; : : /* total elapsed time in this function call */ : INSTR_TIME_SET_CURRENT(f_total); : INSTR_TIME_SUBTRACT(f_total, fcu->f_start); 0.00 : 642624: 48 81 c1 40 42 0f 00 add $0xf4240,%rcx 0.00 : 64262b: 78 f3 js 642620 0.00 : 64262d: 48 89 45 d0 mov %rax,-0x30(%rbp) 0.00 : 642631: 48 89 4d d8 mov %rcx,-0x28(%rbp) 0.00 : 642635: 49 89 c1 mov %rax,%r9 : : /* self usage: elapsed minus anything already charged to other calls */ : f_others = total_func_time; 0.00 : 642638: 4c 8b 05 e9 98 53 00 mov 0x5398e9(%rip),%r8 # b7bf28 0.00 : 64263f: 4c 8b 15 da 98 53 00 mov 0x5398da(%rip),%r10 # b7bf20 : INSTR_TIME_SUBTRACT(f_others, fcu->save_total); 0.00 : 642646: 4c 89 c0 mov %r8,%rax 0.00 : 642649: 4c 89 d2 mov %r10,%rdx 0.00 : 64264c: 49 2b 54 24 18 sub 0x18(%r12),%rdx 0.00 : 642651: 49 2b 44 24 20 sub 0x20(%r12),%rax 0.00 : 642656: 79 14 jns 64266c 0.00 : 642658: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 64265f: 00 0.00 : 642660: 48 83 ea 01 sub $0x1,%rdx 0.00 : 642664: 48 05 40 42 0f 00 add $0xf4240,%rax 0.00 : 64266a: 78 f4 js 642660 : f_self = f_total; : INSTR_TIME_SUBTRACT(f_self, f_others); 0.00 : 64266c: 4c 89 cf mov %r9,%rdi 0.00 : 64266f: 48 89 ce mov %rcx,%rsi 0.00 : 642672: 48 29 d7 sub %rdx,%rdi 0.00 : 642675: 48 29 c6 sub %rax,%rsi 0.00 : 642678: 79 13 jns 64268d 0.00 : 64267a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 642680: 48 83 ef 01 sub $0x1,%rdi 0.00 : 642684: 48 81 c6 40 42 0f 00 add $0xf4240,%rsi 0.00 : 64268b: 78 f3 js 642680 : : /* update backend-wide total time */ : INSTR_TIME_ADD(total_func_time, f_self); 0.00 : 64268d: 4a 8d 04 06 lea (%rsi,%r8,1),%rax 0.00 : 642691: 4a 8d 14 17 lea (%rdi,%r10,1),%rdx 0.00 : 642695: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 64269b: 48 89 15 7e 98 53 00 mov %rdx,0x53987e(%rip) # b7bf20 0.00 : 6426a2: 48 89 05 7f 98 53 00 mov %rax,0x53987f(%rip) # b7bf28 0.00 : 6426a9: 7e 25 jle 6426d0 0.00 : 6426ab: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 6426b0: 48 2d 40 42 0f 00 sub $0xf4240,%rax : * calls for what the user considers a single call of the function. The : * finalize flag should be TRUE on the last call. : */ : void : pgstat_end_function_usage(PgStat_FunctionCallUsage *fcu, bool finalize) : { 0.00 : 6426b6: 48 83 c2 01 add $0x1,%rdx : INSTR_TIME_SUBTRACT(f_others, fcu->save_total); : f_self = f_total; : INSTR_TIME_SUBTRACT(f_self, f_others); : : /* update backend-wide total time */ : INSTR_TIME_ADD(total_func_time, f_self); 0.00 : 6426ba: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 6426c0: 7f ee jg 6426b0 0.00 : 6426c2: 48 89 15 57 98 53 00 mov %rdx,0x539857(%rip) # b7bf20 0.00 : 6426c9: 48 89 05 58 98 53 00 mov %rax,0x539858(%rip) # b7bf28 : * pre-call value of f_total_time. This is necessary to avoid : * double-counting any time taken by recursive calls of myself. (We do : * not need any similar kluge for self time, since that already excludes : * any recursive calls.) : */ : INSTR_TIME_ADD(f_total, fcu->save_f_total_time); 0.00 : 6426d0: 48 89 c8 mov %rcx,%rax 0.00 : 6426d3: 49 03 44 24 10 add 0x10(%r12),%rax 0.00 : 6426d8: 4c 89 ca mov %r9,%rdx 0.00 : 6426db: 49 03 54 24 08 add 0x8(%r12),%rdx 0.00 : 6426e0: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 6426e6: 48 89 45 d8 mov %rax,-0x28(%rbp) 0.00 : 6426ea: 48 89 55 d0 mov %rdx,-0x30(%rbp) 0.00 : 6426ee: 7e 1a jle 64270a 0.00 : 6426f0: 48 2d 40 42 0f 00 sub $0xf4240,%rax : * calls for what the user considers a single call of the function. The : * finalize flag should be TRUE on the last call. : */ : void : pgstat_end_function_usage(PgStat_FunctionCallUsage *fcu, bool finalize) : { 0.00 : 6426f6: 48 83 c2 01 add $0x1,%rdx : * pre-call value of f_total_time. This is necessary to avoid : * double-counting any time taken by recursive calls of myself. (We do : * not need any similar kluge for self time, since that already excludes : * any recursive calls.) : */ : INSTR_TIME_ADD(f_total, fcu->save_f_total_time); 0.00 : 6426fa: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 642700: 7f ee jg 6426f0 0.00 : 642702: 48 89 55 d0 mov %rdx,-0x30(%rbp) 0.00 : 642706: 48 89 45 d8 mov %rax,-0x28(%rbp) : : /* update counters in function stats table */ : if (finalize) 0.00 : 64270a: 45 84 ed test %r13b,%r13b 0.00 : 64270d: 75 61 jne 642770 : fs->f_numcalls++; : fs->f_total_time = f_total; 0.00 : 64270f: 48 8b 45 d0 mov -0x30(%rbp),%rax 0.00 : 642713: 48 89 43 08 mov %rax,0x8(%rbx) 0.00 : 642717: 48 8b 45 d8 mov -0x28(%rbp),%rax : INSTR_TIME_ADD(fs->f_self_time, f_self); 0.00 : 64271b: 48 01 7b 18 add %rdi,0x18(%rbx) : INSTR_TIME_ADD(f_total, fcu->save_f_total_time); : : /* update counters in function stats table */ : if (finalize) : fs->f_numcalls++; : fs->f_total_time = f_total; 0.00 : 64271f: 48 89 43 10 mov %rax,0x10(%rbx) : INSTR_TIME_ADD(fs->f_self_time, f_self); 0.00 : 642723: 48 89 f0 mov %rsi,%rax 0.00 : 642726: 48 03 43 20 add 0x20(%rbx),%rax 0.00 : 64272a: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 642730: 48 89 43 20 mov %rax,0x20(%rbx) 0.00 : 642734: 7e 21 jle 642757 0.00 : 642736: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 64273d: 00 00 00 0.00 : 642740: 48 2d 40 42 0f 00 sub $0xf4240,%rax 0.00 : 642746: 48 83 43 18 01 addq $0x1,0x18(%rbx) 0.00 : 64274b: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 642751: 48 89 43 20 mov %rax,0x20(%rbx) 0.00 : 642755: 7f e9 jg 642740 : : /* indicate that we have something to send */ : have_function_stats = true; 0.00 : 642757: c6 05 4a 95 53 00 01 movb $0x1,0x53954a(%rip) # b7bca8 : } 0.00 : 64275e: 48 83 c4 18 add $0x18,%rsp /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1616 22.22 : 642762: 5b pop %rbx 11.11 : 642763: 41 5c pop %r12 0.00 : 642765: 41 5d pop %r13 0.00 : 642767: c9 leaveq 11.11 : 642768: c3 retq 0.00 : 642769: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : */ : INSTR_TIME_ADD(f_total, fcu->save_f_total_time); : : /* update counters in function stats table */ : if (finalize) : fs->f_numcalls++; 0.00 : 642770: 48 83 03 01 addq $0x1,(%rbx) 0.00 : 642774: eb 99 jmp 64270f Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 62.50 /home/Computational/mark/src/postgres-andres/src/backend/access/heap/pruneheap.c:109 37.50 /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 37.50 : 49f6c7: 8b 7b 14 mov 0x14(%rbx),%edi 62.50 : 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 ---------------------------------------------- 37.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:347 37.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:383 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:334 12.50 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:359 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 12.50 : 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) 0.00 : 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) /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:347 37.50 : 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 12.50 : 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; : } 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:383 37.50 : 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 ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:112 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:113 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005c5910 : : * access method functions. : * ---------------------------------------------------------------- : */ : TupleTableSlot * : ExecSeqScan(SeqScanState *node) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:112 50.00 : 5c5910: 55 push %rbp : return ExecScan((ScanState *) node, /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:113 50.00 : 5c5911: ba 30 57 5c 00 mov $0x5c5730,%edx 0.00 : 5c5916: be 30 59 5c 00 mov $0x5c5930,%esi : * access method functions. : * ---------------------------------------------------------------- : */ : TupleTableSlot * : ExecSeqScan(SeqScanState *node) : { 0.00 : 5c591b: 48 89 e5 mov %rsp,%rbp : return ExecScan((ScanState *) node, : (ExecScanAccessMtd) SeqNext, : (ExecScanRecheckMtd) SeqRecheck); : } 0.00 : 5c591e: c9 leaveq : * ---------------------------------------------------------------- : */ : TupleTableSlot * : ExecSeqScan(SeqScanState *node) : { : return ExecScan((ScanState *) node, 0.00 : 5c591f: e9 2c de fe ff jmpq 5b3750 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 37.50 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1305 12.50 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1289 12.50 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1293 12.50 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1293 12.50 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1298 12.50 /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 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1289 12.50 : 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); 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1293 12.50 : 77e102: 89 b5 68 fc ff ff mov %esi,-0x398(%rbp) 0.00 : 77e108: c6 85 6c fc ff ff 00 movb $0x0,-0x394(%rbp) 12.50 : 77e10f: 66 c7 85 6e fc ff ff movw $0x1,-0x392(%rbp) 0.00 : 77e116: 01 00 : : fcinfo.arg[0] = arg1; 0.00 : 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); /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1298 12.50 : 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 37.50 : 77e12e: c9 leaveq 12.50 : 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 ---------------------------------------------- 57.14 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:508 28.57 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:511 14.29 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:499 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 14.29 : 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 57.14 : 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:511 28.57 : 5b3a34: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 28.57 /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3066 28.57 /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3066 14.29 /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3066 14.29 /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3073 14.29 /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3089 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) : { /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3066 28.57 : 69b9e0: 55 push %rbp 0.00 : 69b9e1: 48 89 e5 mov %rsp,%rbp 28.57 : 69b9e4: 48 89 5d f0 mov %rbx,-0x10(%rbp) 14.29 : 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 /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3073 14.29 : 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 /home/Computational/mark/src/postgres-andres/src/backend/tcop/postgres.c:3089 14.29 : 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 0.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 ---------------------------------------------- 28.57 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:811 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:810 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:810 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:811 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:816 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:816 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000007846a0 : : void * : hash_search(HTAB *hashp, : const void *keyPtr, : HASHACTION action, : bool *foundPtr) : { 0.00 : 7846a0: 55 push %rbp 0.00 : 7846a1: 48 89 e5 mov %rsp,%rbp /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:810 14.29 : 7846a4: 48 89 5d e0 mov %rbx,-0x20(%rbp) 0.00 : 7846a8: 4c 89 65 e8 mov %r12,-0x18(%rbp) 0.00 : 7846ac: 48 89 fb mov %rdi,%rbx 0.00 : 7846af: 4c 89 6d f0 mov %r13,-0x10(%rbp) 0.00 : 7846b3: 4c 89 75 f8 mov %r14,-0x8(%rbp) 0.00 : 7846b7: 49 89 f5 mov %rsi,%r13 0.00 : 7846ba: 48 83 ec 20 sub $0x20,%rsp 14.29 : 7846be: 41 89 d6 mov %edx,%r14d 0.00 : 7846c1: 49 89 cc mov %rcx,%r12 : return hash_search_with_hash_value(hashp, 0.00 : 7846c4: 48 8b 77 48 mov 0x48(%rdi),%rsi /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:811 28.57 : 7846c8: 4c 89 ef mov %r13,%rdi 0.00 : 7846cb: ff 53 10 callq *0x10(%rbx) 14.29 : 7846ce: 4d 89 e0 mov %r12,%r8 0.00 : 7846d1: 44 89 f1 mov %r14d,%ecx 0.00 : 7846d4: 4c 89 ee mov %r13,%rsi 0.00 : 7846d7: 48 89 df mov %rbx,%rdi : keyPtr, : hashp->hash(keyPtr, hashp->keysize), : action, : foundPtr); : } /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/dynahash.c:816 14.29 : 7846da: 4c 8b 64 24 08 mov 0x8(%rsp),%r12 0.00 : 7846df: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 7846e3: 4c 8b 6c 24 10 mov 0x10(%rsp),%r13 14.29 : 7846e8: 4c 8b 74 24 18 mov 0x18(%rsp),%r14 : hash_search(HTAB *hashp, : const void *keyPtr, : HASHACTION action, : bool *foundPtr) : { : return hash_search_with_hash_value(hashp, 0.00 : 7846ed: 89 c2 mov %eax,%edx : keyPtr, : hashp->hash(keyPtr, hashp->keysize), : action, : foundPtr); : } 0.00 : 7846ef: c9 leaveq : hash_search(HTAB *hashp, : const void *keyPtr, : HASHACTION action, : bool *foundPtr) : { : return hash_search_with_hash_value(hashp, 0.00 : 7846f0: e9 5b f9 ff ff jmpq 784050 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 85.71 /home/Computational/mark/src/postgres-andres/src/backend/utils/mb/wchar.c:1830 14.29 /home/Computational/mark/src/postgres-andres/src/backend/utils/mb/wchar.c:1829 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000078b890 : : /* : * fetch maximum length of the encoding for the current database : */ : int : pg_database_encoding_max_length(void) : { 0.00 : 78b890: 55 push %rbp 0.00 : 78b891: 48 89 e5 mov %rsp,%rbp : return pg_wchar_table[GetDatabaseEncoding()].maxmblen; 0.00 : 78b894: e8 47 d0 ff ff callq 7888e0 /home/Computational/mark/src/postgres-andres/src/backend/utils/mb/wchar.c:1829 14.29 : 78b899: 48 98 cltq 0.00 : 78b89b: 48 8d 04 40 lea (%rax,%rax,2),%rax 0.00 : 78b89f: 48 c1 e0 04 shl $0x4,%rax 0.00 : 78b8a3: 8b 80 88 7d 8d 00 mov 0x8d7d88(%rax),%eax : } /home/Computational/mark/src/postgres-andres/src/backend/utils/mb/wchar.c:1830 85.71 : 78b8a9: 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 ---------------------------------------------- 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:148 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:137 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:160 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:162 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:177 16.67 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:251 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 16.67 : 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 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:137 16.67 : 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; 0.00 : 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); /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:160 16.67 : 46ff9e: 66 41 83 21 f8 andw $0xfff8,(%r9) : : for (i = 0; i < numberOfAttributes; i++) 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:162 16.67 : 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) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:177 16.67 : 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) 0.00 : 470001: 74 7d je 470080 : { : /* pass-by-value */ : data = (char *) att_align_nominal(data, att[i]->attalign); 0.00 : 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; /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:251 16.67 : 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 0.00 : 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); 0.00 : 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; 0.00 : 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 0.00 : 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 ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1546 16.67 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1504 16.67 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1504 16.67 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1508 16.67 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1546 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000642780 : : * Called by the executor before invoking a function. : */ : void : pgstat_init_function_usage(FunctionCallInfoData *fcinfo, : PgStat_FunctionCallUsage *fcu) : { 0.00 : 642780: 55 push %rbp 0.00 : 642781: 48 89 e5 mov %rsp,%rbp /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1504 16.67 : 642784: 41 54 push %r12 0.00 : 642786: 49 89 fc mov %rdi,%r12 16.67 : 642789: 53 push %rbx 0.00 : 64278a: 48 89 f3 mov %rsi,%rbx 0.00 : 64278d: 48 83 ec 70 sub $0x70,%rsp : PgStat_BackendFunctionEntry *htabent; : bool found; : : if (pgstat_track_functions <= fcinfo->flinfo->fn_stats) 0.00 : 642791: 48 8b 17 mov (%rdi),%rdx /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1508 16.67 : 642794: 0f b6 42 10 movzbl 0x10(%rdx),%eax 0.00 : 642798: 3b 05 06 94 53 00 cmp 0x539406(%rip),%eax # b7bba4 0.00 : 64279e: 0f 8d ac 00 00 00 jge 642850 : /* stats not wanted */ : fcu->fs = NULL; : return; : } : : if (!pgStatFunctions) 0.00 : 6427a4: 48 83 3d 04 95 53 00 cmpq $0x0,0x539504(%rip) # b7bcb0 0.00 : 6427ab: 00 0.00 : 6427ac: 0f 84 de 00 00 00 je 642890 : &hash_ctl, : HASH_ELEM | HASH_FUNCTION); : } : : /* Get the stats entry for this function, create if necessary */ : htabent = hash_search(pgStatFunctions, &fcinfo->flinfo->fn_oid, 0.00 : 6427b2: 48 8b 3d f7 94 53 00 mov 0x5394f7(%rip),%rdi # b7bcb0 0.00 : 6427b9: 48 8d 72 08 lea 0x8(%rdx),%rsi 0.00 : 6427bd: 48 8d 4d ef lea -0x11(%rbp),%rcx 0.00 : 6427c1: ba 01 00 00 00 mov $0x1,%edx 0.00 : 6427c6: e8 d5 1e 14 00 callq 7846a0 : HASH_ENTER, &found); : if (!found) 0.00 : 6427cb: 80 7d ef 00 cmpb $0x0,-0x11(%rbp) : &hash_ctl, : HASH_ELEM | HASH_FUNCTION); : } : : /* Get the stats entry for this function, create if necessary */ : htabent = hash_search(pgStatFunctions, &fcinfo->flinfo->fn_oid, 0.00 : 6427cf: 48 89 c2 mov %rax,%rdx 0.00 : 6427d2: 48 8d 40 08 lea 0x8(%rax),%rax : HASH_ENTER, &found); : if (!found) 0.00 : 6427d6: 74 40 je 642818 : MemSet(&htabent->f_counts, 0, sizeof(PgStat_FunctionCounts)); : : fcu->fs = &htabent->f_counts; 0.00 : 6427d8: 48 89 03 mov %rax,(%rbx) : : /* save stats for this function, later used to compensate for recursion */ : fcu->save_f_total_time = htabent->f_counts.f_total_time; 0.00 : 6427db: 48 8b 42 10 mov 0x10(%rdx),%rax : : /* save current backend-wide total time */ : fcu->save_total = total_func_time; : : /* get clock time as of function start */ : INSTR_TIME_SET_CURRENT(fcu->f_start); 0.00 : 6427df: 48 8d 7b 28 lea 0x28(%rbx),%rdi 0.00 : 6427e3: 31 f6 xor %esi,%esi : MemSet(&htabent->f_counts, 0, sizeof(PgStat_FunctionCounts)); : : fcu->fs = &htabent->f_counts; : : /* save stats for this function, later used to compensate for recursion */ : fcu->save_f_total_time = htabent->f_counts.f_total_time; 0.00 : 6427e5: 48 89 43 08 mov %rax,0x8(%rbx) 0.00 : 6427e9: 48 8b 42 18 mov 0x18(%rdx),%rax 0.00 : 6427ed: 48 89 43 10 mov %rax,0x10(%rbx) : : /* save current backend-wide total time */ : fcu->save_total = total_func_time; 0.00 : 6427f1: 48 8b 05 28 97 53 00 mov 0x539728(%rip),%rax # b7bf20 0.00 : 6427f8: 48 89 43 18 mov %rax,0x18(%rbx) 0.00 : 6427fc: 48 8b 05 25 97 53 00 mov 0x539725(%rip),%rax # b7bf28 0.00 : 642803: 48 89 43 20 mov %rax,0x20(%rbx) : : /* get clock time as of function start */ : INSTR_TIME_SET_CURRENT(fcu->f_start); 0.00 : 642807: e8 b4 6d e2 ff callq 4695c0 : } 0.00 : 64280c: 48 83 c4 70 add $0x70,%rsp 0.00 : 642810: 5b pop %rbx 0.00 : 642811: 41 5c pop %r12 0.00 : 642813: c9 leaveq 0.00 : 642814: c3 retq 0.00 : 642815: 0f 1f 00 nopl (%rax) : : /* Get the stats entry for this function, create if necessary */ : htabent = hash_search(pgStatFunctions, &fcinfo->flinfo->fn_oid, : HASH_ENTER, &found); : if (!found) : MemSet(&htabent->f_counts, 0, sizeof(PgStat_FunctionCounts)); 0.00 : 642818: a8 07 test $0x7,%al 0.00 : 64281a: 75 44 jne 642860 0.00 : 64281c: 48 c7 42 08 00 00 00 movq $0x0,0x8(%rdx) 0.00 : 642823: 00 0.00 : 642824: 48 c7 42 10 00 00 00 movq $0x0,0x10(%rdx) 0.00 : 64282b: 00 0.00 : 64282c: 48 c7 42 18 00 00 00 movq $0x0,0x18(%rdx) 0.00 : 642833: 00 0.00 : 642834: 48 c7 42 20 00 00 00 movq $0x0,0x20(%rdx) 0.00 : 64283b: 00 0.00 : 64283c: 48 c7 42 28 00 00 00 movq $0x0,0x28(%rdx) 0.00 : 642843: 00 0.00 : 642844: eb 92 jmp 6427d8 0.00 : 642846: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 64284d: 00 00 00 : bool found; : : if (pgstat_track_functions <= fcinfo->flinfo->fn_stats) : { : /* stats not wanted */ : fcu->fs = NULL; 0.00 : 642850: 48 c7 06 00 00 00 00 movq $0x0,(%rsi) : /* save current backend-wide total time */ : fcu->save_total = total_func_time; : : /* get clock time as of function start */ : INSTR_TIME_SET_CURRENT(fcu->f_start); : } 0.00 : 642857: 48 83 c4 70 add $0x70,%rsp 0.00 : 64285b: 5b pop %rbx 0.00 : 64285c: 41 5c pop %r12 /home/Computational/mark/src/postgres-andres/src/backend/postmaster/pgstat.c:1546 16.67 : 64285e: c9 leaveq 33.33 : 64285f: c3 retq : : /* Get the stats entry for this function, create if necessary */ : htabent = hash_search(pgStatFunctions, &fcinfo->flinfo->fn_oid, : HASH_ENTER, &found); : if (!found) : MemSet(&htabent->f_counts, 0, sizeof(PgStat_FunctionCounts)); 0.00 : 642860: 48 c7 42 08 00 00 00 movq $0x0,0x8(%rdx) 0.00 : 642867: 00 0.00 : 642868: 48 c7 40 08 00 00 00 movq $0x0,0x8(%rax) 0.00 : 64286f: 00 0.00 : 642870: 48 c7 40 10 00 00 00 movq $0x0,0x10(%rax) 0.00 : 642877: 00 0.00 : 642878: 48 c7 40 18 00 00 00 movq $0x0,0x18(%rax) 0.00 : 64287f: 00 0.00 : 642880: 48 c7 40 20 00 00 00 movq $0x0,0x20(%rax) 0.00 : 642887: 00 0.00 : 642888: e9 4b ff ff ff jmpq 6427d8 0.00 : 64288d: 0f 1f 00 nopl (%rax) : if (!pgStatFunctions) : { : /* First time through - initialize function stat table */ : HASHCTL hash_ctl; : : memset(&hash_ctl, 0, sizeof(hash_ctl)); 0.00 : 642890: 48 8d 55 80 lea -0x80(%rbp),%rdx 0.00 : 642894: 31 c0 xor %eax,%eax 0.00 : 642896: b9 0d 00 00 00 mov $0xd,%ecx : hash_ctl.keysize = sizeof(Oid); : hash_ctl.entrysize = sizeof(PgStat_BackendFunctionEntry); : hash_ctl.hash = oid_hash; : pgStatFunctions = hash_create("Function stat entries", 0.00 : 64289b: be 00 02 00 00 mov $0x200,%esi : if (!pgStatFunctions) : { : /* First time through - initialize function stat table */ : HASHCTL hash_ctl; : : memset(&hash_ctl, 0, sizeof(hash_ctl)); 0.00 : 6428a0: 48 89 d7 mov %rdx,%rdi 0.00 : 6428a3: f3 48 ab rep stos %rax,%es:(%rdi) : hash_ctl.keysize = sizeof(Oid); 0.00 : 6428a6: 48 c7 45 a8 04 00 00 movq $0x4,-0x58(%rbp) 0.00 : 6428ad: 00 : hash_ctl.entrysize = sizeof(PgStat_BackendFunctionEntry); 0.00 : 6428ae: 48 c7 45 b0 30 00 00 movq $0x30,-0x50(%rbp) 0.00 : 6428b5: 00 : hash_ctl.hash = oid_hash; : pgStatFunctions = hash_create("Function stat entries", 0.00 : 6428b6: bf 1c f0 89 00 mov $0x89f01c,%edi : HASHCTL hash_ctl; : : memset(&hash_ctl, 0, sizeof(hash_ctl)); : hash_ctl.keysize = sizeof(Oid); : hash_ctl.entrysize = sizeof(PgStat_BackendFunctionEntry); : hash_ctl.hash = oid_hash; 0.00 : 6428bb: 48 c7 45 b8 50 4f 78 movq $0x784f50,-0x48(%rbp) 0.00 : 6428c2: 00 : pgStatFunctions = hash_create("Function stat entries", 0.00 : 6428c3: b1 30 mov $0x30,%cl 0.00 : 6428c5: e8 e6 1f 14 00 callq 7848b0 0.00 : 6428ca: 48 89 05 df 93 53 00 mov %rax,0x5393df(%rip) # b7bcb0 0.00 : 6428d1: 49 8b 14 24 mov (%r12),%rdx 0.00 : 6428d5: e9 d8 fe ff ff jmpq 6427b2 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1321 16.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1322 16.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1327 16.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1331 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 0.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; /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1321 50.00 : 77e086: c6 45 90 00 movb $0x0,-0x70(%rbp) : fcinfo.argnull[1] = false; /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1322 16.67 : 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) /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1327 16.67 : 77e097: 75 02 jne 77e09b : elog(ERROR, "function %u returned NULL", fcinfo.flinfo->fn_oid); : : return result; : } /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:1331 16.67 : 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 ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:774 16.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:928 16.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:765 16.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:774 16.67 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:927 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) : { 0.00 : 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) 0.00 : 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 0.00 : 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) 0.00 : 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 0.00 : 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); 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:928 16.67 : 79816d: 4c 8b 6d e8 mov -0x18(%rbp),%r13 0.00 : 798171: 4c 8b 75 f0 mov -0x10(%rbp),%r14 0.00 : 798175: 4c 8b 7d f8 mov -0x8(%rbp),%r15 0.00 : 798179: c9 leaveq 0.00 : 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 0.00 : 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 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:765 16.67 : 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; /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:774 16.67 : 79823a: 49 8b 79 10 mov 0x10(%r9),%rdi 33.33 : 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); /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:927 16.67 : 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 ---------------------------------------------- Nothing higher than 0.5% Percent | Source code & Disassembly of ------------------------------------------------ Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1407 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1449 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1466 20.00 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1475 20.00 /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 /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1407 20.00 : 4704e9: 41 56 push %r14 0.00 : 4704eb: 49 89 fe mov %rdi,%r14 0.00 : 4704ee: 41 55 push %r13 0.00 : 4704f0: 41 54 push %r12 0.00 : 4704f2: 53 push %rbx 0.00 : 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 0.00 : 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 0.00 : 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 0.00 : 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 20.00 : 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); 0.00 : 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; 0.00 : 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 */ 0.00 : 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 0.00 : 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 0.00 : 4705cf: 48 89 14 24 mov %rdx,(%rsp) /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1466 20.00 : 4705d3: 4c 89 fa mov %r15,%rdx 0.00 : 4705d6: e8 85 f9 ff ff callq 46ff60 : data_len, : &tuple->t_infomask, : (hasnull ? tuple->t_bits : NULL)); : : return tuple; : } /home/Computational/mark/src/postgres-andres/src/backend/access/common/heaptuple.c:1475 20.00 : 4705db: 48 83 c4 28 add $0x28,%rsp 0.00 : 4705df: 4c 89 e0 mov %r12,%rax 0.00 : 4705e2: 5b pop %rbx 20.00 : 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 0.00 : 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 ---------------------------------------------- 80.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1051 20.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1059 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005aca20 : : * ---------------------------------------------------------------- : */ : static Datum : ExecEvalConst(ExprState *exprstate, ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1051 80.00 : 5aca20: 55 push %rbp : Const *con = (Const *) exprstate->expr; : : if (isDone) 0.00 : 5aca21: 48 85 c9 test %rcx,%rcx : */ : static Datum : ExecEvalConst(ExprState *exprstate, ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { : Const *con = (Const *) exprstate->expr; 0.00 : 5aca24: 48 8b 77 08 mov 0x8(%rdi),%rsi : * ---------------------------------------------------------------- : */ : static Datum : ExecEvalConst(ExprState *exprstate, ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { 0.00 : 5aca28: 48 89 e5 mov %rsp,%rbp : Const *con = (Const *) exprstate->expr; : : if (isDone) 0.00 : 5aca2b: 74 06 je 5aca33 : *isDone = ExprSingleResult; 0.00 : 5aca2d: c7 01 00 00 00 00 movl $0x0,(%rcx) : : *isNull = con->constisnull; 0.00 : 5aca33: 0f b6 46 20 movzbl 0x20(%rsi),%eax 0.00 : 5aca37: 88 02 mov %al,(%rdx) 0.00 : 5aca39: 48 8b 46 18 mov 0x18(%rsi),%rax : return con->constvalue; : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:1059 20.00 : 5aca3d: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 60.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1038 20.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1025 20.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1040 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005bbac0 : : void : ExecHashGetBucketAndBatch(HashJoinTable hashtable, : uint32 hashvalue, : int *bucketno, : int *batchno) : { 0.00 : 5bbac0: 55 push %rbp : uint32 nbuckets = (uint32) hashtable->nbuckets; : uint32 nbatch = (uint32) hashtable->nbatch; 0.00 : 5bbac1: 44 8b 47 40 mov 0x40(%rdi),%r8d : void : ExecHashGetBucketAndBatch(HashJoinTable hashtable, : uint32 hashvalue, : int *bucketno, : int *batchno) : { 0.00 : 5bbac5: 49 89 c9 mov %rcx,%r9 : uint32 nbuckets = (uint32) hashtable->nbuckets; 0.00 : 5bbac8: 8b 07 mov (%rdi),%eax : void : ExecHashGetBucketAndBatch(HashJoinTable hashtable, : uint32 hashvalue, : int *bucketno, : int *batchno) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1025 20.00 : 5bbaca: 48 89 e5 mov %rsp,%rbp : uint32 nbuckets = (uint32) hashtable->nbuckets; : uint32 nbatch = (uint32) hashtable->nbatch; : : if (nbatch > 1) 0.00 : 5bbacd: 41 83 f8 01 cmp $0x1,%r8d 0.00 : 5bbad1: 76 1d jbe 5bbaf0 : { : /* we can do MOD by masking, DIV by shifting */ : *bucketno = hashvalue & (nbuckets - 1); 0.00 : 5bbad3: 83 e8 01 sub $0x1,%eax 0.00 : 5bbad6: 21 f0 and %esi,%eax 0.00 : 5bbad8: 89 02 mov %eax,(%rdx) : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); 0.00 : 5bbada: 8b 4f 04 mov 0x4(%rdi),%ecx 0.00 : 5bbadd: 41 8d 40 ff lea -0x1(%r8),%eax 0.00 : 5bbae1: d3 ee shr %cl,%esi 0.00 : 5bbae3: 21 f0 and %esi,%eax 0.00 : 5bbae5: 41 89 01 mov %eax,(%r9) : else : { : *bucketno = hashvalue & (nbuckets - 1); : *batchno = 0; : } : } 0.00 : 5bbae8: c9 leaveq 0.00 : 5bbae9: c3 retq 0.00 : 5bbaea: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : *bucketno = hashvalue & (nbuckets - 1); : *batchno = (hashvalue >> hashtable->log2_nbuckets) & (nbatch - 1); : } : else : { : *bucketno = hashvalue & (nbuckets - 1); 0.00 : 5bbaf0: 83 e8 01 sub $0x1,%eax 0.00 : 5bbaf3: 21 f0 and %esi,%eax 0.00 : 5bbaf5: 89 02 mov %eax,(%rdx) : *batchno = 0; /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1038 60.00 : 5bbaf7: c7 01 00 00 00 00 movl $0x0,(%rcx) : } : } /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1040 20.00 : 5bbafd: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 60.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int.c:391 40.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int.c:391 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006ea7a0 : : * intge - returns 1 iff arg1 >= arg2 : */ : : Datum : int4eq(PG_FUNCTION_ARGS) : { /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int.c:391 60.00 : 6ea7a0: 48 8b 47 28 mov 0x28(%rdi),%rax 0.00 : 6ea7a4: 39 47 20 cmp %eax,0x20(%rdi) 40.00 : 6ea7a7: 55 push %rbp 0.00 : 6ea7a8: 48 89 e5 mov %rsp,%rbp : int32 arg1 = PG_GETARG_INT32(0); : int32 arg2 = PG_GETARG_INT32(1); : : PG_RETURN_BOOL(arg1 == arg2); : } 0.00 : 6ea7ab: c9 leaveq : * intge - returns 1 iff arg1 >= arg2 : */ : : Datum : int4eq(PG_FUNCTION_ARGS) : { 0.00 : 6ea7ac: 0f 94 c0 sete %al 0.00 : 6ea7af: 0f b6 c0 movzbl %al,%eax Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:706 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:711 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:718 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:718 20.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:718 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006ed180 : : } : : : Datum : int8inc(PG_FUNCTION_ARGS) : { 0.00 : 6ed180: 55 push %rbp 0.00 : 6ed181: 48 89 e5 mov %rsp,%rbp 0.00 : 6ed184: 53 push %rbx 0.00 : 6ed185: 48 83 ec 08 sub $0x8,%rsp : } : else : #endif : { : /* Not called as an aggregate, so just do it the dumb way */ : int64 arg = PG_GETARG_INT64(0); /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:706 20.00 : 6ed189: 48 8b 57 20 mov 0x20(%rdi),%rdx : int64 result; : : result = arg + 1; : /* Overflow check */ : if (result < 0 && arg > 0) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:711 20.00 : 6ed18d: 48 89 d0 mov %rdx,%rax 0.00 : 6ed190: 48 83 c0 01 add $0x1,%rax 0.00 : 6ed194: 78 0a js 6ed1a0 : (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE), : errmsg("bigint out of range"))); : : PG_RETURN_INT64(result); : } : } /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:718 20.00 : 6ed196: 48 83 c4 08 add $0x8,%rsp 20.00 : 6ed19a: 5b pop %rbx 0.00 : 6ed19b: c9 leaveq 20.00 : 6ed19c: c3 retq 0.00 : 6ed19d: 0f 1f 00 nopl (%rax) : int64 arg = PG_GETARG_INT64(0); : int64 result; : : result = arg + 1; : /* Overflow check */ : if (result < 0 && arg > 0) 0.00 : 6ed1a0: 48 85 d2 test %rdx,%rdx 0.00 : 6ed1a3: 7e f1 jle 6ed196 : ereport(ERROR, 0.00 : 6ed1a5: 45 31 c0 xor %r8d,%r8d 0.00 : 6ed1a8: b9 3a ee 8b 00 mov $0x8bee3a,%ecx 0.00 : 6ed1ad: ba ca 02 00 00 mov $0x2ca,%edx 0.00 : 6ed1b2: be d3 ec 8b 00 mov $0x8becd3,%esi 0.00 : 6ed1b7: bf 14 00 00 00 mov $0x14,%edi 0.00 : 6ed1bc: e8 ff d8 08 00 callq 77aac0 0.00 : 6ed1c1: 84 c0 test %al,%al 0.00 : 6ed1c3: 75 05 jne 6ed1ca 0.00 : 6ed1c5: e8 06 c3 d7 ff callq 4694d0 0.00 : 6ed1ca: bf eb ec 8b 00 mov $0x8beceb,%edi 0.00 : 6ed1cf: 31 c0 xor %eax,%eax 0.00 : 6ed1d1: e8 ca f6 08 00 callq 77c8a0 0.00 : 6ed1d6: bf 82 00 00 03 mov $0x3000082,%edi 0.00 : 6ed1db: 89 c3 mov %eax,%ebx 0.00 : 6ed1dd: e8 6e fb 08 00 callq 77cd50 0.00 : 6ed1e2: 89 de mov %ebx,%esi 0.00 : 6ed1e4: 89 c7 mov %eax,%edi 0.00 : 6ed1e6: 31 c0 xor %eax,%eax 0.00 : 6ed1e8: e8 f3 d3 08 00 callq 77a5e0 0.00 : 6ed1ed: eb d6 jmp 6ed1c5 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1445 25.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1458 25.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 && /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:1458 25.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 25.00 : 5bbc06: 89 d0 mov %edx,%eax Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 25.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/datum.c:116 25.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/datum.c:119 25.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/datum.c:116 25.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/datum.c:116 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006cff70 : : * If the datatype is pass-by-reference, memory is obtained with palloc(). : *------------------------------------------------------------------------- : */ : Datum : datumCopy(Datum value, bool typByVal, int typLen) : { /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/datum.c:116 25.00 : 6cff70: 55 push %rbp : Datum res; : : if (typByVal) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/datum.c:119 25.00 : 6cff71: 48 89 f8 mov %rdi,%rax : * If the datatype is pass-by-reference, memory is obtained with palloc(). : *------------------------------------------------------------------------- : */ : Datum : datumCopy(Datum value, bool typByVal, int typLen) : { 0.00 : 6cff74: 48 89 e5 mov %rsp,%rbp 0.00 : 6cff77: 4c 89 6d f8 mov %r13,-0x8(%rbp) /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/datum.c:116 25.00 : 6cff7b: 48 89 5d e8 mov %rbx,-0x18(%rbp) 25.00 : 6cff7f: 49 89 fd mov %rdi,%r13 0.00 : 6cff82: 4c 89 65 f0 mov %r12,-0x10(%rbp) 0.00 : 6cff86: 48 83 ec 20 sub $0x20,%rsp : Datum res; : : if (typByVal) 0.00 : 6cff8a: 40 84 f6 test %sil,%sil 0.00 : 6cff8d: 75 2d jne 6cffbc : else : { : Size realSize; : char *s; : : if (DatumGetPointer(value) == NULL) 0.00 : 6cff8f: 31 c0 xor %eax,%eax 0.00 : 6cff91: 48 85 ff test %rdi,%rdi 0.00 : 6cff94: 74 26 je 6cffbc : return PointerGetDatum(NULL); : : realSize = datumGetSize(value, typByVal, typLen); 0.00 : 6cff96: 31 f6 xor %esi,%esi 0.00 : 6cff98: e8 23 fe ff ff callq 6cfdc0 0.00 : 6cff9d: 48 89 c3 mov %rax,%rbx : : s = (char *) palloc(realSize); 0.00 : 6cffa0: 48 89 c7 mov %rax,%rdi 0.00 : 6cffa3: e8 a8 8d 0c 00 callq 798d50 : memcpy(s, DatumGetPointer(value), realSize); 0.00 : 6cffa8: 48 89 da mov %rbx,%rdx : if (DatumGetPointer(value) == NULL) : return PointerGetDatum(NULL); : : realSize = datumGetSize(value, typByVal, typLen); : : s = (char *) palloc(realSize); 0.00 : 6cffab: 49 89 c4 mov %rax,%r12 : memcpy(s, DatumGetPointer(value), realSize); 0.00 : 6cffae: 4c 89 ee mov %r13,%rsi 0.00 : 6cffb1: 48 89 c7 mov %rax,%rdi 0.00 : 6cffb4: e8 37 9c d9 ff callq 469bf0 : res = PointerGetDatum(s); 0.00 : 6cffb9: 4c 89 e0 mov %r12,%rax : } : return res; : } 0.00 : 6cffbc: 48 8b 5d e8 mov -0x18(%rbp),%rbx 0.00 : 6cffc0: 4c 8b 65 f0 mov -0x10(%rbp),%r12 0.00 : 6cffc4: 4c 8b 6d f8 mov -0x8(%rbp),%r13 0.00 : 6cffc8: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:952 25.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:936 25.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:1001 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 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:936 25.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 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:952 50.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 0.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 /home/Computational/mark/src/postgres-andres/src/backend/utils/mmgr/aset.c:1001 25.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; 0.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 0.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 0.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 ---------------------------------------------- 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 ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/access/transam/transam.c:308 33.33 /home/Computational/mark/src/postgres-andres/src/backend/access/transam/transam.c:313 33.33 /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)) /home/Computational/mark/src/postgres-andres/src/backend/access/transam/transam.c:308 33.33 : 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); 0.00 : 4bffee: 29 f7 sub %esi,%edi : } /home/Computational/mark/src/postgres-andres/src/backend/access/transam/transam.c:313 33.33 : 4bfff0: c9 leaveq : : if (!TransactionIdIsNormal(id1) || !TransactionIdIsNormal(id2)) : return (id1 < id2); : : diff = (int32) (id1 - id2); : return (diff < 0); /home/Computational/mark/src/postgres-andres/src/backend/access/transam/transam.c:312 33.33 : 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 ---------------------------------------------- 66.67 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:116 33.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:109 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, 0.00 : 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, /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeHash.c:109 33.33 : 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 0.00 : 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 66.67 : 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 0.00 : 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 ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:48 33.33 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:48 33.33 /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) : { 0.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) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:48 33.33 : 5c5938: 4c 89 65 f8 mov %r12,-0x8(%rbp) 33.33 : 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) 0.00 : 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 0.00 : 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 0.00 : 5c597c: 48 8b 1c 24 mov (%rsp),%rbx 0.00 : 5c5980: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeSeqscan.c:86 33.33 : 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 /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 66.67 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1283 33.33 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1318 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) 0.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; 0.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 66.67 : 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 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1318 33.33 : 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 /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 66.67 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1781 33.33 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1798 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006756f0 : : * or if the bgwriter has been effectively disabled by setting : * bgwriter_lru_maxpages to 0.) : */ : bool : BgBufferSync(void) : { 0.00 : 6756f0: 55 push %rbp 0.00 : 6756f1: 48 89 e5 mov %rsp,%rbp 0.00 : 6756f4: 41 57 push %r15 : : /* : * Find out where the freelist clock sweep currently is, and how many : * buffer allocations have happened since our last call. : */ : strategy_buf_id = StrategySyncStart(&strategy_passes, &recent_alloc); 0.00 : 6756f6: 48 8d 75 d0 lea -0x30(%rbp),%rsi 0.00 : 6756fa: 48 8d 7d d4 lea -0x2c(%rbp),%rdi : * or if the bgwriter has been effectively disabled by setting : * bgwriter_lru_maxpages to 0.) : */ : bool : BgBufferSync(void) : { 0.00 : 6756fe: 41 56 push %r14 0.00 : 675700: 41 55 push %r13 0.00 : 675702: 41 54 push %r12 0.00 : 675704: 53 push %rbx 0.00 : 675705: 48 83 ec 18 sub $0x18,%rsp : : /* : * Find out where the freelist clock sweep currently is, and how many : * buffer allocations have happened since our last call. : */ : strategy_buf_id = StrategySyncStart(&strategy_passes, &recent_alloc); 0.00 : 675709: e8 22 1d 00 00 callq 677430 : : /* Report buffer alloc counts to pgstat */ : BgWriterStats.m_buf_alloc += recent_alloc; 0.00 : 67570e: 44 8b 55 d0 mov -0x30(%rbp),%r10d : /* : * If we're not running the LRU scan, just stop after doing the stats : * stuff. We mark the saved state invalid so that we can recover sanely : * if LRU scan is turned back on later. : */ : if (bgwriter_lru_maxpages <= 0) 0.00 : 675712: 44 8b 1d 77 2f 4f 00 mov 0x4f2f77(%rip),%r11d # b68690 : : /* : * Find out where the freelist clock sweep currently is, and how many : * buffer allocations have happened since our last call. : */ : strategy_buf_id = StrategySyncStart(&strategy_passes, &recent_alloc); 0.00 : 675719: 89 c6 mov %eax,%esi : : /* Report buffer alloc counts to pgstat */ : BgWriterStats.m_buf_alloc += recent_alloc; 0.00 : 67571b: 45 89 d1 mov %r10d,%r9d 0.00 : 67571e: 4c 01 0d 5b a3 54 00 add %r9,0x54a35b(%rip) # bbfa80 : /* : * If we're not running the LRU scan, just stop after doing the stats : * stuff. We mark the saved state invalid so that we can recover sanely : * if LRU scan is turned back on later. : */ : if (bgwriter_lru_maxpages <= 0) 0.00 : 675725: 45 85 db test %r11d,%r11d 0.00 : 675728: 0f 8e a2 02 00 00 jle 6759d0 : * see if we are still ahead of the clock sweep, and if so, how many : * buffers we could scan before we'd catch up with it and "lap" it. Note: : * weird-looking coding of xxx_passes comparisons are to avoid bogus : * behavior when the passes counts wrap around. : */ : if (saved_info_valid) 0.00 : 67572e: 80 3d 6f 79 50 00 00 cmpb $0x0,0x50796f(%rip) # b7d0a4 0.00 : 675735: 0f 85 4d 01 00 00 jne 675888 : } : : /* Update saved info for next time */ : prev_strategy_buf_id = strategy_buf_id; : prev_strategy_passes = strategy_passes; : saved_info_valid = true; 0.00 : 67573b: f3 49 0f 2a d1 cvtsi2ss %r9,%xmm2 : #ifdef BGW_DEBUG : elog(DEBUG2, "bgwriter initializing: strategy %u-%u", : strategy_passes, strategy_buf_id); : #endif : strategy_delta = 0; : next_to_clean = strategy_buf_id; 0.00 : 675740: 89 05 52 79 50 00 mov %eax,0x507952(%rip) # b7d098 : next_passes = strategy_passes; : bufs_to_lap = NBuffers; 0.00 : 675746: 8b 3d d4 33 4f 00 mov 0x4f33d4(%rip),%edi # b68b20 : elog(DEBUG2, "bgwriter initializing: strategy %u-%u", : strategy_passes, strategy_buf_id); : #endif : strategy_delta = 0; : next_to_clean = strategy_buf_id; : next_passes = strategy_passes; 0.00 : 67574c: 8b 45 d4 mov -0x2c(%rbp),%eax : bufs_to_lap = NBuffers; : } : : /* Update saved info for next time */ : prev_strategy_buf_id = strategy_buf_id; 0.00 : 67574f: 89 35 4b 79 50 00 mov %esi,0x50794b(%rip) # b7d0a0 : prev_strategy_passes = strategy_passes; : saved_info_valid = true; 0.00 : 675755: c6 05 48 79 50 00 01 movb $0x1,0x507948(%rip) # b7d0a4 : strategy_passes, strategy_buf_id); : #endif : strategy_delta = 0; : next_to_clean = strategy_buf_id; : next_passes = strategy_passes; : bufs_to_lap = NBuffers; 0.00 : 67575c: 89 7d c4 mov %edi,-0x3c(%rbp) : elog(DEBUG2, "bgwriter initializing: strategy %u-%u", : strategy_passes, strategy_buf_id); : #endif : strategy_delta = 0; : next_to_clean = strategy_buf_id; : next_passes = strategy_passes; 0.00 : 67575f: 89 05 2f 79 50 00 mov %eax,0x50792f(%rip) # b7d094 : bufs_to_lap = NBuffers; : } : : /* Update saved info for next time */ : prev_strategy_buf_id = strategy_buf_id; : prev_strategy_passes = strategy_passes; 0.00 : 675765: 89 05 31 79 50 00 mov %eax,0x507931(%rip) # b7d09c : * Estimate how many reusable buffers there are between the current : * strategy point and where we've scanned ahead to, based on the smoothed : * density estimate. : */ : bufs_ahead = NBuffers - bufs_to_lap; : reusable_buffers_est = (float) bufs_ahead / smoothed_density; 0.00 : 67576b: 89 f8 mov %edi,%eax 0.00 : 67576d: 2b 45 c4 sub -0x3c(%rbp),%eax 0.00 : 675770: f3 0f 2a c0 cvtsi2ss %eax,%xmm0 0.00 : 675774: f3 0f 5e 05 24 2f 4f divss 0x4f2f24(%rip),%xmm0 # b686a0 0.00 : 67577b: 00 0.00 : 67577c: f3 44 0f 2c f8 cvttss2si %xmm0,%r15d : /* : * Track a moving average of recent buffer allocations. Here, rather than : * a true average we want a fast-attack, slow-decline behavior: we : * immediately follow any increase. : */ : if (smoothed_alloc <= (float) recent_alloc) 0.00 : 675781: f3 0f 10 05 07 79 50 movss 0x507907(%rip),%xmm0 # b7d090 0.00 : 675788: 00 0.00 : 675789: 0f 2e d0 ucomiss %xmm0,%xmm2 0.00 : 67578c: 0f 82 1e 02 00 00 jb 6759b0 : smoothed_alloc = recent_alloc; 0.00 : 675792: f3 0f 11 15 f6 78 50 movss %xmm2,0x5078f6(%rip) # b7d090 0.00 : 675799: 00 : else : smoothed_alloc += ((float) recent_alloc - smoothed_alloc) / : smoothing_samples; : : /* Scale the estimate by a GUC to allow more aggressive tuning. */ : upcoming_alloc_est = (int) (smoothed_alloc * bgwriter_lru_multiplier); 0.00 : 67579a: f3 0f 10 05 ee 78 50 movss 0x5078ee(%rip),%xmm0 # b7d090 0.00 : 6757a1: 00 0.00 : 6757a2: 0f 5a c0 cvtps2pd %xmm0,%xmm0 0.00 : 6757a5: f2 0f 59 05 eb 2e 4f mulsd 0x4f2eeb(%rip),%xmm0 # b68698 0.00 : 6757ac: 00 0.00 : 6757ad: f2 0f 2c d0 cvttsd2si %xmm0,%edx : * kernel warnings on some platforms. Once upcoming_alloc_est has gone to : * zero, there's no point in tracking smaller and smaller values of : * smoothed_alloc, so just reset it to exactly zero to avoid this : * syndrome. It will pop back up as soon as recent_alloc increases. : */ : if (upcoming_alloc_est == 0) 0.00 : 6757b1: 85 d2 test %edx,%edx 0.00 : 6757b3: 75 0a jne 6757bf : smoothed_alloc = 0; 0.00 : 6757b5: c7 05 d1 78 50 00 00 movl $0x0,0x5078d1(%rip) # b7d090 0.00 : 6757bc: 00 00 00 0.00 : 6757bf: f3 0f 2a 15 29 2e 4f cvtsi2ssl 0x4f2e29(%rip),%xmm2 # b685f0 0.00 : 6757c6: 00 : * enough buffers to match our estimate of the next cycle's allocation : * requirements, or hit the bgwriter_lru_maxpages limit. : */ : : /* Make sure we can handle the pin inside SyncOneBuffer */ : ResourceOwnerEnlargeBuffers(CurrentResourceOwner); 0.00 : 6757c7: 45 89 fc mov %r15d,%r12d : * zero, there's no point in tracking smaller and smaller values of : * smoothed_alloc, so just reset it to exactly zero to avoid this : * syndrome. It will pop back up as soon as recent_alloc increases. : */ : if (upcoming_alloc_est == 0) : smoothed_alloc = 0; 0.00 : 6757ca: f3 0f 10 05 16 49 23 movss 0x234916(%rip),%xmm0 # 8aa0e8 <__func__.17063+0x15> 0.00 : 6757d1: 00 0.00 : 6757d2: f3 0f 2a cf cvtsi2ss %edi,%xmm1 : * enough buffers to match our estimate of the next cycle's allocation : * requirements, or hit the bgwriter_lru_maxpages limit. : */ : : /* Make sure we can handle the pin inside SyncOneBuffer */ : ResourceOwnerEnlargeBuffers(CurrentResourceOwner); 0.00 : 6757d6: 48 8b 3d e3 50 54 00 mov 0x5450e3(%rip),%rdi # bba8c0 : * zero, there's no point in tracking smaller and smaller values of : * smoothed_alloc, so just reset it to exactly zero to avoid this : * syndrome. It will pop back up as soon as recent_alloc increases. : */ : if (upcoming_alloc_est == 0) : smoothed_alloc = 0; 0.00 : 6757dd: f3 0f 5e c2 divss %xmm2,%xmm0 0.00 : 6757e1: f3 0f 5e c8 divss %xmm0,%xmm1 0.00 : 6757e5: f3 0f 2c c1 cvttss2si %xmm1,%eax 0.00 : 6757e9: 45 8d 34 07 lea (%r15,%rax,1),%r14d 0.00 : 6757ed: 41 39 d6 cmp %edx,%r14d 0.00 : 6757f0: 44 0f 4c f2 cmovl %edx,%r14d : * enough buffers to match our estimate of the next cycle's allocation : * requirements, or hit the bgwriter_lru_maxpages limit. : */ : : /* Make sure we can handle the pin inside SyncOneBuffer */ : ResourceOwnerEnlargeBuffers(CurrentResourceOwner); 0.00 : 6757f4: 45 31 ed xor %r13d,%r13d 0.00 : 6757f7: e8 74 56 12 00 callq 79ae70 0.00 : 6757fc: 8b 5d c4 mov -0x3c(%rbp),%ebx 0.00 : 6757ff: 90 nop : num_to_scan = bufs_to_lap; : num_written = 0; : reusable_buffers = reusable_buffers_est; : : /* Execute the LRU scan */ : while (num_to_scan > 0 && reusable_buffers < upcoming_alloc_est) 0.00 : 675800: 85 db test %ebx,%ebx 0.00 : 675802: 7e 09 jle 67580d 0.00 : 675804: 45 39 e6 cmp %r12d,%r14d 0.00 : 675807: 0f 8f 23 01 00 00 jg 675930 : } : else if (buffer_state & BUF_REUSABLE) : reusable_buffers++; : } : : BgWriterStats.m_buf_written_clean += num_written; 0.00 : 67580d: 49 63 c5 movslq %r13d,%rax 0.00 : 675810: 48 01 05 49 a2 54 00 add %rax,0x54a249(%rip) # bbfa60 : * effectively halves the moving average period in cases where both the : * strategy and the background writer are doing some useful scanning, : * which is helpful because a long memory isn't as desirable on the : * density estimates. : */ : new_strategy_delta = bufs_to_lap - num_to_scan; 0.00 : 675817: 8b 45 c4 mov -0x3c(%rbp),%eax : new_recent_alloc = reusable_buffers - reusable_buffers_est; 0.00 : 67581a: 44 89 e2 mov %r12d,%edx 0.00 : 67581d: 44 29 fa sub %r15d,%edx : * effectively halves the moving average period in cases where both the : * strategy and the background writer are doing some useful scanning, : * which is helpful because a long memory isn't as desirable on the : * density estimates. : */ : new_strategy_delta = bufs_to_lap - num_to_scan; 0.00 : 675820: 29 d8 sub %ebx,%eax 0.00 : 675822: 48 98 cltq : new_recent_alloc = reusable_buffers - reusable_buffers_est; : if (new_strategy_delta > 0 && new_recent_alloc > 0) 0.00 : 675824: 48 85 c0 test %rax,%rax 0.00 : 675827: 7e 34 jle 67585d 0.00 : 675829: 85 d2 test %edx,%edx 0.00 : 67582b: 74 30 je 67585d : { : scans_per_alloc = (float) new_strategy_delta / (float) new_recent_alloc; : smoothed_density += (scans_per_alloc - smoothed_density) / 0.00 : 67582d: f3 48 0f 2a c0 cvtsi2ss %rax,%xmm0 0.00 : 675832: 89 d0 mov %edx,%eax 0.00 : 675834: f3 48 0f 2a c8 cvtsi2ss %rax,%xmm1 0.00 : 675839: f3 0f 10 15 5f 2e 4f movss 0x4f2e5f(%rip),%xmm2 # b686a0 0.00 : 675840: 00 0.00 : 675841: f3 0f 5e c1 divss %xmm1,%xmm0 0.00 : 675845: f3 0f 5c c2 subss %xmm2,%xmm0 0.00 : 675849: f3 0f 59 05 93 48 23 mulss 0x234893(%rip),%xmm0 # 8aa0e4 <__func__.17063+0x11> 0.00 : 675850: 00 0.00 : 675851: f3 0f 58 d0 addss %xmm0,%xmm2 0.00 : 675855: f3 0f 11 15 43 2e 4f movss %xmm2,0x4f2e43(%rip) # b686a0 0.00 : 67585c: 00 : scans_per_alloc, smoothed_density); : #endif : } : : /* Return true if OK to hibernate */ : return (bufs_to_lap == 0 && recent_alloc == 0); 0.00 : 67585d: 44 8b 55 c4 mov -0x3c(%rbp),%r10d 0.00 : 675861: 31 c0 xor %eax,%eax 0.00 : 675863: 45 85 d2 test %r10d,%r10d 0.00 : 675866: 75 0a jne 675872 0.00 : 675868: 44 8b 4d d0 mov -0x30(%rbp),%r9d 0.00 : 67586c: 45 85 c9 test %r9d,%r9d 0.00 : 67586f: 0f 94 c0 sete %al : } 0.00 : 675872: 48 83 c4 18 add $0x18,%rsp 0.00 : 675876: 5b pop %rbx 0.00 : 675877: 41 5c pop %r12 0.00 : 675879: 41 5d pop %r13 0.00 : 67587b: 41 5e pop %r14 0.00 : 67587d: 41 5f pop %r15 0.00 : 67587f: c9 leaveq 0.00 : 675880: c3 retq 0.00 : 675881: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * weird-looking coding of xxx_passes comparisons are to avoid bogus : * behavior when the passes counts wrap around. : */ : if (saved_info_valid) : { : int32 passes_delta = strategy_passes - prev_strategy_passes; 0.00 : 675888: 44 8b 45 d4 mov -0x2c(%rbp),%r8d : : strategy_delta = strategy_buf_id - prev_strategy_buf_id; 0.00 : 67588c: 89 c1 mov %eax,%ecx : strategy_delta += (long) passes_delta *NBuffers; 0.00 : 67588e: 8b 3d 8c 32 4f 00 mov 0x4f328c(%rip),%edi # b68b20 : */ : if (saved_info_valid) : { : int32 passes_delta = strategy_passes - prev_strategy_passes; : : strategy_delta = strategy_buf_id - prev_strategy_buf_id; 0.00 : 675894: 2b 0d 06 78 50 00 sub 0x507806(%rip),%ecx # b7d0a0 : strategy_delta += (long) passes_delta *NBuffers; 0.00 : 67589a: 44 89 c0 mov %r8d,%eax 0.00 : 67589d: 2b 05 f9 77 50 00 sub 0x5077f9(%rip),%eax # b7d09c 0.00 : 6758a3: 48 63 d7 movslq %edi,%rdx 0.00 : 6758a6: 89 7d c4 mov %edi,-0x3c(%rbp) : */ : if (saved_info_valid) : { : int32 passes_delta = strategy_passes - prev_strategy_passes; : : strategy_delta = strategy_buf_id - prev_strategy_buf_id; 0.00 : 6758a9: 48 63 c9 movslq %ecx,%rcx : strategy_delta += (long) passes_delta *NBuffers; 0.00 : 6758ac: 48 98 cltq 0.00 : 6758ae: 48 0f af c2 imul %rdx,%rax : : Assert(strategy_delta >= 0); : : if ((int32) (next_passes - strategy_passes) > 0) 0.00 : 6758b2: 8b 15 dc 77 50 00 mov 0x5077dc(%rip),%edx # b7d094 : if (saved_info_valid) : { : int32 passes_delta = strategy_passes - prev_strategy_passes; : : strategy_delta = strategy_buf_id - prev_strategy_buf_id; : strategy_delta += (long) passes_delta *NBuffers; 0.00 : 6758b8: 48 01 c1 add %rax,%rcx : : Assert(strategy_delta >= 0); : : if ((int32) (next_passes - strategy_passes) > 0) 0.00 : 6758bb: 89 d0 mov %edx,%eax 0.00 : 6758bd: 44 29 c0 sub %r8d,%eax 0.00 : 6758c0: 85 c0 test %eax,%eax 0.00 : 6758c2: 0f 8e 23 01 00 00 jle 6759eb : { : /* we're one pass ahead of the strategy point */ : bufs_to_lap = strategy_buf_id - next_to_clean; 0.00 : 6758c8: 89 f0 mov %esi,%eax 0.00 : 6758ca: 2b 05 c8 77 50 00 sub 0x5077c8(%rip),%eax # b7d098 0.00 : 6758d0: 89 45 c4 mov %eax,-0x3c(%rbp) : * Compute how many buffers had to be scanned for each new allocation, ie, : * 1/density of reusable buffers, and track a moving average of that. : * : * If the strategy point didn't move, we don't update the density estimate : */ : if (strategy_delta > 0 && recent_alloc > 0) 0.00 : 6758d3: 48 85 c9 test %rcx,%rcx : next_passes = strategy_passes; : bufs_to_lap = NBuffers; : } : : /* Update saved info for next time */ : prev_strategy_buf_id = strategy_buf_id; 0.00 : 6758d6: 89 35 c4 77 50 00 mov %esi,0x5077c4(%rip) # b7d0a0 : prev_strategy_passes = strategy_passes; 0.00 : 6758dc: 44 89 05 b9 77 50 00 mov %r8d,0x5077b9(%rip) # b7d09c : saved_info_valid = true; 0.00 : 6758e3: c6 05 ba 77 50 00 01 movb $0x1,0x5077ba(%rip) # b7d0a4 : * Compute how many buffers had to be scanned for each new allocation, ie, : * 1/density of reusable buffers, and track a moving average of that. : * : * If the strategy point didn't move, we don't update the density estimate : */ : if (strategy_delta > 0 && recent_alloc > 0) 0.00 : 6758ea: 0f 8e 2c 01 00 00 jle 675a1c 0.00 : 6758f0: 45 85 d2 test %r10d,%r10d 0.00 : 6758f3: 0f 57 d2 xorps %xmm2,%xmm2 0.00 : 6758f6: 0f 84 6f fe ff ff je 67576b : { : scans_per_alloc = (float) strategy_delta / (float) recent_alloc; 0.00 : 6758fc: f3 49 0f 2a d1 cvtsi2ss %r9,%xmm2 : smoothed_density += (scans_per_alloc - smoothed_density) / 0.00 : 675901: f3 48 0f 2a c1 cvtsi2ss %rcx,%xmm0 0.00 : 675906: f3 0f 10 0d 92 2d 4f movss 0x4f2d92(%rip),%xmm1 # b686a0 0.00 : 67590d: 00 0.00 : 67590e: f3 0f 5e c2 divss %xmm2,%xmm0 0.00 : 675912: f3 0f 5c c1 subss %xmm1,%xmm0 0.00 : 675916: f3 0f 59 05 c6 47 23 mulss 0x2347c6(%rip),%xmm0 # 8aa0e4 <__func__.17063+0x11> 0.00 : 67591d: 00 0.00 : 67591e: f3 0f 58 c8 addss %xmm0,%xmm1 0.00 : 675922: f3 0f 11 0d 76 2d 4f movss %xmm1,0x4f2d76(%rip) # b686a0 0.00 : 675929: 00 0.00 : 67592a: e9 3c fe ff ff jmpq 67576b 0.00 : 67592f: 90 nop : reusable_buffers = reusable_buffers_est; : : /* Execute the LRU scan */ : while (num_to_scan > 0 && reusable_buffers < upcoming_alloc_est) : { : int buffer_state = SyncOneBuffer(next_to_clean, true); 0.00 : 675930: 8b 3d 62 77 50 00 mov 0x507762(%rip),%edi # b7d098 0.00 : 675936: be 01 00 00 00 mov $0x1,%esi 0.00 : 67593b: e8 20 f9 ff ff callq 675260 0.00 : 675940: 89 c2 mov %eax,%edx : : if (++next_to_clean >= NBuffers) 0.00 : 675942: 8b 05 50 77 50 00 mov 0x507750(%rip),%eax # b7d098 0.00 : 675948: 83 c0 01 add $0x1,%eax 0.00 : 67594b: 3b 05 cf 31 4f 00 cmp 0x4f31cf(%rip),%eax # b68b20 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1781 66.67 : 675951: 89 05 41 77 50 00 mov %eax,0x507741(%rip) # b7d098 0.00 : 675957: 7c 11 jl 67596a : { : next_to_clean = 0; : next_passes++; 0.00 : 675959: 83 05 34 77 50 00 01 addl $0x1,0x507734(%rip) # b7d094 : { : int buffer_state = SyncOneBuffer(next_to_clean, true); : : if (++next_to_clean >= NBuffers) : { : next_to_clean = 0; 0.00 : 675960: c7 05 2e 77 50 00 00 movl $0x0,0x50772e(%rip) # b7d098 0.00 : 675967: 00 00 00 : next_passes++; : } : num_to_scan--; 0.00 : 67596a: 83 eb 01 sub $0x1,%ebx : : if (buffer_state & BUF_WRITTEN) 0.00 : 67596d: f6 c2 01 test $0x1,%dl 0.00 : 675970: 74 26 je 675998 : { : reusable_buffers++; 0.00 : 675972: 41 83 c4 01 add $0x1,%r12d : if (++num_written >= bgwriter_lru_maxpages) 0.00 : 675976: 41 83 c5 01 add $0x1,%r13d 0.00 : 67597a: 44 3b 2d 0f 2d 4f 00 cmp 0x4f2d0f(%rip),%r13d # b68690 0.00 : 675981: 0f 8c 79 fe ff ff jl 675800 : { : BgWriterStats.m_maxwritten_clean++; 0.00 : 675987: 48 83 05 d9 a0 54 00 addq $0x1,0x54a0d9(%rip) # bbfa68 0.00 : 67598e: 01 : break; 0.00 : 67598f: e9 79 fe ff ff jmpq 67580d 0.00 : 675994: 0f 1f 40 00 nopl 0x0(%rax) : } : } : else if (buffer_state & BUF_REUSABLE) 0.00 : 675998: 83 e2 02 and $0x2,%edx : reusable_buffers++; 0.00 : 67599b: 83 fa 01 cmp $0x1,%edx 0.00 : 67599e: 41 83 dc ff sbb $0xffffffff,%r12d /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1798 33.33 : 6759a2: e9 59 fe ff ff jmpq 675800 0.00 : 6759a7: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 6759ae: 00 00 : * immediately follow any increase. : */ : if (smoothed_alloc <= (float) recent_alloc) : smoothed_alloc = recent_alloc; : else : smoothed_alloc += ((float) recent_alloc - smoothed_alloc) / 0.00 : 6759b0: f3 0f 5c d0 subss %xmm0,%xmm2 0.00 : 6759b4: f3 0f 59 15 28 47 23 mulss 0x234728(%rip),%xmm2 # 8aa0e4 <__func__.17063+0x11> 0.00 : 6759bb: 00 0.00 : 6759bc: f3 0f 58 c2 addss %xmm2,%xmm0 0.00 : 6759c0: f3 0f 11 05 c8 76 50 movss %xmm0,0x5076c8(%rip) # b7d090 0.00 : 6759c7: 00 0.00 : 6759c8: e9 cd fd ff ff jmpq 67579a 0.00 : 6759cd: 0f 1f 00 nopl (%rax) : * stuff. We mark the saved state invalid so that we can recover sanely : * if LRU scan is turned back on later. : */ : if (bgwriter_lru_maxpages <= 0) : { : saved_info_valid = false; 0.00 : 6759d0: c6 05 cd 76 50 00 00 movb $0x0,0x5076cd(%rip) # b7d0a4 : #endif : } : : /* Return true if OK to hibernate */ : return (bufs_to_lap == 0 && recent_alloc == 0); : } 0.00 : 6759d7: 48 83 c4 18 add $0x18,%rsp : * stuff. We mark the saved state invalid so that we can recover sanely : * if LRU scan is turned back on later. : */ : if (bgwriter_lru_maxpages <= 0) : { : saved_info_valid = false; 0.00 : 6759db: b8 01 00 00 00 mov $0x1,%eax : #endif : } : : /* Return true if OK to hibernate */ : return (bufs_to_lap == 0 && recent_alloc == 0); : } 0.00 : 6759e0: 5b pop %rbx 0.00 : 6759e1: 41 5c pop %r12 0.00 : 6759e3: 41 5d pop %r13 0.00 : 6759e5: 41 5e pop %r14 0.00 : 6759e7: 41 5f pop %r15 0.00 : 6759e9: c9 leaveq 0.00 : 6759ea: c3 retq : next_passes, next_to_clean, : strategy_passes, strategy_buf_id, : strategy_delta, bufs_to_lap); : #endif : } : else if (next_passes == strategy_passes && 0.00 : 6759eb: 41 39 d0 cmp %edx,%r8d 0.00 : 6759ee: 74 12 je 675a02 : elog(DEBUG2, "bgwriter behind: bgw %u-%u strategy %u-%u delta=%ld", : next_passes, next_to_clean, : strategy_passes, strategy_buf_id, : strategy_delta); : #endif : next_to_clean = strategy_buf_id; 0.00 : 6759f0: 89 35 a2 76 50 00 mov %esi,0x5076a2(%rip) # b7d098 : next_passes = strategy_passes; 0.00 : 6759f6: 44 89 05 97 76 50 00 mov %r8d,0x507697(%rip) # b7d094 0.00 : 6759fd: e9 d1 fe ff ff jmpq 6758d3 : next_passes, next_to_clean, : strategy_passes, strategy_buf_id, : strategy_delta, bufs_to_lap); : #endif : } : else if (next_passes == strategy_passes && 0.00 : 675a02: 8b 05 90 76 50 00 mov 0x507690(%rip),%eax # b7d098 0.00 : 675a08: 39 c6 cmp %eax,%esi 0.00 : 675a0a: 7f e4 jg 6759f0 : next_to_clean >= strategy_buf_id) : { : /* on same pass, but ahead or at least not behind */ : bufs_to_lap = NBuffers - (next_to_clean - strategy_buf_id); 0.00 : 675a0c: 89 fa mov %edi,%edx 0.00 : 675a0e: 29 c2 sub %eax,%edx 0.00 : 675a10: 89 d0 mov %edx,%eax 0.00 : 675a12: 01 f0 add %esi,%eax 0.00 : 675a14: 89 45 c4 mov %eax,-0x3c(%rbp) : next_passes, next_to_clean, : strategy_passes, strategy_buf_id, : strategy_delta, bufs_to_lap); : #endif : } : else if (next_passes == strategy_passes && 0.00 : 675a17: e9 b7 fe ff ff jmpq 6758d3 : * Compute how many buffers had to be scanned for each new allocation, ie, : * 1/density of reusable buffers, and track a moving average of that. : * : * If the strategy point didn't move, we don't update the density estimate : */ : if (strategy_delta > 0 && recent_alloc > 0) 0.00 : 675a1c: f3 49 0f 2a d1 cvtsi2ss %r9,%xmm2 0.00 : 675a21: e9 45 fd ff ff jmpq 67576b 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 ---------------------------------------------- 33.33 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:2269 33.33 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:2270 33.33 /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:2270 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 000000000077ece0 : : return heap_tuple_untoast_attr_slice(datum, first, count); : } : : struct varlena * : pg_detoast_datum_packed(struct varlena * datum) : { 33.33 : 77ece0: 55 push %rbp : if (VARATT_IS_COMPRESSED(datum) || VARATT_IS_EXTERNAL(datum)) 0.00 : 77ece1: 0f b6 17 movzbl (%rdi),%edx : return heap_tuple_untoast_attr_slice(datum, first, count); : } : : struct varlena * : pg_detoast_datum_packed(struct varlena * datum) : { 0.00 : 77ece4: 48 89 e5 mov %rsp,%rbp : if (VARATT_IS_COMPRESSED(datum) || VARATT_IS_EXTERNAL(datum)) /home/Computational/mark/src/postgres-andres/src/backend/utils/fmgr/fmgr.c:2270 33.33 : 77ece7: 89 d0 mov %edx,%eax 33.33 : 77ece9: 83 e0 03 and $0x3,%eax 0.00 : 77ecec: 83 f8 02 cmp $0x2,%eax 0.00 : 77ecef: 74 0f je 77ed00 0.00 : 77ecf1: 80 ea 01 sub $0x1,%dl 0.00 : 77ecf4: 74 0a je 77ed00 : return heap_tuple_untoast_attr(datum); : else : return datum; : } 0.00 : 77ecf6: 48 89 f8 mov %rdi,%rax 0.00 : 77ecf9: c9 leaveq 0.00 : 77ecfa: c3 retq 0.00 : 77ecfb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 77ed00: c9 leaveq : : struct varlena * : pg_detoast_datum_packed(struct varlena * datum) : { : if (VARATT_IS_COMPRESSED(datum) || VARATT_IS_EXTERNAL(datum)) : return heap_tuple_untoast_attr(datum); 0.00 : 77ed01: e9 4a 41 d2 ff jmpq 4a2e50 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/drivers/net/ethernet/intel/ixgbe/ixgbe.ko ---------------------------------------------- 33.33 ??:0 33.33 ??:0 33.33 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/drivers/net/ethernet/intel/ixgbe/ixgbe.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000001800 : : /** : * ixgbe_update_stats - Update the board statistics counters. : * @adapter: board private structure : **/ : void ixgbe_update_stats(struct ixgbe_adapter *adapter) : { 0.00 : 1800: 41 57 push %r15 0.00 : 1802: 41 56 push %r14 0.00 : 1804: 41 55 push %r13 0.00 : 1806: 41 54 push %r12 0.00 : 1808: 55 push %rbp 0.00 : 1809: 53 push %rbx 0.00 : 180a: 48 89 fb mov %rdi,%rbx 0.00 : 180d: 48 83 ec 28 sub $0x28,%rsp : return oldbit; : } : : static __always_inline int constant_test_bit(unsigned int nr, const volatile unsigned long *addr) : { : return ((1UL << (nr % BITS_PER_LONG)) & 0.00 : 1811: 48 8b 87 10 02 00 00 mov 0x210(%rdi),%rax : #ifdef HAVE_NETDEV_STATS_IN_NETDEV : struct net_device_stats *net_stats = &adapter->netdev->stats; 0.00 : 1818: 4c 8b bf 00 02 00 00 mov 0x200(%rdi),%r15 : u64 bytes = 0, packets = 0, hw_csum_rx_error = 0; : #ifndef IXGBE_NO_LRO : u32 flushed = 0, coal = 0; : #endif : : if (test_bit(__IXGBE_DOWN, &adapter->state) || 0.00 : 181f: a8 04 test $0x4,%al 0.00 : 1821: 0f 85 b9 09 00 00 jne 21e0 0.00 : 1827: 48 8b 87 10 02 00 00 mov 0x210(%rdi),%rax 0.00 : 182e: a8 02 test $0x2,%al 0.00 : 1830: 0f 85 aa 09 00 00 jne 21e0 : test_bit(__IXGBE_RESETTING, &adapter->state)) : return; : : if (adapter->flags2 & IXGBE_FLAG2_RSC_ENABLED) { 0.00 : 1836: f6 87 1c 02 00 00 02 testb $0x2,0x21c(%rdi) 0.00 : 183d: 0f 85 ac 09 00 00 jne 21ef 0.00 : 1843: 44 8b 9f 28 02 00 00 mov 0x228(%rdi),%r11d : adapter->rsc_total_count = rsc_count; : adapter->rsc_total_flush = rsc_flush; : } : : #ifndef IXGBE_NO_LRO : for (i = 0; i < adapter->num_q_vectors; i++) { 0.00 : 184a: 8b 83 c0 0b 00 00 mov 0xbc0(%rbx),%eax 0.00 : 1850: 31 f6 xor %esi,%esi 0.00 : 1852: 31 c9 xor %ecx,%ecx 0.00 : 1854: 85 c0 test %eax,%eax 0.00 : 1856: 74 3a je 1892 0.00 : 1858: 83 e8 01 sub $0x1,%eax 0.00 : 185b: 31 f6 xor %esi,%esi 0.00 : 185d: 31 c9 xor %ecx,%ecx 0.00 : 185f: 48 8d 3c c5 08 00 00 lea 0x8(,%rax,8),%rdi 0.00 : 1866: 00 0.00 : 1867: 31 d2 xor %edx,%edx 0.00 : 1869: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : struct ixgbe_q_vector *q_vector = adapter->q_vector[i]; 0.00 : 1870: 48 8b 84 13 50 07 00 mov 0x750(%rbx,%rdx,1),%rax 0.00 : 1877: 00 : if (!q_vector) 0.00 : 1878: 48 85 c0 test %rax,%rax 0.00 : 187b: 74 0c je 1889 : continue; : flushed += q_vector->lrolist.stats.flushed; 0.00 : 187d: 03 b0 b8 02 00 00 add 0x2b8(%rax),%esi : coal += q_vector->lrolist.stats.coal; 0.00 : 1883: 03 88 bc 02 00 00 add 0x2bc(%rax),%ecx 0.00 : 1889: 48 83 c2 08 add $0x8,%rdx : adapter->rsc_total_count = rsc_count; : adapter->rsc_total_flush = rsc_flush; : } : : #ifndef IXGBE_NO_LRO : for (i = 0; i < adapter->num_q_vectors; i++) { 0.00 : 188d: 48 39 fa cmp %rdi,%rdx 0.00 : 1890: 75 de jne 1870 : } : adapter->lro_stats.flushed = flushed; : adapter->lro_stats.coal = coal; : : #endif : for (i = 0; i < adapter->num_rx_queues; i++) { 0.00 : 1892: 45 85 db test %r11d,%r11d : if (!q_vector) : continue; : flushed += q_vector->lrolist.stats.flushed; : coal += q_vector->lrolist.stats.coal; : } : adapter->lro_stats.flushed = flushed; 0.00 : 1895: 89 b3 f8 0b 00 00 mov %esi,0xbf8(%rbx) : adapter->lro_stats.coal = coal; 0.00 : 189b: 89 8b fc 0b 00 00 mov %ecx,0xbfc(%rbx) : : #endif : for (i = 0; i < adapter->num_rx_queues; i++) { 0.00 : 18a1: 0f 84 6b 0f 00 00 je 2812 0.00 : 18a7: 41 8d 43 ff lea -0x1(%r11),%eax 0.00 : 18ab: 45 31 d2 xor %r10d,%r10d 0.00 : 18ae: 31 f6 xor %esi,%esi 0.00 : 18b0: 31 c9 xor %ecx,%ecx 0.00 : 18b2: 45 31 c9 xor %r9d,%r9d 0.00 : 18b5: 45 31 c0 xor %r8d,%r8d 0.00 : 18b8: 4c 8d 1c c5 08 00 00 lea 0x8(,%rax,8),%r11 0.00 : 18bf: 00 0.00 : 18c0: 31 ff xor %edi,%edi 0.00 : 18c2: 31 d2 xor %edx,%edx 0.00 : 18c4: 0f 1f 40 00 nopl 0x0(%rax) : struct ixgbe_ring *rx_ring = adapter->rx_ring[i]; 0.00 : 18c8: 48 8b 84 13 d8 04 00 mov 0x4d8(%rbx,%rdx,1),%rax 0.00 : 18cf: 00 : non_eop_descs += rx_ring->rx_stats.non_eop_descs; : alloc_rx_page_failed += rx_ring->rx_stats.alloc_rx_page_failed; : alloc_rx_buff_failed += rx_ring->rx_stats.alloc_rx_buff_failed; : hw_csum_rx_error += rx_ring->rx_stats.csum_err; : bytes += rx_ring->stats.bytes; : packets += rx_ring->stats.packets; 0.00 : 18d0: 48 83 c2 08 add $0x8,%rdx : adapter->lro_stats.coal = coal; : : #endif : for (i = 0; i < adapter->num_rx_queues; i++) { : struct ixgbe_ring *rx_ring = adapter->rx_ring[i]; : non_eop_descs += rx_ring->rx_stats.non_eop_descs; 0.00 : 18d4: 4c 03 50 78 add 0x78(%rax),%r10 : alloc_rx_page_failed += rx_ring->rx_stats.alloc_rx_page_failed; 0.00 : 18d8: 48 03 b0 80 00 00 00 add 0x80(%rax),%rsi : alloc_rx_buff_failed += rx_ring->rx_stats.alloc_rx_buff_failed; 0.00 : 18df: 48 03 88 88 00 00 00 add 0x88(%rax),%rcx : hw_csum_rx_error += rx_ring->rx_stats.csum_err; 0.00 : 18e6: 48 03 b8 90 00 00 00 add 0x90(%rax),%rdi : bytes += rx_ring->stats.bytes; 0.00 : 18ed: 4c 03 48 60 add 0x60(%rax),%r9 : packets += rx_ring->stats.packets; 0.00 : 18f1: 4c 03 40 58 add 0x58(%rax),%r8 : } : adapter->lro_stats.flushed = flushed; : adapter->lro_stats.coal = coal; : : #endif : for (i = 0; i < adapter->num_rx_queues; i++) { 0.00 : 18f5: 4c 39 da cmp %r11,%rdx 0.00 : 18f8: 75 ce jne 18c8 0.00 : 18fa: 89 f2 mov %esi,%edx 0.00 : 18fc: 89 c8 mov %ecx,%eax : packets += rx_ring->stats.packets; : : } : adapter->non_eop_descs = non_eop_descs; : adapter->alloc_rx_page_failed = alloc_rx_page_failed; : adapter->alloc_rx_buff_failed = alloc_rx_buff_failed; 0.00 : 18fe: 89 83 4c 07 00 00 mov %eax,0x74c(%rbx) : hw_csum_rx_error += rx_ring->rx_stats.csum_err; : bytes += rx_ring->stats.bytes; : packets += rx_ring->stats.packets; : : } : adapter->non_eop_descs = non_eop_descs; 0.00 : 1904: 4c 89 93 40 07 00 00 mov %r10,0x740(%rbx) : adapter->alloc_rx_page_failed = alloc_rx_page_failed; 0.00 : 190b: 89 93 48 07 00 00 mov %edx,0x748(%rbx) : adapter->alloc_rx_buff_failed = alloc_rx_buff_failed; : adapter->hw_csum_rx_error = hw_csum_rx_error; 0.00 : 1911: 48 89 bb 20 07 00 00 mov %rdi,0x720(%rbx) : net_stats->rx_bytes = bytes; 0.00 : 1918: 4d 89 8f d8 00 00 00 mov %r9,0xd8(%r15) : net_stats->rx_packets = packets; 0.00 : 191f: 4d 89 87 c8 00 00 00 mov %r8,0xc8(%r15) : : bytes = 0; : packets = 0; : /* gather some stats to the adapter struct that are per queue */ : for (i = 0; i < adapter->num_tx_queues; i++) { 0.00 : 1926: 8b 83 20 02 00 00 mov 0x220(%rbx),%eax 0.00 : 192c: 85 c0 test %eax,%eax 0.00 : 192e: 0f 84 f2 0e 00 00 je 2826 0.00 : 1934: 83 e8 01 sub $0x1,%eax 0.00 : 1937: 45 31 c0 xor %r8d,%r8d 0.00 : 193a: 31 ff xor %edi,%edi 0.00 : 193c: 4c 8d 0c c5 08 00 00 lea 0x8(,%rax,8),%r9 0.00 : 1943: 00 0.00 : 1944: 31 f6 xor %esi,%esi 0.00 : 1946: 31 c9 xor %ecx,%ecx 0.00 : 1948: 31 d2 xor %edx,%edx 0.00 : 194a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : struct ixgbe_ring *tx_ring = adapter->tx_ring[i]; 0.00 : 1950: 48 8b 84 13 80 02 00 mov 0x280(%rbx,%rdx,1),%rax 0.00 : 1957: 00 : restart_queue += tx_ring->tx_stats.restart_queue; : tx_busy += tx_ring->tx_stats.tx_busy; : bytes += tx_ring->stats.bytes; : packets += tx_ring->stats.packets; 0.00 : 1958: 48 83 c2 08 add $0x8,%rdx : bytes = 0; : packets = 0; : /* gather some stats to the adapter struct that are per queue */ : for (i = 0; i < adapter->num_tx_queues; i++) { : struct ixgbe_ring *tx_ring = adapter->tx_ring[i]; : restart_queue += tx_ring->tx_stats.restart_queue; 0.00 : 195c: 4c 03 40 68 add 0x68(%rax),%r8 : tx_busy += tx_ring->tx_stats.tx_busy; 0.00 : 1960: 48 03 78 70 add 0x70(%rax),%rdi : bytes += tx_ring->stats.bytes; 0.00 : 1964: 48 03 70 60 add 0x60(%rax),%rsi : packets += tx_ring->stats.packets; 0.00 : 1968: 48 03 48 58 add 0x58(%rax),%rcx : net_stats->rx_packets = packets; : : bytes = 0; : packets = 0; : /* gather some stats to the adapter struct that are per queue */ : for (i = 0; i < adapter->num_tx_queues; i++) { 0.00 : 196c: 4c 39 ca cmp %r9,%rdx 0.00 : 196f: 75 df jne 1950 : restart_queue += tx_ring->tx_stats.restart_queue; : tx_busy += tx_ring->tx_stats.tx_busy; : bytes += tx_ring->stats.bytes; : packets += tx_ring->stats.packets; : } : adapter->restart_queue = restart_queue; 0.00 : 1971: 4c 89 83 c0 04 00 00 mov %r8,0x4c0(%rbx) : adapter->tx_busy = tx_busy; 0.00 : 1978: 48 89 bb 08 1b 00 00 mov %rdi,0x1b08(%rbx) : net_stats->tx_bytes = bytes; 0.00 : 197f: 49 89 b7 e0 00 00 00 mov %rsi,0xe0(%r15) : net_stats->tx_packets = packets; 0.00 : 1986: 49 89 8f d0 00 00 00 mov %rcx,0xd0(%r15) : { asm volatile("mov" size " %0,%1": :reg (val), \ : "m" (*(volatile type __force *)addr) barrier); } : : build_mmio_read(readb, "b", unsigned char, "=q", :"memory") : build_mmio_read(readw, "w", unsigned short, "=r", :"memory") : build_mmio_read(readl, "l", unsigned int, "=r", :"memory") 0.00 : 198d: 48 8b 93 80 0e 00 00 mov 0xe80(%rbx),%rdx : : hwstats->crcerrs += IXGBE_READ_REG(hw, IXGBE_CRCERRS); 0.00 : 1994: 48 8b 83 b0 14 00 00 mov 0x14b0(%rbx),%rax 0.00 : 199b: 48 81 c2 00 40 00 00 add $0x4000,%rdx 0.00 : 19a2: 8b 12 mov (%rdx),%edx 0.00 : 19a4: 89 d2 mov %edx,%edx 0.00 : 19a6: 48 89 df mov %rbx,%rdi 0.00 : 19a9: 48 89 d9 mov %rbx,%rcx 0.00 : 19ac: 48 01 c2 add %rax,%rdx 0.00 : 19af: 45 31 f6 xor %r14d,%r14d 0.00 : 19b2: 45 31 c9 xor %r9d,%r9d 0.00 : 19b5: 48 89 93 b0 14 00 00 mov %rdx,0x14b0(%rbx) 0.00 : 19bc: be a0 3f 00 00 mov $0x3fa0,%esi 0.00 : 19c1: 41 b8 34 60 00 00 mov $0x6034,%r8d 0.00 : 19c7: eb 4a jmp 1a13 0.00 : 19c9: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : missed_rx += mpc; : hwstats->mpc[i] += mpc; : total_mpc += hwstats->mpc[i]; : hwstats->pxontxc[i] += IXGBE_READ_REG(hw, IXGBE_PXONTXC(i)); : hwstats->pxofftxc[i] += IXGBE_READ_REG(hw, IXGBE_PXOFFTXC(i)); : switch (hw->mac.type) { 0.00 : 19d0: 72 28 jb 19fa 0.00 : 19d2: 83 f8 03 cmp $0x3,%eax 0.00 : 19d5: 77 23 ja 19fa 0.00 : 19d7: 48 8d 96 a0 01 00 00 lea 0x1a0(%rsi),%rdx : hwstats->pxonrxc[i] += : IXGBE_READ_REG(hw, IXGBE_PXONRXC(i)); : break; : case ixgbe_mac_82599EB: : case ixgbe_mac_X540: : hwstats->pxonrxc[i] += 0.00 : 19de: 48 8b 81 90 15 00 00 mov 0x1590(%rcx),%rax 0.00 : 19e5: 48 03 93 80 0e 00 00 add 0xe80(%rbx),%rdx 0.00 : 19ec: 8b 12 mov (%rdx),%edx ??:0 33.33 : 19ee: 89 d2 mov %edx,%edx 0.00 : 19f0: 48 01 c2 add %rax,%rdx 0.00 : 19f3: 48 89 91 90 15 00 00 mov %rdx,0x1590(%rcx) 0.00 : 19fa: 48 83 c6 04 add $0x4,%rsi 0.00 : 19fe: 48 83 c1 08 add $0x8,%rcx 0.00 : 1a02: 49 83 c0 40 add $0x40,%r8 : net_stats->tx_packets = packets; : : hwstats->crcerrs += IXGBE_READ_REG(hw, IXGBE_CRCERRS); : : /* 8 register reads */ : for (i = 0; i < 8; i++) { 0.00 : 1a06: 48 81 fe c0 3f 00 00 cmp $0x3fc0,%rsi 0.00 : 1a0d: 0f 84 35 08 00 00 je 2248 0.00 : 1a13: 48 89 f0 mov %rsi,%rax 0.00 : 1a16: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 1a1d: 8b 00 mov (%rax),%eax : /* for packet buffers not used, the register should read 0 */ : mpc = IXGBE_READ_REG(hw, IXGBE_MPC(i)); : missed_rx += mpc; 0.00 : 1a1f: 41 01 c1 add %eax,%r9d : hwstats->mpc[i] += mpc; 0.00 : 1a22: 89 c0 mov %eax,%eax 0.00 : 1a24: 48 03 81 d8 14 00 00 add 0x14d8(%rcx),%rax : total_mpc += hwstats->mpc[i]; : hwstats->pxontxc[i] += IXGBE_READ_REG(hw, IXGBE_PXONTXC(i)); 0.00 : 1a2b: 48 8b 91 50 15 00 00 mov 0x1550(%rcx),%rdx : /* 8 register reads */ : for (i = 0; i < 8; i++) { : /* for packet buffers not used, the register should read 0 */ : mpc = IXGBE_READ_REG(hw, IXGBE_MPC(i)); : missed_rx += mpc; : hwstats->mpc[i] += mpc; 0.00 : 1a32: 48 89 81 d8 14 00 00 mov %rax,0x14d8(%rcx) : total_mpc += hwstats->mpc[i]; 0.00 : 1a39: 49 01 c6 add %rax,%r14 0.00 : 1a3c: 48 8d 86 60 ff ff ff lea -0xa0(%rsi),%rax 0.00 : 1a43: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 1a4a: 8b 00 mov (%rax),%eax : hwstats->pxontxc[i] += IXGBE_READ_REG(hw, IXGBE_PXONTXC(i)); 0.00 : 1a4c: 89 c0 mov %eax,%eax 0.00 : 1a4e: 48 01 d0 add %rdx,%rax : hwstats->pxofftxc[i] += IXGBE_READ_REG(hw, IXGBE_PXOFFTXC(i)); 0.00 : 1a51: 48 8b 91 d0 15 00 00 mov 0x15d0(%rcx),%rdx : /* for packet buffers not used, the register should read 0 */ : mpc = IXGBE_READ_REG(hw, IXGBE_MPC(i)); : missed_rx += mpc; : hwstats->mpc[i] += mpc; : total_mpc += hwstats->mpc[i]; : hwstats->pxontxc[i] += IXGBE_READ_REG(hw, IXGBE_PXONTXC(i)); 0.00 : 1a58: 48 89 81 50 15 00 00 mov %rax,0x1550(%rcx) 0.00 : 1a5f: 48 8d 46 80 lea -0x80(%rsi),%rax 0.00 : 1a63: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 1a6a: 8b 00 mov (%rax),%eax : hwstats->pxofftxc[i] += IXGBE_READ_REG(hw, IXGBE_PXOFFTXC(i)); 0.00 : 1a6c: 89 c0 mov %eax,%eax 0.00 : 1a6e: 48 01 d0 add %rdx,%rax 0.00 : 1a71: 48 89 81 d0 15 00 00 mov %rax,0x15d0(%rcx) : switch (hw->mac.type) { 0.00 : 1a78: 8b 83 50 10 00 00 mov 0x1050(%rbx),%eax 0.00 : 1a7e: 83 f8 01 cmp $0x1,%eax 0.00 : 1a81: 0f 85 49 ff ff ff jne 19d0 0.00 : 1a87: 48 8d 46 20 lea 0x20(%rsi),%rax : case ixgbe_mac_82598EB: : hwstats->rnbc[i] += IXGBE_READ_REG(hw, IXGBE_RNBC(i)); 0.00 : 1a8b: 48 8b 91 b0 16 00 00 mov 0x16b0(%rcx),%rdx 0.00 : 1a92: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 1a99: 8b 00 mov (%rax),%eax 0.00 : 1a9b: 89 c0 mov %eax,%eax 0.00 : 1a9d: 48 01 d0 add %rdx,%rax : hwstats->qbtc[i] += IXGBE_READ_REG(hw, IXGBE_QBTC(i)); 0.00 : 1aa0: 48 8b 91 08 19 00 00 mov 0x1908(%rcx),%rdx : total_mpc += hwstats->mpc[i]; : hwstats->pxontxc[i] += IXGBE_READ_REG(hw, IXGBE_PXONTXC(i)); : hwstats->pxofftxc[i] += IXGBE_READ_REG(hw, IXGBE_PXOFFTXC(i)); : switch (hw->mac.type) { : case ixgbe_mac_82598EB: : hwstats->rnbc[i] += IXGBE_READ_REG(hw, IXGBE_RNBC(i)); 0.00 : 1aa7: 48 89 81 b0 16 00 00 mov %rax,0x16b0(%rcx) 0.00 : 1aae: 4c 89 c0 mov %r8,%rax 0.00 : 1ab1: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 1ab8: 8b 00 mov (%rax),%eax : hwstats->qbtc[i] += IXGBE_READ_REG(hw, IXGBE_QBTC(i)); 0.00 : 1aba: 89 c0 mov %eax,%eax 0.00 : 1abc: 48 01 d0 add %rdx,%rax : hwstats->qbrc[i] += IXGBE_READ_REG(hw, IXGBE_QBRC(i)); 0.00 : 1abf: 48 8b 91 88 18 00 00 mov 0x1888(%rcx),%rdx : hwstats->pxontxc[i] += IXGBE_READ_REG(hw, IXGBE_PXONTXC(i)); : hwstats->pxofftxc[i] += IXGBE_READ_REG(hw, IXGBE_PXOFFTXC(i)); : switch (hw->mac.type) { : case ixgbe_mac_82598EB: : hwstats->rnbc[i] += IXGBE_READ_REG(hw, IXGBE_RNBC(i)); : hwstats->qbtc[i] += IXGBE_READ_REG(hw, IXGBE_QBTC(i)); 0.00 : 1ac6: 48 89 81 08 19 00 00 mov %rax,0x1908(%rcx) 0.00 : 1acd: 49 8d 80 00 b0 ff ff lea -0x5000(%r8),%rax 0.00 : 1ad4: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 1adb: 8b 00 mov (%rax),%eax : hwstats->qbrc[i] += IXGBE_READ_REG(hw, IXGBE_QBRC(i)); 0.00 : 1add: 89 c0 mov %eax,%eax 0.00 : 1adf: 48 01 d0 add %rdx,%rax : hwstats->pxonrxc[i] += 0.00 : 1ae2: 48 8b 91 90 15 00 00 mov 0x1590(%rcx),%rdx : hwstats->pxofftxc[i] += IXGBE_READ_REG(hw, IXGBE_PXOFFTXC(i)); : switch (hw->mac.type) { : case ixgbe_mac_82598EB: : hwstats->rnbc[i] += IXGBE_READ_REG(hw, IXGBE_RNBC(i)); : hwstats->qbtc[i] += IXGBE_READ_REG(hw, IXGBE_QBTC(i)); : hwstats->qbrc[i] += IXGBE_READ_REG(hw, IXGBE_QBRC(i)); 0.00 : 1ae9: 48 89 81 88 18 00 00 mov %rax,0x1888(%rcx) 0.00 : 1af0: 48 8d 86 60 8f 00 00 lea 0x8f60(%rsi),%rax 0.00 : 1af7: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 1afe: 8b 00 mov (%rax),%eax : hwstats->pxonrxc[i] += 0.00 : 1b00: 89 c0 mov %eax,%eax 0.00 : 1b02: 48 01 d0 add %rdx,%rax 0.00 : 1b05: 48 89 81 90 15 00 00 mov %rax,0x1590(%rcx) : IXGBE_READ_REG(hw, IXGBE_PXONRXC(i)); : break; 0.00 : 1b0c: e9 e9 fe ff ff jmpq 19fa 0.00 : 1b11: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : struct ixgbe_hw *hw = &adapter->hw; : struct ixgbe_hw_stats *hwstats = &adapter->stats; : int i; : u32 data; : : if ((hw->fc.current_mode != ixgbe_fc_full) && 0.00 : 1b18: 8b 83 0c 13 00 00 mov 0x130c(%rbx),%eax 0.00 : 1b1e: 83 f8 03 cmp $0x3,%eax 0.00 : 1b21: 0f 84 1c 0c 00 00 je 2743 0.00 : 1b27: 83 e8 01 sub $0x1,%eax 0.00 : 1b2a: 0f 84 13 0c 00 00 je 2743 : hwstats->gprc -= missed_rx; : : ixgbe_update_xoff_received(adapter); : : /* 82598 hardware only has a 32 bit counter in the high register */ : switch (hw->mac.type) { 0.00 : 1b30: 8b 83 50 10 00 00 mov 0x1050(%rbx),%eax 0.00 : 1b36: 83 f8 02 cmp $0x2,%eax 0.00 : 1b39: 0f 84 7a 09 00 00 je 24b9 0.00 : 1b3f: 83 f8 03 cmp $0x3,%eax 0.00 : 1b42: 0f 84 e9 08 00 00 je 2431 0.00 : 1b48: 83 e8 01 sub $0x1,%eax 0.00 : 1b4b: 0f 85 88 00 00 00 jne 1bd9 0.00 : 1b51: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : case ixgbe_mac_82598EB: : hwstats->lxonrxc += IXGBE_READ_REG(hw, IXGBE_LXONRXC); 0.00 : 1b58: 48 8b 93 38 15 00 00 mov 0x1538(%rbx),%rdx 0.00 : 1b5f: 48 05 60 cf 00 00 add $0xcf60,%rax 0.00 : 1b65: 8b 00 mov (%rax),%eax 0.00 : 1b67: 89 c0 mov %eax,%eax 0.00 : 1b69: 48 01 d0 add %rdx,%rax : hwstats->gorc += IXGBE_READ_REG(hw, IXGBE_GORCH); 0.00 : 1b6c: 48 8b 93 a0 16 00 00 mov 0x16a0(%rbx),%rdx : ixgbe_update_xoff_received(adapter); : : /* 82598 hardware only has a 32 bit counter in the high register */ : switch (hw->mac.type) { : case ixgbe_mac_82598EB: : hwstats->lxonrxc += IXGBE_READ_REG(hw, IXGBE_LXONRXC); 0.00 : 1b73: 48 89 83 38 15 00 00 mov %rax,0x1538(%rbx) 0.00 : 1b7a: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1b81: 48 05 8c 40 00 00 add $0x408c,%rax 0.00 : 1b87: 8b 00 mov (%rax),%eax : hwstats->gorc += IXGBE_READ_REG(hw, IXGBE_GORCH); 0.00 : 1b89: 89 c0 mov %eax,%eax 0.00 : 1b8b: 48 01 d0 add %rdx,%rax : hwstats->gotc += IXGBE_READ_REG(hw, IXGBE_GOTCH); 0.00 : 1b8e: 48 8b 93 a8 16 00 00 mov 0x16a8(%rbx),%rdx : : /* 82598 hardware only has a 32 bit counter in the high register */ : switch (hw->mac.type) { : case ixgbe_mac_82598EB: : hwstats->lxonrxc += IXGBE_READ_REG(hw, IXGBE_LXONRXC); : hwstats->gorc += IXGBE_READ_REG(hw, IXGBE_GORCH); 0.00 : 1b95: 48 89 83 a0 16 00 00 mov %rax,0x16a0(%rbx) 0.00 : 1b9c: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1ba3: 48 05 94 40 00 00 add $0x4094,%rax 0.00 : 1ba9: 8b 00 mov (%rax),%eax : hwstats->gotc += IXGBE_READ_REG(hw, IXGBE_GOTCH); 0.00 : 1bab: 89 c0 mov %eax,%eax 0.00 : 1bad: 48 01 d0 add %rdx,%rax : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORH); 0.00 : 1bb0: 48 8b 93 28 17 00 00 mov 0x1728(%rbx),%rdx : /* 82598 hardware only has a 32 bit counter in the high register */ : switch (hw->mac.type) { : case ixgbe_mac_82598EB: : hwstats->lxonrxc += IXGBE_READ_REG(hw, IXGBE_LXONRXC); : hwstats->gorc += IXGBE_READ_REG(hw, IXGBE_GORCH); : hwstats->gotc += IXGBE_READ_REG(hw, IXGBE_GOTCH); 0.00 : 1bb7: 48 89 83 a8 16 00 00 mov %rax,0x16a8(%rbx) 0.00 : 1bbe: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1bc5: 48 05 c4 40 00 00 add $0x40c4,%rax 0.00 : 1bcb: 8b 00 mov (%rax),%eax : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORH); 0.00 : 1bcd: 89 c0 mov %eax,%eax 0.00 : 1bcf: 48 01 d0 add %rdx,%rax 0.00 : 1bd2: 48 89 83 28 17 00 00 mov %rax,0x1728(%rbx) 0.00 : 1bd9: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1be0: 48 05 78 40 00 00 add $0x4078,%rax 0.00 : 1be6: 8b 00 mov (%rax),%eax : break; : default: : break; : } : bprc = IXGBE_READ_REG(hw, IXGBE_BPRC); : hwstats->bprc += bprc; 0.00 : 1be8: 89 c1 mov %eax,%ecx 0.00 : 1bea: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1bf1: 48 01 8b 88 16 00 00 add %rcx,0x1688(%rbx) : hwstats->mprc += IXGBE_READ_REG(hw, IXGBE_MPRC); 0.00 : 1bf8: 48 8b 93 90 16 00 00 mov 0x1690(%rbx),%rdx 0.00 : 1bff: 48 05 7c 40 00 00 add $0x407c,%rax 0.00 : 1c05: 8b 00 mov (%rax),%eax 0.00 : 1c07: 89 c0 mov %eax,%eax 0.00 : 1c09: 48 01 d0 add %rdx,%rax : if (hw->mac.type == ixgbe_mac_82598EB) 0.00 : 1c0c: 83 bb 50 10 00 00 01 cmpl $0x1,0x1050(%rbx) : default: : break; : } : bprc = IXGBE_READ_REG(hw, IXGBE_BPRC); : hwstats->bprc += bprc; : hwstats->mprc += IXGBE_READ_REG(hw, IXGBE_MPRC); 0.00 : 1c13: 48 89 83 90 16 00 00 mov %rax,0x1690(%rbx) : if (hw->mac.type == ixgbe_mac_82598EB) 0.00 : 1c1a: 0f 84 84 0b 00 00 je 27a4 0.00 : 1c20: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : hwstats->mprc -= bprc; : hwstats->roc += IXGBE_READ_REG(hw, IXGBE_ROC); 0.00 : 1c27: 48 8b 93 00 17 00 00 mov 0x1700(%rbx),%rdx 0.00 : 1c2e: 48 05 ac 40 00 00 add $0x40ac,%rax 0.00 : 1c34: 8b 00 mov (%rax),%eax 0.00 : 1c36: 89 c0 mov %eax,%eax 0.00 : 1c38: 48 01 d0 add %rdx,%rax : hwstats->prc64 += IXGBE_READ_REG(hw, IXGBE_PRC64); 0.00 : 1c3b: 48 8b 93 50 16 00 00 mov 0x1650(%rbx),%rdx : bprc = IXGBE_READ_REG(hw, IXGBE_BPRC); : hwstats->bprc += bprc; : hwstats->mprc += IXGBE_READ_REG(hw, IXGBE_MPRC); : if (hw->mac.type == ixgbe_mac_82598EB) : hwstats->mprc -= bprc; : hwstats->roc += IXGBE_READ_REG(hw, IXGBE_ROC); 0.00 : 1c42: 48 89 83 00 17 00 00 mov %rax,0x1700(%rbx) 0.00 : 1c49: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1c50: 48 05 5c 40 00 00 add $0x405c,%rax 0.00 : 1c56: 8b 00 mov (%rax),%eax : hwstats->prc64 += IXGBE_READ_REG(hw, IXGBE_PRC64); 0.00 : 1c58: 89 c0 mov %eax,%eax 0.00 : 1c5a: 48 01 d0 add %rdx,%rax : hwstats->prc127 += IXGBE_READ_REG(hw, IXGBE_PRC127); 0.00 : 1c5d: 48 8b 93 58 16 00 00 mov 0x1658(%rbx),%rdx : hwstats->bprc += bprc; : hwstats->mprc += IXGBE_READ_REG(hw, IXGBE_MPRC); : if (hw->mac.type == ixgbe_mac_82598EB) : hwstats->mprc -= bprc; : hwstats->roc += IXGBE_READ_REG(hw, IXGBE_ROC); : hwstats->prc64 += IXGBE_READ_REG(hw, IXGBE_PRC64); 0.00 : 1c64: 48 89 83 50 16 00 00 mov %rax,0x1650(%rbx) 0.00 : 1c6b: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1c72: 48 05 60 40 00 00 add $0x4060,%rax 0.00 : 1c78: 8b 00 mov (%rax),%eax : hwstats->prc127 += IXGBE_READ_REG(hw, IXGBE_PRC127); 0.00 : 1c7a: 89 c0 mov %eax,%eax 0.00 : 1c7c: 48 01 d0 add %rdx,%rax : hwstats->prc255 += IXGBE_READ_REG(hw, IXGBE_PRC255); 0.00 : 1c7f: 48 8b 93 60 16 00 00 mov 0x1660(%rbx),%rdx : hwstats->mprc += IXGBE_READ_REG(hw, IXGBE_MPRC); : if (hw->mac.type == ixgbe_mac_82598EB) : hwstats->mprc -= bprc; : hwstats->roc += IXGBE_READ_REG(hw, IXGBE_ROC); : hwstats->prc64 += IXGBE_READ_REG(hw, IXGBE_PRC64); : hwstats->prc127 += IXGBE_READ_REG(hw, IXGBE_PRC127); 0.00 : 1c86: 48 89 83 58 16 00 00 mov %rax,0x1658(%rbx) 0.00 : 1c8d: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1c94: 48 05 64 40 00 00 add $0x4064,%rax 0.00 : 1c9a: 8b 00 mov (%rax),%eax : hwstats->prc255 += IXGBE_READ_REG(hw, IXGBE_PRC255); 0.00 : 1c9c: 89 c0 mov %eax,%eax 0.00 : 1c9e: 48 01 d0 add %rdx,%rax : hwstats->prc511 += IXGBE_READ_REG(hw, IXGBE_PRC511); 0.00 : 1ca1: 48 8b 93 68 16 00 00 mov 0x1668(%rbx),%rdx : if (hw->mac.type == ixgbe_mac_82598EB) : hwstats->mprc -= bprc; : hwstats->roc += IXGBE_READ_REG(hw, IXGBE_ROC); : hwstats->prc64 += IXGBE_READ_REG(hw, IXGBE_PRC64); : hwstats->prc127 += IXGBE_READ_REG(hw, IXGBE_PRC127); : hwstats->prc255 += IXGBE_READ_REG(hw, IXGBE_PRC255); 0.00 : 1ca8: 48 89 83 60 16 00 00 mov %rax,0x1660(%rbx) 0.00 : 1caf: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1cb6: 48 05 68 40 00 00 add $0x4068,%rax 0.00 : 1cbc: 8b 00 mov (%rax),%eax : hwstats->prc511 += IXGBE_READ_REG(hw, IXGBE_PRC511); 0.00 : 1cbe: 89 c0 mov %eax,%eax 0.00 : 1cc0: 48 01 d0 add %rdx,%rax : hwstats->prc1023 += IXGBE_READ_REG(hw, IXGBE_PRC1023); 0.00 : 1cc3: 48 8b 93 70 16 00 00 mov 0x1670(%rbx),%rdx : hwstats->mprc -= bprc; : hwstats->roc += IXGBE_READ_REG(hw, IXGBE_ROC); : hwstats->prc64 += IXGBE_READ_REG(hw, IXGBE_PRC64); : hwstats->prc127 += IXGBE_READ_REG(hw, IXGBE_PRC127); : hwstats->prc255 += IXGBE_READ_REG(hw, IXGBE_PRC255); : hwstats->prc511 += IXGBE_READ_REG(hw, IXGBE_PRC511); 0.00 : 1cca: 48 89 83 68 16 00 00 mov %rax,0x1668(%rbx) 0.00 : 1cd1: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1cd8: 48 05 6c 40 00 00 add $0x406c,%rax 0.00 : 1cde: 8b 00 mov (%rax),%eax : hwstats->prc1023 += IXGBE_READ_REG(hw, IXGBE_PRC1023); 0.00 : 1ce0: 89 c0 mov %eax,%eax 0.00 : 1ce2: 48 01 d0 add %rdx,%rax : hwstats->prc1522 += IXGBE_READ_REG(hw, IXGBE_PRC1522); 0.00 : 1ce5: 48 8b 93 78 16 00 00 mov 0x1678(%rbx),%rdx : hwstats->roc += IXGBE_READ_REG(hw, IXGBE_ROC); : hwstats->prc64 += IXGBE_READ_REG(hw, IXGBE_PRC64); : hwstats->prc127 += IXGBE_READ_REG(hw, IXGBE_PRC127); : hwstats->prc255 += IXGBE_READ_REG(hw, IXGBE_PRC255); : hwstats->prc511 += IXGBE_READ_REG(hw, IXGBE_PRC511); : hwstats->prc1023 += IXGBE_READ_REG(hw, IXGBE_PRC1023); 0.00 : 1cec: 48 89 83 70 16 00 00 mov %rax,0x1670(%rbx) 0.00 : 1cf3: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1cfa: 48 05 70 40 00 00 add $0x4070,%rax 0.00 : 1d00: 8b 00 mov (%rax),%eax : hwstats->prc1522 += IXGBE_READ_REG(hw, IXGBE_PRC1522); 0.00 : 1d02: 89 c0 mov %eax,%eax 0.00 : 1d04: 48 01 d0 add %rdx,%rax : hwstats->rlec += IXGBE_READ_REG(hw, IXGBE_RLEC); 0.00 : 1d07: 48 8b 93 28 15 00 00 mov 0x1528(%rbx),%rdx : hwstats->prc64 += IXGBE_READ_REG(hw, IXGBE_PRC64); : hwstats->prc127 += IXGBE_READ_REG(hw, IXGBE_PRC127); : hwstats->prc255 += IXGBE_READ_REG(hw, IXGBE_PRC255); : hwstats->prc511 += IXGBE_READ_REG(hw, IXGBE_PRC511); : hwstats->prc1023 += IXGBE_READ_REG(hw, IXGBE_PRC1023); : hwstats->prc1522 += IXGBE_READ_REG(hw, IXGBE_PRC1522); 0.00 : 1d0e: 48 89 83 78 16 00 00 mov %rax,0x1678(%rbx) 0.00 : 1d15: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1d1c: 48 05 40 40 00 00 add $0x4040,%rax 0.00 : 1d22: 8b 00 mov (%rax),%eax : hwstats->rlec += IXGBE_READ_REG(hw, IXGBE_RLEC); 0.00 : 1d24: 89 c0 mov %eax,%eax 0.00 : 1d26: 48 01 d0 add %rdx,%rax 0.00 : 1d29: 48 89 83 28 15 00 00 mov %rax,0x1528(%rbx) 0.00 : 1d30: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1d37: 48 05 60 3f 00 00 add $0x3f60,%rax 0.00 : 1d3d: 8b 30 mov (%rax),%esi : lxon = IXGBE_READ_REG(hw, IXGBE_LXONTXC); : hwstats->lxontxc += lxon; 0.00 : 1d3f: 89 f0 mov %esi,%eax 0.00 : 1d41: 48 01 83 30 15 00 00 add %rax,0x1530(%rbx) 0.00 : 1d48: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1d4f: 48 05 68 3f 00 00 add $0x3f68,%rax 0.00 : 1d55: 8b 10 mov (%rax),%edx : lxoff = IXGBE_READ_REG(hw, IXGBE_LXOFFTXC); : hwstats->lxofftxc += lxoff; 0.00 : 1d57: 89 d0 mov %edx,%eax 0.00 : 1d59: 48 01 83 40 15 00 00 add %rax,0x1540(%rbx) 0.00 : 1d60: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : hwstats->gptc += IXGBE_READ_REG(hw, IXGBE_GPTC); 0.00 : 1d67: 48 8b 8b 98 16 00 00 mov 0x1698(%rbx),%rcx 0.00 : 1d6e: 48 05 80 40 00 00 add $0x4080,%rax 0.00 : 1d74: 8b 00 mov (%rax),%eax 0.00 : 1d76: 89 c0 mov %eax,%eax 0.00 : 1d78: 48 01 c8 add %rcx,%rax : hwstats->mptc += IXGBE_READ_REG(hw, IXGBE_MPTC); 0.00 : 1d7b: 48 8b 8b 70 17 00 00 mov 0x1770(%rbx),%rcx : hwstats->rlec += IXGBE_READ_REG(hw, IXGBE_RLEC); : lxon = IXGBE_READ_REG(hw, IXGBE_LXONTXC); : hwstats->lxontxc += lxon; : lxoff = IXGBE_READ_REG(hw, IXGBE_LXOFFTXC); : hwstats->lxofftxc += lxoff; : hwstats->gptc += IXGBE_READ_REG(hw, IXGBE_GPTC); 0.00 : 1d82: 48 89 83 98 16 00 00 mov %rax,0x1698(%rbx) 0.00 : 1d89: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1d90: 48 05 f0 40 00 00 add $0x40f0,%rax 0.00 : 1d96: 8b 00 mov (%rax),%eax : hwstats->mptc += IXGBE_READ_REG(hw, IXGBE_MPTC); 0.00 : 1d98: 89 c0 mov %eax,%eax : /* : * 82598 errata - tx of flow control packets is included in tx counters : */ : xon_off_tot = lxon + lxoff; 0.00 : 1d9a: 01 f2 add %esi,%edx : lxon = IXGBE_READ_REG(hw, IXGBE_LXONTXC); : hwstats->lxontxc += lxon; : lxoff = IXGBE_READ_REG(hw, IXGBE_LXOFFTXC); : hwstats->lxofftxc += lxoff; : hwstats->gptc += IXGBE_READ_REG(hw, IXGBE_GPTC); : hwstats->mptc += IXGBE_READ_REG(hw, IXGBE_MPTC); 0.00 : 1d9c: 48 01 c8 add %rcx,%rax : /* : * 82598 errata - tx of flow control packets is included in tx counters : */ : xon_off_tot = lxon + lxoff; : hwstats->gptc -= xon_off_tot; 0.00 : 1d9f: 89 d1 mov %edx,%ecx : hwstats->mptc -= xon_off_tot; : hwstats->gotc -= (xon_off_tot * (ETH_ZLEN + ETH_FCS_LEN)); 0.00 : 1da1: c1 e2 06 shl $0x6,%edx : lxon = IXGBE_READ_REG(hw, IXGBE_LXONTXC); : hwstats->lxontxc += lxon; : lxoff = IXGBE_READ_REG(hw, IXGBE_LXOFFTXC); : hwstats->lxofftxc += lxoff; : hwstats->gptc += IXGBE_READ_REG(hw, IXGBE_GPTC); : hwstats->mptc += IXGBE_READ_REG(hw, IXGBE_MPTC); 0.00 : 1da4: 48 89 83 70 17 00 00 mov %rax,0x1770(%rbx) 0.00 : 1dab: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : * 82598 errata - tx of flow control packets is included in tx counters : */ : xon_off_tot = lxon + lxoff; : hwstats->gptc -= xon_off_tot; : hwstats->mptc -= xon_off_tot; : hwstats->gotc -= (xon_off_tot * (ETH_ZLEN + ETH_FCS_LEN)); 0.00 : 1db2: 89 d2 mov %edx,%edx : hwstats->mptc += IXGBE_READ_REG(hw, IXGBE_MPTC); : /* : * 82598 errata - tx of flow control packets is included in tx counters : */ : xon_off_tot = lxon + lxoff; : hwstats->gptc -= xon_off_tot; 0.00 : 1db4: 48 29 8b 98 16 00 00 sub %rcx,0x1698(%rbx) : hwstats->mptc -= xon_off_tot; : hwstats->gotc -= (xon_off_tot * (ETH_ZLEN + ETH_FCS_LEN)); 0.00 : 1dbb: 48 29 93 a8 16 00 00 sub %rdx,0x16a8(%rbx) : /* : * 82598 errata - tx of flow control packets is included in tx counters : */ : xon_off_tot = lxon + lxoff; : hwstats->gptc -= xon_off_tot; : hwstats->mptc -= xon_off_tot; 0.00 : 1dc2: 48 29 8b 70 17 00 00 sub %rcx,0x1770(%rbx) : hwstats->gotc -= (xon_off_tot * (ETH_ZLEN + ETH_FCS_LEN)); : hwstats->ruc += IXGBE_READ_REG(hw, IXGBE_RUC); 0.00 : 1dc9: 48 8b 93 f0 16 00 00 mov 0x16f0(%rbx),%rdx 0.00 : 1dd0: 48 05 a4 40 00 00 add $0x40a4,%rax 0.00 : 1dd6: 8b 00 mov (%rax),%eax 0.00 : 1dd8: 89 c0 mov %eax,%eax 0.00 : 1dda: 48 01 d0 add %rdx,%rax : hwstats->rfc += IXGBE_READ_REG(hw, IXGBE_RFC); 0.00 : 1ddd: 48 8b 93 f8 16 00 00 mov 0x16f8(%rbx),%rdx : */ : xon_off_tot = lxon + lxoff; : hwstats->gptc -= xon_off_tot; : hwstats->mptc -= xon_off_tot; : hwstats->gotc -= (xon_off_tot * (ETH_ZLEN + ETH_FCS_LEN)); : hwstats->ruc += IXGBE_READ_REG(hw, IXGBE_RUC); 0.00 : 1de4: 48 89 83 f0 16 00 00 mov %rax,0x16f0(%rbx) 0.00 : 1deb: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1df2: 48 05 a8 40 00 00 add $0x40a8,%rax 0.00 : 1df8: 8b 00 mov (%rax),%eax : hwstats->rfc += IXGBE_READ_REG(hw, IXGBE_RFC); 0.00 : 1dfa: 89 c0 mov %eax,%eax 0.00 : 1dfc: 48 01 d0 add %rdx,%rax : hwstats->rjc += IXGBE_READ_REG(hw, IXGBE_RJC); 0.00 : 1dff: 48 8b 93 08 17 00 00 mov 0x1708(%rbx),%rdx : xon_off_tot = lxon + lxoff; : hwstats->gptc -= xon_off_tot; : hwstats->mptc -= xon_off_tot; : hwstats->gotc -= (xon_off_tot * (ETH_ZLEN + ETH_FCS_LEN)); : hwstats->ruc += IXGBE_READ_REG(hw, IXGBE_RUC); : hwstats->rfc += IXGBE_READ_REG(hw, IXGBE_RFC); 0.00 : 1e06: 48 89 83 f8 16 00 00 mov %rax,0x16f8(%rbx) 0.00 : 1e0d: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1e14: 48 05 b0 40 00 00 add $0x40b0,%rax 0.00 : 1e1a: 8b 00 mov (%rax),%eax : hwstats->rjc += IXGBE_READ_REG(hw, IXGBE_RJC); 0.00 : 1e1c: 89 c0 mov %eax,%eax 0.00 : 1e1e: 48 01 d0 add %rdx,%rax : hwstats->tpr += IXGBE_READ_REG(hw, IXGBE_TPR); 0.00 : 1e21: 48 8b 93 30 17 00 00 mov 0x1730(%rbx),%rdx : hwstats->gptc -= xon_off_tot; : hwstats->mptc -= xon_off_tot; : hwstats->gotc -= (xon_off_tot * (ETH_ZLEN + ETH_FCS_LEN)); : hwstats->ruc += IXGBE_READ_REG(hw, IXGBE_RUC); : hwstats->rfc += IXGBE_READ_REG(hw, IXGBE_RFC); : hwstats->rjc += IXGBE_READ_REG(hw, IXGBE_RJC); 0.00 : 1e28: 48 89 83 08 17 00 00 mov %rax,0x1708(%rbx) 0.00 : 1e2f: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1e36: 48 05 d0 40 00 00 add $0x40d0,%rax 0.00 : 1e3c: 8b 00 mov (%rax),%eax : hwstats->tpr += IXGBE_READ_REG(hw, IXGBE_TPR); 0.00 : 1e3e: 89 c0 mov %eax,%eax 0.00 : 1e40: 48 01 d0 add %rdx,%rax : hwstats->ptc64 += IXGBE_READ_REG(hw, IXGBE_PTC64); 0.00 : 1e43: 48 8b 93 40 17 00 00 mov 0x1740(%rbx),%rdx : hwstats->mptc -= xon_off_tot; : hwstats->gotc -= (xon_off_tot * (ETH_ZLEN + ETH_FCS_LEN)); : hwstats->ruc += IXGBE_READ_REG(hw, IXGBE_RUC); : hwstats->rfc += IXGBE_READ_REG(hw, IXGBE_RFC); : hwstats->rjc += IXGBE_READ_REG(hw, IXGBE_RJC); : hwstats->tpr += IXGBE_READ_REG(hw, IXGBE_TPR); 0.00 : 1e4a: 48 89 83 30 17 00 00 mov %rax,0x1730(%rbx) 0.00 : 1e51: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1e58: 48 05 d8 40 00 00 add $0x40d8,%rax 0.00 : 1e5e: 8b 00 mov (%rax),%eax : hwstats->ptc64 += IXGBE_READ_REG(hw, IXGBE_PTC64); : hwstats->ptc64 -= xon_off_tot; 0.00 : 1e60: 89 c0 mov %eax,%eax 0.00 : 1e62: 48 01 d0 add %rdx,%rax : hwstats->ptc127 += IXGBE_READ_REG(hw, IXGBE_PTC127); 0.00 : 1e65: 48 8b 93 48 17 00 00 mov 0x1748(%rbx),%rdx : hwstats->ruc += IXGBE_READ_REG(hw, IXGBE_RUC); : hwstats->rfc += IXGBE_READ_REG(hw, IXGBE_RFC); : hwstats->rjc += IXGBE_READ_REG(hw, IXGBE_RJC); : hwstats->tpr += IXGBE_READ_REG(hw, IXGBE_TPR); : hwstats->ptc64 += IXGBE_READ_REG(hw, IXGBE_PTC64); : hwstats->ptc64 -= xon_off_tot; 0.00 : 1e6c: 48 29 c8 sub %rcx,%rax 0.00 : 1e6f: 48 89 83 40 17 00 00 mov %rax,0x1740(%rbx) 0.00 : 1e76: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1e7d: 48 05 dc 40 00 00 add $0x40dc,%rax 0.00 : 1e83: 8b 00 mov (%rax),%eax : hwstats->ptc127 += IXGBE_READ_REG(hw, IXGBE_PTC127); 0.00 : 1e85: 89 c0 mov %eax,%eax 0.00 : 1e87: 48 01 d0 add %rdx,%rax : hwstats->ptc255 += IXGBE_READ_REG(hw, IXGBE_PTC255); 0.00 : 1e8a: 48 8b 93 50 17 00 00 mov 0x1750(%rbx),%rdx : hwstats->rfc += IXGBE_READ_REG(hw, IXGBE_RFC); : hwstats->rjc += IXGBE_READ_REG(hw, IXGBE_RJC); : hwstats->tpr += IXGBE_READ_REG(hw, IXGBE_TPR); : hwstats->ptc64 += IXGBE_READ_REG(hw, IXGBE_PTC64); : hwstats->ptc64 -= xon_off_tot; : hwstats->ptc127 += IXGBE_READ_REG(hw, IXGBE_PTC127); 0.00 : 1e91: 48 89 83 48 17 00 00 mov %rax,0x1748(%rbx) 0.00 : 1e98: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1e9f: 48 05 e0 40 00 00 add $0x40e0,%rax 0.00 : 1ea5: 8b 00 mov (%rax),%eax : hwstats->ptc255 += IXGBE_READ_REG(hw, IXGBE_PTC255); 0.00 : 1ea7: 89 c0 mov %eax,%eax 0.00 : 1ea9: 48 01 d0 add %rdx,%rax : hwstats->ptc511 += IXGBE_READ_REG(hw, IXGBE_PTC511); 0.00 : 1eac: 48 8b 93 58 17 00 00 mov 0x1758(%rbx),%rdx : hwstats->rjc += IXGBE_READ_REG(hw, IXGBE_RJC); : hwstats->tpr += IXGBE_READ_REG(hw, IXGBE_TPR); : hwstats->ptc64 += IXGBE_READ_REG(hw, IXGBE_PTC64); : hwstats->ptc64 -= xon_off_tot; : hwstats->ptc127 += IXGBE_READ_REG(hw, IXGBE_PTC127); : hwstats->ptc255 += IXGBE_READ_REG(hw, IXGBE_PTC255); 0.00 : 1eb3: 48 89 83 50 17 00 00 mov %rax,0x1750(%rbx) 0.00 : 1eba: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1ec1: 48 05 e4 40 00 00 add $0x40e4,%rax 0.00 : 1ec7: 8b 00 mov (%rax),%eax : hwstats->ptc511 += IXGBE_READ_REG(hw, IXGBE_PTC511); 0.00 : 1ec9: 89 c0 mov %eax,%eax 0.00 : 1ecb: 48 01 d0 add %rdx,%rax : hwstats->ptc1023 += IXGBE_READ_REG(hw, IXGBE_PTC1023); 0.00 : 1ece: 48 8b 93 60 17 00 00 mov 0x1760(%rbx),%rdx : hwstats->tpr += IXGBE_READ_REG(hw, IXGBE_TPR); : hwstats->ptc64 += IXGBE_READ_REG(hw, IXGBE_PTC64); : hwstats->ptc64 -= xon_off_tot; : hwstats->ptc127 += IXGBE_READ_REG(hw, IXGBE_PTC127); : hwstats->ptc255 += IXGBE_READ_REG(hw, IXGBE_PTC255); : hwstats->ptc511 += IXGBE_READ_REG(hw, IXGBE_PTC511); 0.00 : 1ed5: 48 89 83 58 17 00 00 mov %rax,0x1758(%rbx) 0.00 : 1edc: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1ee3: 48 05 e8 40 00 00 add $0x40e8,%rax 0.00 : 1ee9: 8b 00 mov (%rax),%eax : hwstats->ptc1023 += IXGBE_READ_REG(hw, IXGBE_PTC1023); 0.00 : 1eeb: 89 c0 mov %eax,%eax 0.00 : 1eed: 48 01 d0 add %rdx,%rax : hwstats->ptc1522 += IXGBE_READ_REG(hw, IXGBE_PTC1522); 0.00 : 1ef0: 48 8b 93 68 17 00 00 mov 0x1768(%rbx),%rdx : hwstats->ptc64 += IXGBE_READ_REG(hw, IXGBE_PTC64); : hwstats->ptc64 -= xon_off_tot; : hwstats->ptc127 += IXGBE_READ_REG(hw, IXGBE_PTC127); : hwstats->ptc255 += IXGBE_READ_REG(hw, IXGBE_PTC255); : hwstats->ptc511 += IXGBE_READ_REG(hw, IXGBE_PTC511); : hwstats->ptc1023 += IXGBE_READ_REG(hw, IXGBE_PTC1023); 0.00 : 1ef7: 48 89 83 60 17 00 00 mov %rax,0x1760(%rbx) 0.00 : 1efe: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1f05: 48 05 ec 40 00 00 add $0x40ec,%rax 0.00 : 1f0b: 8b 00 mov (%rax),%eax : hwstats->ptc1522 += IXGBE_READ_REG(hw, IXGBE_PTC1522); 0.00 : 1f0d: 89 c0 mov %eax,%eax 0.00 : 1f0f: 48 01 d0 add %rdx,%rax : hwstats->bptc += IXGBE_READ_REG(hw, IXGBE_BPTC); 0.00 : 1f12: 48 8b 93 78 17 00 00 mov 0x1778(%rbx),%rdx : hwstats->ptc64 -= xon_off_tot; : hwstats->ptc127 += IXGBE_READ_REG(hw, IXGBE_PTC127); : hwstats->ptc255 += IXGBE_READ_REG(hw, IXGBE_PTC255); : hwstats->ptc511 += IXGBE_READ_REG(hw, IXGBE_PTC511); : hwstats->ptc1023 += IXGBE_READ_REG(hw, IXGBE_PTC1023); : hwstats->ptc1522 += IXGBE_READ_REG(hw, IXGBE_PTC1522); 0.00 : 1f19: 48 89 83 68 17 00 00 mov %rax,0x1768(%rbx) 0.00 : 1f20: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 1f27: 48 05 f4 40 00 00 add $0x40f4,%rax 0.00 : 1f2d: 8b 00 mov (%rax),%eax : hwstats->bptc += IXGBE_READ_REG(hw, IXGBE_BPTC); 0.00 : 1f2f: 89 c0 mov %eax,%eax 0.00 : 1f31: 48 01 d0 add %rdx,%rax 0.00 : 1f34: 48 89 83 78 17 00 00 mov %rax,0x1778(%rbx) : /* Fill out the OS statistics structure */ : net_stats->multicast = hwstats->mprc; 0.00 : 1f3b: 48 8b 83 90 16 00 00 mov 0x1690(%rbx),%rax 0.00 : 1f42: 49 89 87 08 01 00 00 mov %rax,0x108(%r15) : : /* Rx Errors */ : net_stats->rx_errors = hwstats->crcerrs + 0.00 : 1f49: 48 8b 83 28 15 00 00 mov 0x1528(%rbx),%rax 0.00 : 1f50: 48 03 83 b0 14 00 00 add 0x14b0(%rbx),%rax : hwstats->rlec; : net_stats->rx_dropped = 0; 0.00 : 1f57: 49 c7 87 f8 00 00 00 movq $0x0,0xf8(%r15) 0.00 : 1f5e: 00 00 00 00 : hwstats->bptc += IXGBE_READ_REG(hw, IXGBE_BPTC); : /* Fill out the OS statistics structure */ : net_stats->multicast = hwstats->mprc; : : /* Rx Errors */ : net_stats->rx_errors = hwstats->crcerrs + 0.00 : 1f62: 49 89 87 e8 00 00 00 mov %rax,0xe8(%r15) : hwstats->rlec; : net_stats->rx_dropped = 0; : net_stats->rx_length_errors = hwstats->rlec; 0.00 : 1f69: 48 8b 83 28 15 00 00 mov 0x1528(%rbx),%rax 0.00 : 1f70: 49 89 87 18 01 00 00 mov %rax,0x118(%r15) : net_stats->rx_crc_errors = hwstats->crcerrs; 0.00 : 1f77: 48 8b 83 b0 14 00 00 mov 0x14b0(%rbx),%rax : net_stats->rx_missed_errors = total_mpc; 0.00 : 1f7e: 4d 89 b7 40 01 00 00 mov %r14,0x140(%r15) : /* Rx Errors */ : net_stats->rx_errors = hwstats->crcerrs + : hwstats->rlec; : net_stats->rx_dropped = 0; : net_stats->rx_length_errors = hwstats->rlec; : net_stats->rx_crc_errors = hwstats->crcerrs; 0.00 : 1f85: 49 89 87 28 01 00 00 mov %rax,0x128(%r15) 0.00 : 1f8c: 48 8b 83 10 02 00 00 mov 0x210(%rbx),%rax : /* : * VF Stats Collection - skip while resetting because these : * are not clear on read and otherwise you'll sometimes get : * crazy values. : */ : if (!test_bit(__IXGBE_RESETTING, &adapter->state)) { 0.00 : 1f93: a8 02 test $0x2,%al 0.00 : 1f95: 0f 85 45 02 00 00 jne 21e0 : for (i = 0; i < adapter->num_vfs; i++) { 0.00 : 1f9b: 8b 83 58 7c 00 00 mov 0x7c58(%rbx),%eax 0.00 : 1fa1: 85 c0 test %eax,%eax 0.00 : 1fa3: 0f 84 37 02 00 00 je 21e0 0.00 : 1fa9: 45 31 c9 xor %r9d,%r9d 0.00 : 1fac: bf 1c 10 00 00 mov $0x101c,%edi 0.00 : 1fb1: 41 b8 00 84 00 00 mov $0x8400,%r8d 0.00 : 1fb7: 41 ba 00 83 00 00 mov $0x8300,%r10d : UPDATE_VF_COUNTER_32bit(IXGBE_PVFGPRC(i), \ 0.00 : 1fbd: 48 bd 00 00 00 00 01 movabs $0x100000000,%rbp 0.00 : 1fc4: 00 00 00 0.00 : 1fc7: 49 bb 00 00 00 00 ff movabs $0xffffffff00000000,%r11 0.00 : 1fce: ff ff ff : adapter->vfinfo[i].last_vfstats.gprc, \ : adapter->vfinfo[i].vfstats.gprc); : UPDATE_VF_COUNTER_32bit(IXGBE_PVFGPTC(i), \ : adapter->vfinfo[i].last_vfstats.gptc, \ : adapter->vfinfo[i].vfstats.gptc); : UPDATE_VF_COUNTER_36bit(IXGBE_PVFGORC_LSB(i), \ 0.00 : 1fd1: 49 bd 00 00 00 00 10 movabs $0x1000000000,%r13 0.00 : 1fd8: 00 00 00 0.00 : 1fdb: 49 bc 00 00 00 00 f0 movabs $0xfffffff000000000,%r12 0.00 : 1fe2: ff ff ff 0.00 : 1fe5: 0f 1f 00 nopl (%rax) 0.00 : 1fe8: 89 f8 mov %edi,%eax 0.00 : 1fea: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 1ff1: 8b 00 mov (%rax),%eax : * are not clear on read and otherwise you'll sometimes get : * crazy values. : */ : if (!test_bit(__IXGBE_RESETTING, &adapter->state)) { : for (i = 0; i < adapter->num_vfs; i++) { : UPDATE_VF_COUNTER_32bit(IXGBE_PVFGPRC(i), \ 0.00 : 1ff3: 89 c2 mov %eax,%edx 0.00 : 1ff5: 44 89 c8 mov %r9d,%eax 0.00 : 1ff8: 48 8d 04 40 lea (%rax,%rax,2),%rax 0.00 : 1ffc: 48 8d 04 c0 lea (%rax,%rax,8),%rax 0.00 : 2000: 48 8d 0c c5 00 00 00 lea 0x0(,%rax,8),%rcx 0.00 : 2007: 00 0.00 : 2008: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 200f: 48 01 c8 add %rcx,%rax 0.00 : 2012: 48 3b 50 78 cmp 0x78(%rax),%rdx 0.00 : 2016: 73 0e jae 2026 0.00 : 2018: 48 01 68 50 add %rbp,0x50(%rax) 0.00 : 201c: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2023: 48 01 c8 add %rcx,%rax 0.00 : 2026: 48 89 50 78 mov %rdx,0x78(%rax) 0.00 : 202a: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2031: 48 01 c8 add %rcx,%rax 0.00 : 2034: 4c 21 58 50 and %r11,0x50(%rax) 0.00 : 2038: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 203f: 48 01 c8 add %rcx,%rax 0.00 : 2042: 48 09 50 50 or %rdx,0x50(%rax) 0.00 : 2046: 44 89 d0 mov %r10d,%eax 0.00 : 2049: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 2050: 8b 00 mov (%rax),%eax : adapter->vfinfo[i].last_vfstats.gprc, \ : adapter->vfinfo[i].vfstats.gprc); : UPDATE_VF_COUNTER_32bit(IXGBE_PVFGPTC(i), \ 0.00 : 2052: 89 c2 mov %eax,%edx 0.00 : 2054: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 205b: 48 01 c8 add %rcx,%rax 0.00 : 205e: 48 3b 90 88 00 00 00 cmp 0x88(%rax),%rdx 0.00 : 2065: 73 0e jae 2075 0.00 : 2067: 48 01 68 60 add %rbp,0x60(%rax) 0.00 : 206b: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2072: 48 01 c8 add %rcx,%rax 0.00 : 2075: 48 89 90 88 00 00 00 mov %rdx,0x88(%rax) 0.00 : 207c: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2083: 48 01 c8 add %rcx,%rax 0.00 : 2086: 4c 21 58 60 and %r11,0x60(%rax) 0.00 : 208a: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2091: 48 01 c8 add %rcx,%rax 0.00 : 2094: 48 09 50 60 or %rdx,0x60(%rax) 0.00 : 2098: 8d 47 04 lea 0x4(%rdi),%eax 0.00 : 209b: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 20a2: 8b 10 mov (%rax),%edx 0.00 : 20a4: 8d 87 04 c0 00 00 lea 0xc004(%rdi),%eax 0.00 : 20aa: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 20b1: 8b 00 mov (%rax),%eax : adapter->vfinfo[i].last_vfstats.gptc, \ : adapter->vfinfo[i].vfstats.gptc); : UPDATE_VF_COUNTER_36bit(IXGBE_PVFGORC_LSB(i), \ 0.00 : 20b3: 48 89 c6 mov %rax,%rsi 0.00 : 20b6: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 20bd: 89 d2 mov %edx,%edx 0.00 : 20bf: 48 c1 e6 20 shl $0x20,%rsi 0.00 : 20c3: 48 09 d6 or %rdx,%rsi 0.00 : 20c6: 48 01 c8 add %rcx,%rax 0.00 : 20c9: 48 3b b0 80 00 00 00 cmp 0x80(%rax),%rsi 0.00 : 20d0: 73 0e jae 20e0 0.00 : 20d2: 4c 01 68 58 add %r13,0x58(%rax) 0.00 : 20d6: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 20dd: 48 01 c8 add %rcx,%rax 0.00 : 20e0: 48 89 b0 80 00 00 00 mov %rsi,0x80(%rax) 0.00 : 20e7: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 20ee: 48 01 c8 add %rcx,%rax 0.00 : 20f1: 4c 21 60 58 and %r12,0x58(%rax) 0.00 : 20f5: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 20fc: 48 01 c8 add %rcx,%rax 0.00 : 20ff: 48 09 70 58 or %rsi,0x58(%rax) 0.00 : 2103: 44 89 c0 mov %r8d,%eax 0.00 : 2106: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 210d: 8b 10 mov (%rax),%edx 0.00 : 210f: 41 8d 40 04 lea 0x4(%r8),%eax 0.00 : 2113: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 211a: 8b 00 mov (%rax),%eax : IXGBE_PVFGORC_MSB(i), \ : adapter->vfinfo[i].last_vfstats.gorc, \ : adapter->vfinfo[i].vfstats.gorc); : UPDATE_VF_COUNTER_36bit(IXGBE_PVFGOTC_LSB(i), \ 0.00 : 211c: 48 89 c6 mov %rax,%rsi 0.00 : 211f: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2126: 89 d2 mov %edx,%edx 0.00 : 2128: 48 c1 e6 20 shl $0x20,%rsi 0.00 : 212c: 48 09 d6 or %rdx,%rsi 0.00 : 212f: 48 01 c8 add %rcx,%rax 0.00 : 2132: 48 3b b0 90 00 00 00 cmp 0x90(%rax),%rsi 0.00 : 2139: 73 0e jae 2149 0.00 : 213b: 4c 01 68 68 add %r13,0x68(%rax) 0.00 : 213f: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2146: 48 01 c8 add %rcx,%rax 0.00 : 2149: 48 89 b0 90 00 00 00 mov %rsi,0x90(%rax) 0.00 : 2150: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2157: 48 01 c8 add %rcx,%rax 0.00 : 215a: 4c 21 60 68 and %r12,0x68(%rax) 0.00 : 215e: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2165: 48 01 c8 add %rcx,%rax 0.00 : 2168: 48 09 70 68 or %rsi,0x68(%rax) 0.00 : 216c: 8d 87 00 c0 00 00 lea 0xc000(%rdi),%eax 0.00 : 2172: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 2179: 8b 00 mov (%rax),%eax : IXGBE_PVFGOTC_MSB(i), \ : adapter->vfinfo[i].last_vfstats.gotc, \ : adapter->vfinfo[i].vfstats.gotc); : UPDATE_VF_COUNTER_32bit(IXGBE_PVFMPRC(i), \ 0.00 : 217b: 89 c2 mov %eax,%edx 0.00 : 217d: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 2184: 48 01 c8 add %rcx,%rax 0.00 : 2187: 48 3b 90 98 00 00 00 cmp 0x98(%rax),%rdx 0.00 : 218e: 73 0e jae 219e 0.00 : 2190: 48 01 68 70 add %rbp,0x70(%rax) 0.00 : 2194: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax 0.00 : 219b: 48 01 c8 add %rcx,%rax 0.00 : 219e: 48 89 90 98 00 00 00 mov %rdx,0x98(%rax) 0.00 : 21a5: 48 8b 83 60 7c 00 00 mov 0x7c60(%rbx),%rax : * VF Stats Collection - skip while resetting because these : * are not clear on read and otherwise you'll sometimes get : * crazy values. : */ : if (!test_bit(__IXGBE_RESETTING, &adapter->state)) { : for (i = 0; i < adapter->num_vfs; i++) { 0.00 : 21ac: 41 83 c1 01 add $0x1,%r9d 0.00 : 21b0: 83 c7 40 add $0x40,%edi 0.00 : 21b3: 41 83 c0 08 add $0x8,%r8d 0.00 : 21b7: 41 83 c2 04 add $0x4,%r10d : adapter->vfinfo[i].vfstats.gorc); : UPDATE_VF_COUNTER_36bit(IXGBE_PVFGOTC_LSB(i), \ : IXGBE_PVFGOTC_MSB(i), \ : adapter->vfinfo[i].last_vfstats.gotc, \ : adapter->vfinfo[i].vfstats.gotc); : UPDATE_VF_COUNTER_32bit(IXGBE_PVFMPRC(i), \ 0.00 : 21bb: 48 01 c8 add %rcx,%rax 0.00 : 21be: 4c 21 58 70 and %r11,0x70(%rax) 0.00 : 21c2: 48 89 c8 mov %rcx,%rax 0.00 : 21c5: 48 03 83 60 7c 00 00 add 0x7c60(%rbx),%rax 0.00 : 21cc: 48 09 50 70 or %rdx,0x70(%rax) : * VF Stats Collection - skip while resetting because these : * are not clear on read and otherwise you'll sometimes get : * crazy values. : */ : if (!test_bit(__IXGBE_RESETTING, &adapter->state)) { : for (i = 0; i < adapter->num_vfs; i++) { 0.00 : 21d0: 44 39 8b 58 7c 00 00 cmp %r9d,0x7c58(%rbx) 0.00 : 21d7: 0f 87 0b fe ff ff ja 1fe8 0.00 : 21dd: 0f 1f 00 nopl (%rax) : UPDATE_VF_COUNTER_32bit(IXGBE_PVFMPRC(i), \ : adapter->vfinfo[i].last_vfstats.mprc, \ : adapter->vfinfo[i].vfstats.mprc); : } : } : } 0.00 : 21e0: 48 83 c4 28 add $0x28,%rsp 0.00 : 21e4: 5b pop %rbx 0.00 : 21e5: 5d pop %rbp 0.00 : 21e6: 41 5c pop %r12 0.00 : 21e8: 41 5d pop %r13 0.00 : 21ea: 41 5e pop %r14 0.00 : 21ec: 41 5f pop %r15 0.00 : 21ee: c3 retq : return; : : if (adapter->flags2 & IXGBE_FLAG2_RSC_ENABLED) { : u64 rsc_count = 0; : u64 rsc_flush = 0; : for (i = 0; i < adapter->num_rx_queues; i++) { 0.00 : 21ef: 44 8b 9f 28 02 00 00 mov 0x228(%rdi),%r11d 0.00 : 21f6: 31 f6 xor %esi,%esi 0.00 : 21f8: 31 c9 xor %ecx,%ecx 0.00 : 21fa: 45 85 db test %r11d,%r11d 0.00 : 21fd: 74 32 je 2231 0.00 : 21ff: 41 8d 43 ff lea -0x1(%r11),%eax 0.00 : 2203: 31 f6 xor %esi,%esi 0.00 : 2205: 31 c9 xor %ecx,%ecx 0.00 : 2207: 31 d2 xor %edx,%edx 0.00 : 2209: 48 8d 3c c5 08 00 00 lea 0x8(,%rax,8),%rdi 0.00 : 2210: 00 0.00 : 2211: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : rsc_count += adapter->rx_ring[i]->rx_stats.rsc_count; 0.00 : 2218: 48 8b 84 13 d8 04 00 mov 0x4d8(%rbx,%rdx,1),%rax 0.00 : 221f: 00 : rsc_flush += adapter->rx_ring[i]->rx_stats.rsc_flush; 0.00 : 2220: 48 83 c2 08 add $0x8,%rdx : : if (adapter->flags2 & IXGBE_FLAG2_RSC_ENABLED) { : u64 rsc_count = 0; : u64 rsc_flush = 0; : for (i = 0; i < adapter->num_rx_queues; i++) { : rsc_count += adapter->rx_ring[i]->rx_stats.rsc_count; 0.00 : 2224: 48 03 70 68 add 0x68(%rax),%rsi : rsc_flush += adapter->rx_ring[i]->rx_stats.rsc_flush; 0.00 : 2228: 48 03 48 70 add 0x70(%rax),%rcx : return; : : if (adapter->flags2 & IXGBE_FLAG2_RSC_ENABLED) { : u64 rsc_count = 0; : u64 rsc_flush = 0; : for (i = 0; i < adapter->num_rx_queues; i++) { 0.00 : 222c: 48 39 fa cmp %rdi,%rdx 0.00 : 222f: 75 e7 jne 2218 : rsc_count += adapter->rx_ring[i]->rx_stats.rsc_count; : rsc_flush += adapter->rx_ring[i]->rx_stats.rsc_flush; : } : adapter->rsc_total_count = rsc_count; 0.00 : 2231: 48 89 b3 30 07 00 00 mov %rsi,0x730(%rbx) : adapter->rsc_total_flush = rsc_flush; 0.00 : 2238: 48 89 8b 38 07 00 00 mov %rcx,0x738(%rbx) 0.00 : 223f: e9 06 f6 ff ff jmpq 184a 0.00 : 2244: 0f 1f 40 00 nopl 0x0(%rax) : net_stats->tx_packets = packets; : : hwstats->crcerrs += IXGBE_READ_REG(hw, IXGBE_CRCERRS); : : /* 8 register reads */ : for (i = 0; i < 8; i++) { 0.00 : 2248: 66 be 30 60 mov $0x6030,%si 0.00 : 224c: b9 00 87 00 00 mov $0x8700,%ecx 0.00 : 2251: eb 1a jmp 226d 0.00 : 2253: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 2258: 48 83 c6 40 add $0x40,%rsi 0.00 : 225c: 48 83 c1 08 add $0x8,%rcx : break; : } : } : : /*16 register reads */ : for (i = 0; i < 16; i++) { 0.00 : 2260: 48 81 fe 30 64 00 00 cmp $0x6430,%rsi 0.00 : 2267: 0f 84 c3 00 00 00 je 2330 0.00 : 226d: 48 89 f0 mov %rsi,%rax : hwstats->qptc[i] += IXGBE_READ_REG(hw, IXGBE_QPTC(i)); 0.00 : 2270: 48 8b 94 0b 08 91 ff mov -0x6ef8(%rbx,%rcx,1),%rdx 0.00 : 2277: ff 0.00 : 2278: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 227f: 8b 00 mov (%rax),%eax 0.00 : 2281: 89 c0 mov %eax,%eax 0.00 : 2283: 48 01 d0 add %rdx,%rax : hwstats->qprc[i] += IXGBE_READ_REG(hw, IXGBE_QPRC(i)); 0.00 : 2286: 48 8b 94 0b 88 90 ff mov -0x6f78(%rbx,%rcx,1),%rdx 0.00 : 228d: ff : } : } : : /*16 register reads */ : for (i = 0; i < 16; i++) { : hwstats->qptc[i] += IXGBE_READ_REG(hw, IXGBE_QPTC(i)); 0.00 : 228e: 48 89 84 0b 08 91 ff mov %rax,-0x6ef8(%rbx,%rcx,1) 0.00 : 2295: ff 0.00 : 2296: 48 8d 86 00 b0 ff ff lea -0x5000(%rsi),%rax 0.00 : 229d: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 22a4: 8b 00 mov (%rax),%eax : hwstats->qprc[i] += IXGBE_READ_REG(hw, IXGBE_QPRC(i)); 0.00 : 22a6: 89 c0 mov %eax,%eax 0.00 : 22a8: 48 01 d0 add %rdx,%rax 0.00 : 22ab: 48 89 84 0b 88 90 ff mov %rax,-0x6f78(%rbx,%rcx,1) 0.00 : 22b2: ff : if ((hw->mac.type == ixgbe_mac_82599EB) || 0.00 : 22b3: 8b 83 50 10 00 00 mov 0x1050(%rbx),%eax 0.00 : 22b9: 83 e8 02 sub $0x2,%eax 0.00 : 22bc: 83 f8 01 cmp $0x1,%eax 0.00 : 22bf: 77 97 ja 2258 0.00 : 22c1: 48 89 c8 mov %rcx,%rax : (hw->mac.type == ixgbe_mac_X540)) { : hwstats->qbtc[i] += IXGBE_READ_REG(hw, IXGBE_QBTC_L(i)); 0.00 : 22c4: 48 8b 94 0b 08 92 ff mov -0x6df8(%rbx,%rcx,1),%rdx 0.00 : 22cb: ff 0.00 : 22cc: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 22d3: 8b 00 mov (%rax),%eax 0.00 : 22d5: 89 c0 mov %eax,%eax 0.00 : 22d7: 48 01 d0 add %rdx,%rax 0.00 : 22da: 48 89 84 0b 08 92 ff mov %rax,-0x6df8(%rbx,%rcx,1) 0.00 : 22e1: ff 0.00 : 22e2: 48 8d 41 04 lea 0x4(%rcx),%rax 0.00 : 22e6: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 22ed: 8b 00 mov (%rax),%eax 33.33 : 22ef: 48 8d 86 04 b0 ff ff lea -0x4ffc(%rsi),%rax : IXGBE_READ_REG(hw, IXGBE_QBTC_H(i)); /* to clear */ : hwstats->qbrc[i] += IXGBE_READ_REG(hw, IXGBE_QBRC_L(i)); 0.00 : 22f6: 48 8b 94 0b 88 91 ff mov -0x6e78(%rbx,%rcx,1),%rdx 0.00 : 22fd: ff 0.00 : 22fe: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 2305: 8b 00 mov (%rax),%eax 33.33 : 2307: 89 c0 mov %eax,%eax 0.00 : 2309: 48 01 d0 add %rdx,%rax 0.00 : 230c: 48 89 84 0b 88 91 ff mov %rax,-0x6e78(%rbx,%rcx,1) 0.00 : 2313: ff 0.00 : 2314: 48 8d 86 08 b0 ff ff lea -0x4ff8(%rsi),%rax 0.00 : 231b: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 2322: 8b 00 mov (%rax),%eax 0.00 : 2324: e9 2f ff ff ff jmpq 2258 0.00 : 2329: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 2330: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : IXGBE_READ_REG(hw, IXGBE_QBRC_H(i)); /* to clear */ : } : } : : hwstats->gprc += IXGBE_READ_REG(hw, IXGBE_GPRC); 0.00 : 2337: 48 8b 8b 80 16 00 00 mov 0x1680(%rbx),%rcx 0.00 : 233e: 48 05 74 40 00 00 add $0x4074,%rax 0.00 : 2344: 8b 00 mov (%rax),%eax : /* work around hardware counting issue */ : hwstats->gprc -= missed_rx; 0.00 : 2346: 44 89 ca mov %r9d,%edx 0.00 : 2349: 89 c0 mov %eax,%eax 0.00 : 234b: 48 29 d1 sub %rdx,%rcx : { : struct ixgbe_hw *hw = &adapter->hw; : struct ixgbe_hw_stats *hwstats = &adapter->stats; : u32 xoff[8] = {0}; : int i; : bool pfc_en = adapter->dcb_cfg.pfc_mode_enable; 0.00 : 234e: 0f b6 93 7a 0a 00 00 movzbl 0xa7a(%rbx),%edx : } : } : : hwstats->gprc += IXGBE_READ_REG(hw, IXGBE_GPRC); : /* work around hardware counting issue */ : hwstats->gprc -= missed_rx; 0.00 : 2355: 48 01 c1 add %rax,%rcx : u32 xoff[8] = {0}; : int i; : bool pfc_en = adapter->dcb_cfg.pfc_mode_enable; : : #ifdef HAVE_DCBNL_IEEE : if (adapter->ixgbe_ieee_pfc) 0.00 : 2358: 48 8b 83 50 09 00 00 mov 0x950(%rbx),%rax : } : } : : hwstats->gprc += IXGBE_READ_REG(hw, IXGBE_GPRC); : /* work around hardware counting issue */ : hwstats->gprc -= missed_rx; 0.00 : 235f: 48 89 8b 80 16 00 00 mov %rcx,0x1680(%rbx) : u32 xoff[8] = {0}; : int i; : bool pfc_en = adapter->dcb_cfg.pfc_mode_enable; : : #ifdef HAVE_DCBNL_IEEE : if (adapter->ixgbe_ieee_pfc) 0.00 : 2366: 48 85 c0 test %rax,%rax 0.00 : 2369: 74 12 je 237d : pfc_en |= !!(adapter->ixgbe_ieee_pfc->pfc_en); 0.00 : 236b: 80 78 01 00 cmpb $0x0,0x1(%rax) 0.00 : 236f: 0f b6 d2 movzbl %dl,%edx 0.00 : 2372: 0f 95 c0 setne %al 0.00 : 2375: 0f b6 c0 movzbl %al,%eax 0.00 : 2378: 09 d0 or %edx,%eax 0.00 : 237a: 0f 95 c2 setne %dl : : #endif : if (!(adapter->flags & IXGBE_FLAG_DCB_ENABLED) || !pfc_en) { 0.00 : 237d: f6 83 19 02 00 00 04 testb $0x4,0x219(%rbx) 0.00 : 2384: 0f 84 8e f7 ff ff je 1b18 0.00 : 238a: 84 d2 test %dl,%dl 0.00 : 238c: 0f 84 86 f7 ff ff je 1b18 : : static void ixgbe_update_xoff_received(struct ixgbe_adapter *adapter) : { : struct ixgbe_hw *hw = &adapter->hw; : struct ixgbe_hw_stats *hwstats = &adapter->stats; : u32 xoff[8] = {0}; 0.00 : 2392: 48 c7 04 24 00 00 00 movq $0x0,(%rsp) 0.00 : 2399: 00 0.00 : 239a: 48 c7 44 24 08 00 00 movq $0x0,0x8(%rsp) 0.00 : 23a1: 00 00 0.00 : 23a3: 31 c9 xor %ecx,%ecx 0.00 : 23a5: 48 c7 44 24 10 00 00 movq $0x0,0x10(%rsp) 0.00 : 23ac: 00 00 0.00 : 23ae: 48 c7 44 24 18 00 00 movq $0x0,0x18(%rsp) 0.00 : 23b5: 00 00 0.00 : 23b7: ba 20 cf 00 00 mov $0xcf20,%edx 0.00 : 23bc: 48 89 e6 mov %rsp,%rsi 0.00 : 23bf: eb 52 jmp 2413 0.00 : 23c1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 23c8: 48 8d 82 40 72 ff ff lea -0x8dc0(%rdx),%rax 0.00 : 23cf: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 23d6: 8b 00 mov (%rax),%eax : switch (hw->mac.type) { : case ixgbe_mac_82598EB: : xoff[i] = IXGBE_READ_REG(hw, IXGBE_PXOFFRXC(i)); : break; : default: : xoff[i] = IXGBE_READ_REG(hw, IXGBE_PXOFFRXCNT(i)); 0.00 : 23d8: 89 84 16 e0 30 ff ff mov %eax,-0xcf20(%rsi,%rdx,1) : } : hwstats->pxoffrxc[i] += xoff[i]; 0.00 : 23df: 8b 84 16 e0 30 ff ff mov -0xcf20(%rsi,%rdx,1),%eax : ixgbe_update_xoff_rx_lfc(adapter); : return; : } : : /* update stats for each tc, only valid with PFC enabled */ : for (i = 0; i < MAX_TX_PACKET_BUFFERS; i++) { 0.00 : 23e6: 83 c1 01 add $0x1,%ecx : xoff[i] = IXGBE_READ_REG(hw, IXGBE_PXOFFRXC(i)); : break; : default: : xoff[i] = IXGBE_READ_REG(hw, IXGBE_PXOFFRXCNT(i)); : } : hwstats->pxoffrxc[i] += xoff[i]; 0.00 : 23e9: 48 01 84 53 d0 77 fe add %rax,-0x18830(%rbx,%rdx,2) 0.00 : 23f0: ff : ixgbe_update_xoff_rx_lfc(adapter); : return; : } : : /* update stats for each tc, only valid with PFC enabled */ : for (i = 0; i < MAX_TX_PACKET_BUFFERS; i++) { 0.00 : 23f1: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax 0.00 : 23f7: 25 00 04 00 00 and $0x400,%eax 0.00 : 23fc: 83 f8 01 cmp $0x1,%eax 0.00 : 23ff: 19 c0 sbb %eax,%eax 0.00 : 2401: 48 83 c2 04 add $0x4,%rdx 0.00 : 2405: 83 e0 f9 and $0xfffffff9,%eax 0.00 : 2408: 83 c0 08 add $0x8,%eax 0.00 : 240b: 39 c8 cmp %ecx,%eax 0.00 : 240d: 0f 8e a0 03 00 00 jle 27b3 : switch (hw->mac.type) { 0.00 : 2413: 83 bb 50 10 00 00 01 cmpl $0x1,0x1050(%rbx) 0.00 : 241a: 75 ac jne 23c8 0.00 : 241c: 48 89 d0 mov %rdx,%rax 0.00 : 241f: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 2426: 8b 00 mov (%rax),%eax : case ixgbe_mac_82598EB: : xoff[i] = IXGBE_READ_REG(hw, IXGBE_PXOFFRXC(i)); 0.00 : 2428: 89 84 16 e0 30 ff ff mov %eax,-0xcf20(%rsi,%rdx,1) 0.00 : 242f: eb ae jmp 23df 0.00 : 2431: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : hwstats->gotc += IXGBE_READ_REG(hw, IXGBE_GOTCH); : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORH); : break; : case ixgbe_mac_X540: : /* OS2BMC stats are X540 only*/ : hwstats->o2bgptc += IXGBE_READ_REG(hw, IXGBE_O2BGPTC); 0.00 : 2438: 48 8b 93 e0 1a 00 00 mov 0x1ae0(%rbx),%rdx 0.00 : 243f: 48 05 c4 41 00 00 add $0x41c4,%rax 0.00 : 2445: 8b 00 mov (%rax),%eax 0.00 : 2447: 89 c0 mov %eax,%eax 0.00 : 2449: 48 01 d0 add %rdx,%rax : hwstats->o2bspc += IXGBE_READ_REG(hw, IXGBE_O2BSPC); 0.00 : 244c: 48 8b 93 e8 1a 00 00 mov 0x1ae8(%rbx),%rdx : hwstats->gotc += IXGBE_READ_REG(hw, IXGBE_GOTCH); : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORH); : break; : case ixgbe_mac_X540: : /* OS2BMC stats are X540 only*/ : hwstats->o2bgptc += IXGBE_READ_REG(hw, IXGBE_O2BGPTC); 0.00 : 2453: 48 89 83 e0 1a 00 00 mov %rax,0x1ae0(%rbx) 0.00 : 245a: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2461: 48 05 b0 87 00 00 add $0x87b0,%rax 0.00 : 2467: 8b 00 mov (%rax),%eax : hwstats->o2bspc += IXGBE_READ_REG(hw, IXGBE_O2BSPC); 0.00 : 2469: 89 c0 mov %eax,%eax 0.00 : 246b: 48 01 d0 add %rdx,%rax : hwstats->b2ospc += IXGBE_READ_REG(hw, IXGBE_B2OSPC); 0.00 : 246e: 48 8b 93 d0 1a 00 00 mov 0x1ad0(%rbx),%rdx : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORH); : break; : case ixgbe_mac_X540: : /* OS2BMC stats are X540 only*/ : hwstats->o2bgptc += IXGBE_READ_REG(hw, IXGBE_O2BGPTC); : hwstats->o2bspc += IXGBE_READ_REG(hw, IXGBE_O2BSPC); 0.00 : 2475: 48 89 83 e8 1a 00 00 mov %rax,0x1ae8(%rbx) 0.00 : 247c: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2483: 48 05 c0 41 00 00 add $0x41c0,%rax 0.00 : 2489: 8b 00 mov (%rax),%eax : hwstats->b2ospc += IXGBE_READ_REG(hw, IXGBE_B2OSPC); 0.00 : 248b: 89 c0 mov %eax,%eax 0.00 : 248d: 48 01 d0 add %rdx,%rax : hwstats->b2ogprc += IXGBE_READ_REG(hw, IXGBE_B2OGPRC); 0.00 : 2490: 48 8b 93 d8 1a 00 00 mov 0x1ad8(%rbx),%rdx : break; : case ixgbe_mac_X540: : /* OS2BMC stats are X540 only*/ : hwstats->o2bgptc += IXGBE_READ_REG(hw, IXGBE_O2BGPTC); : hwstats->o2bspc += IXGBE_READ_REG(hw, IXGBE_O2BSPC); : hwstats->b2ospc += IXGBE_READ_REG(hw, IXGBE_B2OSPC); 0.00 : 2497: 48 89 83 d0 1a 00 00 mov %rax,0x1ad0(%rbx) 0.00 : 249e: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 24a5: 48 05 90 2f 00 00 add $0x2f90,%rax 0.00 : 24ab: 8b 00 mov (%rax),%eax : hwstats->b2ogprc += IXGBE_READ_REG(hw, IXGBE_B2OGPRC); 0.00 : 24ad: 89 c0 mov %eax,%eax 0.00 : 24af: 48 01 d0 add %rdx,%rax 0.00 : 24b2: 48 89 83 d8 1a 00 00 mov %rax,0x1ad8(%rbx) 0.00 : 24b9: b9 30 14 00 00 mov $0x1430,%ecx 0.00 : 24be: 66 90 xchg %ax,%ax 0.00 : 24c0: 48 89 c8 mov %rcx,%rax : case ixgbe_mac_82599EB: : for (i = 0; i < 16; i++) : adapter->hw_rx_no_dma_resources += 0.00 : 24c3: 48 8b 93 28 07 00 00 mov 0x728(%rbx),%rdx 0.00 : 24ca: 48 03 83 80 0e 00 00 add 0xe80(%rbx),%rax 0.00 : 24d1: 8b 00 mov (%rax),%eax 0.00 : 24d3: 89 c0 mov %eax,%eax 0.00 : 24d5: 48 83 c1 40 add $0x40,%rcx 0.00 : 24d9: 48 01 d0 add %rdx,%rax : hwstats->o2bgptc += IXGBE_READ_REG(hw, IXGBE_O2BGPTC); : hwstats->o2bspc += IXGBE_READ_REG(hw, IXGBE_O2BSPC); : hwstats->b2ospc += IXGBE_READ_REG(hw, IXGBE_B2OSPC); : hwstats->b2ogprc += IXGBE_READ_REG(hw, IXGBE_B2OGPRC); : case ixgbe_mac_82599EB: : for (i = 0; i < 16; i++) 0.00 : 24dc: 48 81 f9 30 18 00 00 cmp $0x1830,%rcx : adapter->hw_rx_no_dma_resources += 0.00 : 24e3: 48 89 83 28 07 00 00 mov %rax,0x728(%rbx) : hwstats->o2bgptc += IXGBE_READ_REG(hw, IXGBE_O2BGPTC); : hwstats->o2bspc += IXGBE_READ_REG(hw, IXGBE_O2BSPC); : hwstats->b2ospc += IXGBE_READ_REG(hw, IXGBE_B2OSPC); : hwstats->b2ogprc += IXGBE_READ_REG(hw, IXGBE_B2OGPRC); : case ixgbe_mac_82599EB: : for (i = 0; i < 16; i++) 0.00 : 24ea: 75 d4 jne 24c0 0.00 : 24ec: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : adapter->hw_rx_no_dma_resources += : IXGBE_READ_REG(hw, IXGBE_QPRDC(i)); : hwstats->gorc += IXGBE_READ_REG(hw, IXGBE_GORCL); 0.00 : 24f3: 48 8b 93 a0 16 00 00 mov 0x16a0(%rbx),%rdx 0.00 : 24fa: 48 05 88 40 00 00 add $0x4088,%rax 0.00 : 2500: 8b 00 mov (%rax),%eax 0.00 : 2502: 89 c0 mov %eax,%eax 0.00 : 2504: 48 01 d0 add %rdx,%rax 0.00 : 2507: 48 89 83 a0 16 00 00 mov %rax,0x16a0(%rbx) 0.00 : 250e: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2515: 48 05 8c 40 00 00 add $0x408c,%rax 0.00 : 251b: 8b 00 mov (%rax),%eax 0.00 : 251d: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : IXGBE_READ_REG(hw, IXGBE_GORCH); /* to clear */ : hwstats->gotc += IXGBE_READ_REG(hw, IXGBE_GOTCL); 0.00 : 2524: 48 8b 93 a8 16 00 00 mov 0x16a8(%rbx),%rdx 0.00 : 252b: 48 05 90 40 00 00 add $0x4090,%rax 0.00 : 2531: 8b 00 mov (%rax),%eax 0.00 : 2533: 89 c0 mov %eax,%eax 0.00 : 2535: 48 01 d0 add %rdx,%rax 0.00 : 2538: 48 89 83 a8 16 00 00 mov %rax,0x16a8(%rbx) 0.00 : 253f: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2546: 48 05 94 40 00 00 add $0x4094,%rax 0.00 : 254c: 8b 00 mov (%rax),%eax 0.00 : 254e: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : IXGBE_READ_REG(hw, IXGBE_GOTCH); /* to clear */ : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORL); 0.00 : 2555: 48 8b 93 28 17 00 00 mov 0x1728(%rbx),%rdx 0.00 : 255c: 48 05 c0 40 00 00 add $0x40c0,%rax 0.00 : 2562: 8b 00 mov (%rax),%eax 0.00 : 2564: 89 c0 mov %eax,%eax 0.00 : 2566: 48 01 d0 add %rdx,%rax 0.00 : 2569: 48 89 83 28 17 00 00 mov %rax,0x1728(%rbx) 0.00 : 2570: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2577: 48 05 c4 40 00 00 add $0x40c4,%rax 0.00 : 257d: 8b 00 mov (%rax),%eax 0.00 : 257f: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax : IXGBE_READ_REG(hw, IXGBE_TORH); /* to clear */ : hwstats->lxonrxc += IXGBE_READ_REG(hw, IXGBE_LXONRXCNT); 0.00 : 2586: 48 8b 93 38 15 00 00 mov 0x1538(%rbx),%rdx 0.00 : 258d: 48 05 a4 41 00 00 add $0x41a4,%rax 0.00 : 2593: 8b 00 mov (%rax),%eax 0.00 : 2595: 89 c0 mov %eax,%eax 0.00 : 2597: 48 01 d0 add %rdx,%rax : #ifdef HAVE_TX_MQ : hwstats->fdirmatch += IXGBE_READ_REG(hw, IXGBE_FDIRMATCH); 0.00 : 259a: 48 8b 93 68 1a 00 00 mov 0x1a68(%rbx),%rdx : IXGBE_READ_REG(hw, IXGBE_GORCH); /* to clear */ : hwstats->gotc += IXGBE_READ_REG(hw, IXGBE_GOTCL); : IXGBE_READ_REG(hw, IXGBE_GOTCH); /* to clear */ : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORL); : IXGBE_READ_REG(hw, IXGBE_TORH); /* to clear */ : hwstats->lxonrxc += IXGBE_READ_REG(hw, IXGBE_LXONRXCNT); 0.00 : 25a1: 48 89 83 38 15 00 00 mov %rax,0x1538(%rbx) 0.00 : 25a8: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 25af: 48 05 58 ee 00 00 add $0xee58,%rax 0.00 : 25b5: 8b 00 mov (%rax),%eax : #ifdef HAVE_TX_MQ : hwstats->fdirmatch += IXGBE_READ_REG(hw, IXGBE_FDIRMATCH); 0.00 : 25b7: 89 c0 mov %eax,%eax 0.00 : 25b9: 48 01 d0 add %rdx,%rax : hwstats->fdirmiss += IXGBE_READ_REG(hw, IXGBE_FDIRMISS); 0.00 : 25bc: 48 8b 93 70 1a 00 00 mov 0x1a70(%rbx),%rdx : IXGBE_READ_REG(hw, IXGBE_GOTCH); /* to clear */ : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORL); : IXGBE_READ_REG(hw, IXGBE_TORH); /* to clear */ : hwstats->lxonrxc += IXGBE_READ_REG(hw, IXGBE_LXONRXCNT); : #ifdef HAVE_TX_MQ : hwstats->fdirmatch += IXGBE_READ_REG(hw, IXGBE_FDIRMATCH); 0.00 : 25c3: 48 89 83 68 1a 00 00 mov %rax,0x1a68(%rbx) 0.00 : 25ca: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 25d1: 48 05 5c ee 00 00 add $0xee5c,%rax 0.00 : 25d7: 8b 00 mov (%rax),%eax : hwstats->fdirmiss += IXGBE_READ_REG(hw, IXGBE_FDIRMISS); 0.00 : 25d9: 89 c0 mov %eax,%eax 0.00 : 25db: 48 01 d0 add %rdx,%rax : #endif /* HAVE_TX_MQ */ : #ifdef IXGBE_FCOE : hwstats->fccrc += IXGBE_READ_REG(hw, IXGBE_FCCRC); 0.00 : 25de: 48 8b 93 78 1a 00 00 mov 0x1a78(%rbx),%rdx : hwstats->tor += IXGBE_READ_REG(hw, IXGBE_TORL); : IXGBE_READ_REG(hw, IXGBE_TORH); /* to clear */ : hwstats->lxonrxc += IXGBE_READ_REG(hw, IXGBE_LXONRXCNT); : #ifdef HAVE_TX_MQ : hwstats->fdirmatch += IXGBE_READ_REG(hw, IXGBE_FDIRMATCH); : hwstats->fdirmiss += IXGBE_READ_REG(hw, IXGBE_FDIRMISS); 0.00 : 25e5: 48 89 83 70 1a 00 00 mov %rax,0x1a70(%rbx) 0.00 : 25ec: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 25f3: 48 05 18 51 00 00 add $0x5118,%rax 0.00 : 25f9: 8b 00 mov (%rax),%eax : #endif /* HAVE_TX_MQ */ : #ifdef IXGBE_FCOE : hwstats->fccrc += IXGBE_READ_REG(hw, IXGBE_FCCRC); 0.00 : 25fb: 89 c0 mov %eax,%eax 0.00 : 25fd: 48 01 d0 add %rdx,%rax : hwstats->fclast += IXGBE_READ_REG(hw, IXGBE_FCLAST); 0.00 : 2600: 48 8b 93 80 1a 00 00 mov 0x1a80(%rbx),%rdx : #ifdef HAVE_TX_MQ : hwstats->fdirmatch += IXGBE_READ_REG(hw, IXGBE_FDIRMATCH); : hwstats->fdirmiss += IXGBE_READ_REG(hw, IXGBE_FDIRMISS); : #endif /* HAVE_TX_MQ */ : #ifdef IXGBE_FCOE : hwstats->fccrc += IXGBE_READ_REG(hw, IXGBE_FCCRC); 0.00 : 2607: 48 89 83 78 1a 00 00 mov %rax,0x1a78(%rbx) 0.00 : 260e: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2615: 48 05 24 24 00 00 add $0x2424,%rax 0.00 : 261b: 8b 00 mov (%rax),%eax : hwstats->fclast += IXGBE_READ_REG(hw, IXGBE_FCLAST); 0.00 : 261d: 89 c0 mov %eax,%eax 0.00 : 261f: 48 01 d0 add %rdx,%rax : hwstats->fcoerpdc += IXGBE_READ_REG(hw, IXGBE_FCOERPDC); 0.00 : 2622: 48 8b 93 88 1a 00 00 mov 0x1a88(%rbx),%rdx : hwstats->fdirmatch += IXGBE_READ_REG(hw, IXGBE_FDIRMATCH); : hwstats->fdirmiss += IXGBE_READ_REG(hw, IXGBE_FDIRMISS); : #endif /* HAVE_TX_MQ */ : #ifdef IXGBE_FCOE : hwstats->fccrc += IXGBE_READ_REG(hw, IXGBE_FCCRC); : hwstats->fclast += IXGBE_READ_REG(hw, IXGBE_FCLAST); 0.00 : 2629: 48 89 83 80 1a 00 00 mov %rax,0x1a80(%rbx) 0.00 : 2630: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2637: 48 05 1c 24 00 00 add $0x241c,%rax 0.00 : 263d: 8b 00 mov (%rax),%eax : hwstats->fcoerpdc += IXGBE_READ_REG(hw, IXGBE_FCOERPDC); 0.00 : 263f: 89 c0 mov %eax,%eax 0.00 : 2641: 48 01 d0 add %rdx,%rax : hwstats->fcoeprc += IXGBE_READ_REG(hw, IXGBE_FCOEPRC); 0.00 : 2644: 48 8b 93 90 1a 00 00 mov 0x1a90(%rbx),%rdx : hwstats->fdirmiss += IXGBE_READ_REG(hw, IXGBE_FDIRMISS); : #endif /* HAVE_TX_MQ */ : #ifdef IXGBE_FCOE : hwstats->fccrc += IXGBE_READ_REG(hw, IXGBE_FCCRC); : hwstats->fclast += IXGBE_READ_REG(hw, IXGBE_FCLAST); : hwstats->fcoerpdc += IXGBE_READ_REG(hw, IXGBE_FCOERPDC); 0.00 : 264b: 48 89 83 88 1a 00 00 mov %rax,0x1a88(%rbx) 0.00 : 2652: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2659: 48 05 28 24 00 00 add $0x2428,%rax 0.00 : 265f: 8b 00 mov (%rax),%eax : hwstats->fcoeprc += IXGBE_READ_REG(hw, IXGBE_FCOEPRC); 0.00 : 2661: 89 c0 mov %eax,%eax 0.00 : 2663: 48 01 d0 add %rdx,%rax : hwstats->fcoeptc += IXGBE_READ_REG(hw, IXGBE_FCOEPTC); 0.00 : 2666: 48 8b 93 98 1a 00 00 mov 0x1a98(%rbx),%rdx : #endif /* HAVE_TX_MQ */ : #ifdef IXGBE_FCOE : hwstats->fccrc += IXGBE_READ_REG(hw, IXGBE_FCCRC); : hwstats->fclast += IXGBE_READ_REG(hw, IXGBE_FCLAST); : hwstats->fcoerpdc += IXGBE_READ_REG(hw, IXGBE_FCOERPDC); : hwstats->fcoeprc += IXGBE_READ_REG(hw, IXGBE_FCOEPRC); 0.00 : 266d: 48 89 83 90 1a 00 00 mov %rax,0x1a90(%rbx) 0.00 : 2674: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 267b: 48 05 84 87 00 00 add $0x8784,%rax 0.00 : 2681: 8b 00 mov (%rax),%eax : hwstats->fcoeptc += IXGBE_READ_REG(hw, IXGBE_FCOEPTC); 0.00 : 2683: 89 c0 mov %eax,%eax 0.00 : 2685: 48 01 d0 add %rdx,%rax : hwstats->fcoedwrc += IXGBE_READ_REG(hw, IXGBE_FCOEDWRC); 0.00 : 2688: 48 8b 93 a0 1a 00 00 mov 0x1aa0(%rbx),%rdx : #ifdef IXGBE_FCOE : hwstats->fccrc += IXGBE_READ_REG(hw, IXGBE_FCCRC); : hwstats->fclast += IXGBE_READ_REG(hw, IXGBE_FCLAST); : hwstats->fcoerpdc += IXGBE_READ_REG(hw, IXGBE_FCOERPDC); : hwstats->fcoeprc += IXGBE_READ_REG(hw, IXGBE_FCOEPRC); : hwstats->fcoeptc += IXGBE_READ_REG(hw, IXGBE_FCOEPTC); 0.00 : 268f: 48 89 83 98 1a 00 00 mov %rax,0x1a98(%rbx) 0.00 : 2696: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 269d: 48 05 2c 24 00 00 add $0x242c,%rax 0.00 : 26a3: 8b 00 mov (%rax),%eax : hwstats->fcoedwrc += IXGBE_READ_REG(hw, IXGBE_FCOEDWRC); 0.00 : 26a5: 89 c0 mov %eax,%eax 0.00 : 26a7: 48 01 d0 add %rdx,%rax : hwstats->fcoedwtc += IXGBE_READ_REG(hw, IXGBE_FCOEDWTC); 0.00 : 26aa: 48 8b 93 a8 1a 00 00 mov 0x1aa8(%rbx),%rdx : hwstats->fccrc += IXGBE_READ_REG(hw, IXGBE_FCCRC); : hwstats->fclast += IXGBE_READ_REG(hw, IXGBE_FCLAST); : hwstats->fcoerpdc += IXGBE_READ_REG(hw, IXGBE_FCOERPDC); : hwstats->fcoeprc += IXGBE_READ_REG(hw, IXGBE_FCOEPRC); : hwstats->fcoeptc += IXGBE_READ_REG(hw, IXGBE_FCOEPTC); : hwstats->fcoedwrc += IXGBE_READ_REG(hw, IXGBE_FCOEDWRC); 0.00 : 26b1: 48 89 83 a0 1a 00 00 mov %rax,0x1aa0(%rbx) 0.00 : 26b8: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 26bf: 48 05 88 87 00 00 add $0x8788,%rax 0.00 : 26c5: 8b 00 mov (%rax),%eax : hwstats->fcoedwtc += IXGBE_READ_REG(hw, IXGBE_FCOEDWTC); 0.00 : 26c7: 89 c0 mov %eax,%eax 0.00 : 26c9: 48 01 d0 add %rdx,%rax : /* Add up per cpu counters for total ddp alloc fail */ : if (adapter->fcoe.ddp_pool) { 0.00 : 26cc: 48 83 bb e8 1b 00 00 cmpq $0x0,0x1be8(%rbx) 0.00 : 26d3: 00 : hwstats->fclast += IXGBE_READ_REG(hw, IXGBE_FCLAST); : hwstats->fcoerpdc += IXGBE_READ_REG(hw, IXGBE_FCOERPDC); : hwstats->fcoeprc += IXGBE_READ_REG(hw, IXGBE_FCOEPRC); : hwstats->fcoeptc += IXGBE_READ_REG(hw, IXGBE_FCOEPTC); : hwstats->fcoedwrc += IXGBE_READ_REG(hw, IXGBE_FCOEDWRC); : hwstats->fcoedwtc += IXGBE_READ_REG(hw, IXGBE_FCOEDWTC); 0.00 : 26d4: 48 89 83 a8 1a 00 00 mov %rax,0x1aa8(%rbx) : /* Add up per cpu counters for total ddp alloc fail */ : if (adapter->fcoe.ddp_pool) { 0.00 : 26db: 0f 84 f8 f4 ff ff je 1bd9 : static inline unsigned int cpumask_next(int n, const struct cpumask *srcp) : { : /* -1 is a legal arg here. */ : if (n != -1) : cpumask_check(n); : return find_next_bit(cpumask_bits(srcp), nr_cpumask_bits, n+1); 0.00 : 26e1: 4c 8b 2d 00 00 00 00 mov 0x0(%rip),%r13 # 26e8 0.00 : 26e8: b9 ff ff ff ff mov $0xffffffff,%ecx 0.00 : 26ed: 45 31 e4 xor %r12d,%r12d 0.00 : 26f0: 31 ed xor %ebp,%ebp 0.00 : 26f2: eb 1d jmp 2711 0.00 : 26f4: 0f 1f 40 00 nopl 0x0(%rax) : struct ixgbe_fcoe *fcoe = &adapter->fcoe; : struct ixgbe_fcoe_ddp_pool *ddp_pool; : unsigned int cpu; : u64 noddp = 0, noddp_ext_buff = 0; : for_each_possible_cpu(cpu) { : ddp_pool = per_cpu_ptr(fcoe->ddp_pool, cpu); 0.00 : 26f8: 89 ca mov %ecx,%edx 0.00 : 26fa: 48 8b 83 e8 1b 00 00 mov 0x1be8(%rbx),%rax 0.00 : 2701: 48 03 04 d5 00 00 00 add 0x0(,%rdx,8),%rax 0.00 : 2708: 00 : noddp += ddp_pool->noddp; 0.00 : 2709: 4c 03 60 08 add 0x8(%rax),%r12 : noddp_ext_buff += ddp_pool->noddp_ext_buff; 0.00 : 270d: 48 03 68 10 add 0x10(%rax),%rbp 0.00 : 2711: 48 63 35 00 00 00 00 movslq 0x0(%rip),%rsi # 2718 0.00 : 2718: 8d 51 01 lea 0x1(%rcx),%edx 0.00 : 271b: 4c 89 ef mov %r13,%rdi 0.00 : 271e: 48 63 d2 movslq %edx,%rdx 0.00 : 2721: e8 00 00 00 00 callq 2726 : if (adapter->fcoe.ddp_pool) { : struct ixgbe_fcoe *fcoe = &adapter->fcoe; : struct ixgbe_fcoe_ddp_pool *ddp_pool; : unsigned int cpu; : u64 noddp = 0, noddp_ext_buff = 0; : for_each_possible_cpu(cpu) { 0.00 : 2726: 39 05 00 00 00 00 cmp %eax,0x0(%rip) # 272c 0.00 : 272c: 89 c1 mov %eax,%ecx 0.00 : 272e: 77 c8 ja 26f8 : ddp_pool = per_cpu_ptr(fcoe->ddp_pool, cpu); : noddp += ddp_pool->noddp; : noddp_ext_buff += ddp_pool->noddp_ext_buff; : } : hwstats->fcoe_noddp = noddp; 0.00 : 2730: 4c 89 a3 b0 1a 00 00 mov %r12,0x1ab0(%rbx) : hwstats->fcoe_noddp_ext_buff = noddp_ext_buff; 0.00 : 2737: 48 89 ab b8 1a 00 00 mov %rbp,0x1ab8(%rbx) 0.00 : 273e: e9 96 f4 ff ff jmpq 1bd9 : : if ((hw->fc.current_mode != ixgbe_fc_full) && : (hw->fc.current_mode != ixgbe_fc_rx_pause)) : return; : : switch (hw->mac.type) { 0.00 : 2743: 83 bb 50 10 00 00 01 cmpl $0x1,0x1050(%rbx) 0.00 : 274a: 0f 84 ae 00 00 00 je 27fe 0.00 : 2750: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2757: 48 05 a8 41 00 00 add $0x41a8,%rax 0.00 : 275d: 8b 10 mov (%rax),%edx : data = IXGBE_READ_REG(hw, IXGBE_LXOFFRXC); : break; : default: : data = IXGBE_READ_REG(hw, IXGBE_LXOFFRXCNT); : } : hwstats->lxoffrxc += data; 0.00 : 275f: 89 d0 mov %edx,%eax 0.00 : 2761: 48 01 83 48 15 00 00 add %rax,0x1548(%rbx) : : /* refill credits (no tx hang) if we received xoff */ : if (!data) 0.00 : 2768: 85 d2 test %edx,%edx 0.00 : 276a: 0f 84 c0 f3 ff ff je 1b30 : return; : : for (i = 0; i < adapter->num_tx_queues; i++) 0.00 : 2770: 8b 93 20 02 00 00 mov 0x220(%rbx),%edx 0.00 : 2776: 85 d2 test %edx,%edx 0.00 : 2778: 0f 8e b2 f3 ff ff jle 1b30 0.00 : 277e: 31 c9 xor %ecx,%ecx : */ : static __always_inline void : clear_bit(int nr, volatile unsigned long *addr) : { : if (IS_IMMEDIATE(nr)) { : asm volatile(LOCK_PREFIX "andb %1,%0" 0.00 : 2780: 48 8b 97 80 02 00 00 mov 0x280(%rdi),%rdx 0.00 : 2787: 48 8d 42 30 lea 0x30(%rdx),%rax 0.00 : 278b: f0 80 62 30 fb lock andb $0xfb,0x30(%rdx) 0.00 : 2790: 83 c1 01 add $0x1,%ecx 0.00 : 2793: 48 83 c7 08 add $0x8,%rdi 0.00 : 2797: 3b 8b 20 02 00 00 cmp 0x220(%rbx),%ecx 0.00 : 279d: 7c e1 jl 2780 0.00 : 279f: e9 8c f3 ff ff jmpq 1b30 : } : bprc = IXGBE_READ_REG(hw, IXGBE_BPRC); : hwstats->bprc += bprc; : hwstats->mprc += IXGBE_READ_REG(hw, IXGBE_MPRC); : if (hw->mac.type == ixgbe_mac_82598EB) : hwstats->mprc -= bprc; 0.00 : 27a4: 48 29 c8 sub %rcx,%rax 0.00 : 27a7: 48 89 83 90 16 00 00 mov %rax,0x1690(%rbx) 0.00 : 27ae: e9 6d f4 ff ff jmpq 1c20 : } : hwstats->pxoffrxc[i] += xoff[i]; : } : : /* disarm tx queues that have received xoff frames */ : for (i = 0; i < adapter->num_tx_queues; i++) { 0.00 : 27b3: 8b 83 20 02 00 00 mov 0x220(%rbx),%eax 0.00 : 27b9: 85 c0 test %eax,%eax 0.00 : 27bb: 0f 8e 6f f3 ff ff jle 1b30 0.00 : 27c1: 31 c9 xor %ecx,%ecx 0.00 : 27c3: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : struct ixgbe_ring *tx_ring = adapter->tx_ring[i]; 0.00 : 27c8: 48 8b 97 80 02 00 00 mov 0x280(%rdi),%rdx : u8 tc = tx_ring->dcb_tc; 0.00 : 27cf: 0f b6 42 56 movzbl 0x56(%rdx),%eax : : if ((tc <= 7) && (xoff[tc])) 0.00 : 27d3: 3c 07 cmp $0x7,%al 0.00 : 27d5: 77 13 ja 27ea 0.00 : 27d7: 0f b6 c0 movzbl %al,%eax 0.00 : 27da: 8b 04 84 mov (%rsp,%rax,4),%eax 0.00 : 27dd: 85 c0 test %eax,%eax 0.00 : 27df: 74 09 je 27ea 0.00 : 27e1: 48 8d 42 30 lea 0x30(%rdx),%rax 0.00 : 27e5: f0 80 62 30 fb lock andb $0xfb,0x30(%rdx) : } : hwstats->pxoffrxc[i] += xoff[i]; : } : : /* disarm tx queues that have received xoff frames */ : for (i = 0; i < adapter->num_tx_queues; i++) { 0.00 : 27ea: 83 c1 01 add $0x1,%ecx 0.00 : 27ed: 48 83 c7 08 add $0x8,%rdi 0.00 : 27f1: 3b 8b 20 02 00 00 cmp 0x220(%rbx),%ecx 0.00 : 27f7: 7c cf jl 27c8 0.00 : 27f9: e9 32 f3 ff ff jmpq 1b30 0.00 : 27fe: 48 8b 83 80 0e 00 00 mov 0xe80(%rbx),%rax 0.00 : 2805: 48 05 68 cf 00 00 add $0xcf68,%rax 0.00 : 280b: 8b 10 mov (%rax),%edx 0.00 : 280d: e9 4d ff ff ff jmpq 275f : } : adapter->lro_stats.flushed = flushed; : adapter->lro_stats.coal = coal; : : #endif : for (i = 0; i < adapter->num_rx_queues; i++) { 0.00 : 2812: 45 31 d2 xor %r10d,%r10d 0.00 : 2815: 45 31 c9 xor %r9d,%r9d 0.00 : 2818: 45 31 c0 xor %r8d,%r8d 0.00 : 281b: 31 ff xor %edi,%edi 0.00 : 281d: 31 d2 xor %edx,%edx 0.00 : 281f: 31 c0 xor %eax,%eax 0.00 : 2821: e9 d8 f0 ff ff jmpq 18fe : net_stats->rx_packets = packets; : : bytes = 0; : packets = 0; : /* gather some stats to the adapter struct that are per queue */ : for (i = 0; i < adapter->num_tx_queues; i++) { 0.00 : 2826: 45 31 c0 xor %r8d,%r8d 0.00 : 2829: 31 ff xor %edi,%edi 0.00 : 282b: 31 f6 xor %esi,%esi 0.00 : 282d: 31 c9 xor %ecx,%ecx 0.00 : 282f: e9 3d f1 ff ff jmpq 1971 : : Disassembly of section .devinit.text: : : 0000000000001800 : : struct ixgbe_option opt = { : .type = enable_option, : .name = "Enabled/Disable FCoE offload", : .err = "defaulting to Enabled", : .def = OPTION_ENABLED : }; 0.00 : 1800: 48 c7 44 24 70 00 00 movq $0x0,0x70(%rsp) 0.00 : 1807: 00 00 0.00 : 1809: c7 44 24 78 01 00 00 movl $0x1,0x78(%rsp) 0.00 : 1810: 00 : #ifdef module_param_array : if (num_FCoE > bd) { 0.00 : 1811: 0f 82 f7 05 00 00 jb 1e0e : if (fcoe) : *aflags |= IXGBE_FLAG_FCOE_CAPABLE; : #ifdef module_param_array : } else { : if (opt.def == OPTION_ENABLED) : *aflags |= IXGBE_FLAG_FCOE_CAPABLE; 0.00 : 1817: 81 8b 18 02 00 00 00 orl $0x20000,0x218(%rbx) 0.00 : 181e: 00 02 00 : } : #endif : DPRINTK(PROBE, INFO, "FCoE Offload feature %sabled\n", 0.00 : 1821: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) 0.00 : 1828: 0f 85 a6 05 00 00 jne 1dd4 : struct ixgbe_option opt = { : .type = enable_option, : .name = "LRO - Large Receive Offload", : .err = "defaulting to Enabled", : .def = OPTION_ENABLED : }; 0.00 : 182e: 48 8d 54 24 30 lea 0x30(%rsp),%rdx 0.00 : 1833: 31 c0 xor %eax,%eax 0.00 : 1835: b9 06 00 00 00 mov $0x6,%ecx : if (!(adapter->flags2 & IXGBE_FLAG2_RSC_CAPABLE)) : opt.def = OPTION_DISABLED; : : #endif : #ifdef module_param_array : if (num_LRO > bd) { 0.00 : 183a: 44 3b 25 00 00 00 00 cmp 0x0(%rip),%r12d # 1841 : struct ixgbe_option opt = { : .type = enable_option, : .name = "LRO - Large Receive Offload", : .err = "defaulting to Enabled", : .def = OPTION_ENABLED : }; 0.00 : 1841: 48 89 d7 mov %rdx,%rdi 0.00 : 1844: f3 48 ab rep stos %rax,%es:(%rdi) 0.00 : 1847: 48 c7 44 24 38 00 00 movq $0x0,0x38(%rsp) 0.00 : 184e: 00 00 0.00 : 1850: 48 c7 44 24 40 00 00 movq $0x0,0x40(%rsp) 0.00 : 1857: 00 00 0.00 : 1859: c7 44 24 48 01 00 00 movl $0x1,0x48(%rsp) 0.00 : 1860: 00 : struct net_device *netdev = adapter->netdev; 0.00 : 1861: 48 8b ab 00 02 00 00 mov 0x200(%rbx),%rbp : if (!(adapter->flags2 & IXGBE_FLAG2_RSC_CAPABLE)) : opt.def = OPTION_DISABLED; : : #endif : #ifdef module_param_array : if (num_LRO > bd) { 0.00 : 1868: 0f 82 e0 00 00 00 jb 194e : netdev->features |= NETIF_F_LRO; : else : netdev->features &= ~NETIF_F_LRO; : #ifdef module_param_array : } else if (opt.def == OPTION_ENABLED) { : netdev->features |= NETIF_F_LRO; 0.00 : 186e: 81 8d b0 00 00 00 00 orl $0x8000,0xb0(%rbp) 0.00 : 1875: 80 00 00 : struct ixgbe_option opt = { : .type = enable_option, : .name = "allow_unsupported_sfp", : .err = "defaulting to Disabled", : .def = OPTION_DISABLED : }; 0.00 : 1878: 31 c0 xor %eax,%eax : #ifdef module_param_array : if (num_allow_unsupported_sfp > bd) { 0.00 : 187a: 44 3b 25 00 00 00 00 cmp 0x0(%rip),%r12d # 1881 : struct ixgbe_option opt = { : .type = enable_option, : .name = "allow_unsupported_sfp", : .err = "defaulting to Disabled", : .def = OPTION_DISABLED : }; 0.00 : 1881: b9 06 00 00 00 mov $0x6,%ecx 0.00 : 1886: 48 89 e7 mov %rsp,%rdi 0.00 : 1889: f3 48 ab rep stos %rax,%es:(%rdi) 0.00 : 188c: 48 c7 44 24 08 00 00 movq $0x0,0x8(%rsp) 0.00 : 1893: 00 00 0.00 : 1895: 48 c7 44 24 10 00 00 movq $0x0,0x10(%rsp) 0.00 : 189c: 00 00 : #ifdef module_param_array : if (num_allow_unsupported_sfp > bd) { 0.00 : 189e: 72 7a jb 191a : } else { : adapter->hw.allow_unsupported_sfp = false; : } : #ifdef module_param_array : } else if (opt.def == OPTION_ENABLED) { : adapter->hw.allow_unsupported_sfp = true; 0.00 : 18a0: 83 7c 24 18 01 cmpl $0x1,0x18(%rsp) 0.00 : 18a5: 0f 94 83 a1 14 00 00 sete 0x14a1(%rbx) : } else { : adapter->hw.allow_unsupported_sfp = false; : } : #endif : } : } 0.00 : 18ac: 48 81 c4 a8 00 00 00 add $0xa8,%rsp 0.00 : 18b3: 5b pop %rbx 0.00 : 18b4: 5d pop %rbp 0.00 : 18b5: 41 5c pop %r12 0.00 : 18b7: 41 5d pop %r13 0.00 : 18b9: c3 retq : adapter->atr_sample_rate = IXGBE_ATR_SAMPLE_RATE_OFF; : } else if (num_AtrSampleRate > bd) { : adapter->atr_sample_rate = AtrSampleRate[bd]; : : if (adapter->atr_sample_rate) { : ixgbe_validate_option(&adapter->atr_sample_rate, 0.00 : 18ba: 48 8d bb dc 1b 00 00 lea 0x1bdc(%rbx),%rdi 0.00 : 18c1: 48 c7 c6 00 00 00 00 mov $0x0,%rsi 0.00 : 18c8: e8 23 fa ff ff callq 12f0 : &opt); : DPRINTK(PROBE, INFO, "%s %d\n", atr_string, 0.00 : 18cd: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) 0.00 : 18d4: 0f 84 ec fe ff ff je 17c6 0.00 : 18da: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 18e1: 44 8b 83 dc 1b 00 00 mov 0x1bdc(%rbx),%r8d 0.00 : 18e8: 48 c7 c1 00 00 00 00 mov $0x0,%rcx 0.00 : 18ef: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 18f6: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 18fd: 31 c0 xor %eax,%eax 0.00 : 18ff: e8 00 00 00 00 callq 1904 0.00 : 1904: e9 bd fe ff ff jmpq 17c6 : adapter->atr_sample_rate); : } : } else { : adapter->atr_sample_rate = opt.def; 0.00 : 1909: 8b 05 00 00 00 00 mov 0x0(%rip),%eax # 190f 0.00 : 190f: 89 83 dc 1b 00 00 mov %eax,0x1bdc(%rbx) 0.00 : 1915: e9 ac fe ff ff jmpq 17c6 : }; : #ifdef module_param_array : if (num_allow_unsupported_sfp > bd) { : #endif : unsigned int enable_unsupported_sfp = : allow_unsupported_sfp[bd]; 0.00 : 191a: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 1921: 00 : ixgbe_validate_option(&enable_unsupported_sfp, &opt); 0.00 : 1922: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1929: 00 0.00 : 192a: 48 89 e6 mov %rsp,%rsi : }; : #ifdef module_param_array : if (num_allow_unsupported_sfp > bd) { : #endif : unsigned int enable_unsupported_sfp = : allow_unsupported_sfp[bd]; 0.00 : 192d: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : ixgbe_validate_option(&enable_unsupported_sfp, &opt); 0.00 : 1934: e8 b7 f9 ff ff callq 12f0 : if (enable_unsupported_sfp) { : adapter->hw.allow_unsupported_sfp = true; 0.00 : 1939: 8b 84 24 9c 00 00 00 mov 0x9c(%rsp),%eax 0.00 : 1940: 85 c0 test %eax,%eax 0.00 : 1942: 0f 95 83 a1 14 00 00 setne 0x14a1(%rbx) 0.00 : 1949: e9 5e ff ff ff jmpq 18ac : : #endif : #ifdef module_param_array : if (num_LRO > bd) { : #endif : unsigned int lro = LRO[bd]; 0.00 : 194e: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 1955: 00 : ixgbe_validate_option(&lro, &opt); 0.00 : 1956: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 195d: 00 0.00 : 195e: 48 89 d6 mov %rdx,%rsi : : #endif : #ifdef module_param_array : if (num_LRO > bd) { : #endif : unsigned int lro = LRO[bd]; 0.00 : 1961: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : ixgbe_validate_option(&lro, &opt); 0.00 : 1968: e8 83 f9 ff ff callq 12f0 : if (lro) 0.00 : 196d: 8b 94 24 9c 00 00 00 mov 0x9c(%rsp),%edx 0.00 : 1974: 85 d2 test %edx,%edx 0.00 : 1976: 0f 85 f2 fe ff ff jne 186e : netdev->features |= NETIF_F_LRO; : else : netdev->features &= ~NETIF_F_LRO; 0.00 : 197c: 81 a5 b0 00 00 00 ff andl $0xffff7fff,0xb0(%rbp) 0.00 : 1983: 7f ff ff 0.00 : 1986: e9 ed fe ff ff jmpq 1878 : }; : static const char atr_string[] = : "ATR Tx Packet sample rate set to"; : : if (adapter->hw.mac.type == ixgbe_mac_82598EB) { : adapter->atr_sample_rate = IXGBE_ATR_SAMPLE_RATE_OFF; 0.00 : 198b: c7 83 dc 1b 00 00 00 movl $0x0,0x1bdc(%rbx) 0.00 : 1992: 00 00 00 0.00 : 1995: e9 2c fe ff ff jmpq 17c6 : char pstring[10]; : : if (adapter->hw.mac.type == ixgbe_mac_82598EB) { : adapter->fdir_pballoc = IXGBE_FDIR_PBALLOC_NONE; : } else if (num_FdirPballoc > bd) { : fdir_pballoc_mode = FdirPballoc[bd]; 0.00 : 199a: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 19a1: 00 : ixgbe_validate_option(&fdir_pballoc_mode, &opt); 0.00 : 19a2: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 19a9: 00 0.00 : 19aa: 48 c7 c6 00 00 00 00 mov $0x0,%rsi : char pstring[10]; : : if (adapter->hw.mac.type == ixgbe_mac_82598EB) { : adapter->fdir_pballoc = IXGBE_FDIR_PBALLOC_NONE; : } else if (num_FdirPballoc > bd) { : fdir_pballoc_mode = FdirPballoc[bd]; 0.00 : 19b1: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : ixgbe_validate_option(&fdir_pballoc_mode, &opt); 0.00 : 19b8: e8 33 f9 ff ff callq 12f0 : switch (fdir_pballoc_mode) { 0.00 : 19bd: 8b 84 24 9c 00 00 00 mov 0x9c(%rsp),%eax 0.00 : 19c4: 83 f8 02 cmp $0x2,%eax 0.00 : 19c7: 0f 84 bf 00 00 00 je 1a8c 0.00 : 19cd: 83 f8 03 cmp $0x3,%eax 0.00 : 19d0: 0f 84 8a 00 00 00 je 1a60 : sprintf(pstring, "128kB"); : break; : case IXGBE_FDIR_PBALLOC_64K: : default: : adapter->fdir_pballoc = IXGBE_FDIR_PBALLOC_64K; : sprintf(pstring, "64kB"); 0.00 : 19d6: 48 8d 8c 24 90 00 00 lea 0x90(%rsp),%rcx 0.00 : 19dd: 00 : adapter->fdir_pballoc = IXGBE_FDIR_PBALLOC_128K; : sprintf(pstring, "128kB"); : break; : case IXGBE_FDIR_PBALLOC_64K: : default: : adapter->fdir_pballoc = IXGBE_FDIR_PBALLOC_64K; 0.00 : 19de: c7 83 d8 1b 00 00 01 movl $0x1,0x1bd8(%rbx) 0.00 : 19e5: 00 00 00 : sprintf(pstring, "64kB"); 33.33 : 19e8: c7 84 24 90 00 00 00 movl $0x426b3436,0x90(%rsp) 0.00 : 19ef: 36 34 6b 42 0.00 : 19f3: c6 84 24 94 00 00 00 movb $0x0,0x94(%rsp) 0.00 : 19fa: 00 : break; : } : DPRINTK(PROBE, INFO, "Flow Director will be allocated " 0.00 : 19fb: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) 0.00 : 1a02: 0f 84 8e fd ff ff je 1796 0.00 : 1a08: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1a0f: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1a16: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1a1d: 31 c0 xor %eax,%eax 0.00 : 1a1f: e8 00 00 00 00 callq 1a24 0.00 : 1a24: e9 6d fd ff ff jmpq 1796 : .max = IXGBE_FDIR_PBALLOC_256K} } : }; : char pstring[10]; : : if (adapter->hw.mac.type == ixgbe_mac_82598EB) { : adapter->fdir_pballoc = IXGBE_FDIR_PBALLOC_NONE; 0.00 : 1a29: c7 83 d8 1b 00 00 00 movl $0x0,0x1bd8(%rbx) 0.00 : 1a30: 00 00 00 0.00 : 1a33: e9 5e fd ff ff jmpq 1796 : adapter->lli_vlan_pri = LLIVLANP[bd]; : if (adapter->lli_vlan_pri) { : ixgbe_validate_option(&adapter->lli_vlan_pri, : &opt); : } else { : DPRINTK(PROBE, INFO, "%s turned off\n", 0.00 : 1a38: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1a3f: 48 8b 0d 00 00 00 00 mov 0x0(%rip),%rcx # 1a46 0.00 : 1a46: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1a4d: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1a54: 31 c0 xor %eax,%eax 0.00 : 1a56: e8 00 00 00 00 callq 1a5b 0.00 : 1a5b: e9 10 fd ff ff jmpq 1770 : } else if (num_FdirPballoc > bd) { : fdir_pballoc_mode = FdirPballoc[bd]; : ixgbe_validate_option(&fdir_pballoc_mode, &opt); : switch (fdir_pballoc_mode) { : case IXGBE_FDIR_PBALLOC_256K: : adapter->fdir_pballoc = IXGBE_FDIR_PBALLOC_256K; 0.00 : 1a60: c7 83 d8 1b 00 00 03 movl $0x3,0x1bd8(%rbx) 0.00 : 1a67: 00 00 00 : sprintf(pstring, "256kB"); 0.00 : 1a6a: 48 8d 8c 24 90 00 00 lea 0x90(%rsp),%rcx 0.00 : 1a71: 00 0.00 : 1a72: c7 84 24 90 00 00 00 movl $0x6b363532,0x90(%rsp) 0.00 : 1a79: 32 35 36 6b 0.00 : 1a7d: 66 c7 84 24 94 00 00 movw $0x42,0x94(%rsp) 0.00 : 1a84: 00 42 00 : break; 0.00 : 1a87: e9 6f ff ff ff jmpq 19fb : case IXGBE_FDIR_PBALLOC_128K: : adapter->fdir_pballoc = IXGBE_FDIR_PBALLOC_128K; 0.00 : 1a8c: c7 83 d8 1b 00 00 02 movl $0x2,0x1bd8(%rbx) 0.00 : 1a93: 00 00 00 : sprintf(pstring, "128kB"); 0.00 : 1a96: 48 8d 8c 24 90 00 00 lea 0x90(%rsp),%rcx 0.00 : 1a9d: 00 0.00 : 1a9e: c7 84 24 90 00 00 00 movl $0x6b383231,0x90(%rsp) 0.00 : 1aa5: 31 32 38 6b 0.00 : 1aa9: 66 c7 84 24 94 00 00 movw $0x42,0x94(%rsp) 0.00 : 1ab0: 00 42 00 : break; 0.00 : 1ab3: e9 43 ff ff ff jmpq 19fb : #ifdef module_param_array : if (num_LLIVLANP > bd) { : #endif : adapter->lli_vlan_pri = LLIVLANP[bd]; : if (adapter->lli_vlan_pri) { : ixgbe_validate_option(&adapter->lli_vlan_pri, 0.00 : 1ab8: 48 8d bb fc 1a 00 00 lea 0x1afc(%rbx),%rdi 0.00 : 1abf: 48 c7 c6 00 00 00 00 mov $0x0,%rsi 0.00 : 1ac6: e8 25 f8 ff ff callq 12f0 0.00 : 1acb: e9 a0 fc ff ff jmpq 1770 : DPRINTK(PROBE, INFO, "%s turned off\n", : opt.name); : } : #ifdef module_param_array : } else { : adapter->lli_vlan_pri = opt.def; 0.00 : 1ad0: 8b 05 00 00 00 00 mov 0x0(%rip),%eax # 1ad6 0.00 : 1ad6: 89 83 fc 1a 00 00 mov %eax,0x1afc(%rbx) 0.00 : 1adc: e9 8f fc ff ff jmpq 1770 : adapter->lli_etype = LLIEType[bd]; : if (adapter->lli_etype) { : ixgbe_validate_option(&adapter->lli_etype, : &opt); : } else { : DPRINTK(PROBE, INFO, "%s turned off\n", 0.00 : 1ae1: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1ae8: 48 8b 0d 00 00 00 00 mov 0x0(%rip),%rcx # 1aef 0.00 : 1aef: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1af6: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1afd: 31 c0 xor %eax,%eax 0.00 : 1aff: e8 00 00 00 00 callq 1b04 0.00 : 1b04: e9 37 fc ff ff jmpq 1740 : #ifdef module_param_array : if (num_LLIEType > bd) { : #endif : adapter->lli_etype = LLIEType[bd]; : if (adapter->lli_etype) { : ixgbe_validate_option(&adapter->lli_etype, 0.00 : 1b09: 48 8d bb f8 1a 00 00 lea 0x1af8(%rbx),%rdi 0.00 : 1b10: 48 c7 c6 00 00 00 00 mov $0x0,%rsi 0.00 : 1b17: e8 d4 f7 ff ff callq 12f0 0.00 : 1b1c: e9 1f fc ff ff jmpq 1740 : DPRINTK(PROBE, INFO, "%s turned off\n", : opt.name); : } : #ifdef module_param_array : } else { : adapter->lli_etype = opt.def; 0.00 : 1b21: 8b 05 00 00 00 00 mov 0x0(%rip),%eax # 1b27 0.00 : 1b27: 89 83 f8 1a 00 00 mov %eax,0x1af8(%rbx) 0.00 : 1b2d: e9 0e fc ff ff jmpq 1740 : }; : : #ifdef module_param_array : if (num_LLIPush > bd) { : #endif : unsigned int lli_push = LLIPush[bd]; 0.00 : 1b32: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 1b39: 00 : ixgbe_validate_option(&lli_push, &opt); 0.00 : 1b3a: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1b41: 00 0.00 : 1b42: 48 c7 c6 00 00 00 00 mov $0x0,%rsi : }; : : #ifdef module_param_array : if (num_LLIPush > bd) { : #endif : unsigned int lli_push = LLIPush[bd]; 0.00 : 1b49: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : ixgbe_validate_option(&lli_push, &opt); 0.00 : 1b50: e8 9b f7 ff ff callq 12f0 : if (lli_push) 0.00 : 1b55: 8b b4 24 9c 00 00 00 mov 0x9c(%rsp),%esi 0.00 : 1b5c: 85 f6 test %esi,%esi 0.00 : 1b5e: 0f 84 a5 fb ff ff je 1709 : else : *aflags &= ~IXGBE_FLAG_LLI_PUSH; : #ifdef module_param_array : } else { : if (opt.def == OPTION_ENABLED) : *aflags |= IXGBE_FLAG_LLI_PUSH; 0.00 : 1b64: 83 8b 18 02 00 00 10 orl $0x10,0x218(%rbx) 0.00 : 1b6b: e9 a0 fb ff ff jmpq 1710 : #endif : adapter->lli_size = LLISize[bd]; : if (adapter->lli_size) { : ixgbe_validate_option(&adapter->lli_size, &opt); : } else { : DPRINTK(PROBE, INFO, "%s turned off\n", 0.00 : 1b70: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1b77: 48 8b 0d 00 00 00 00 mov 0x0(%rip),%rcx # 1b7e 0.00 : 1b7e: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1b85: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1b8c: 31 c0 xor %eax,%eax 0.00 : 1b8e: e8 00 00 00 00 callq 1b93 0.00 : 1b93: e9 57 fb ff ff jmpq 16ef : #ifdef module_param_array : if (num_LLISize > bd) { : #endif : adapter->lli_size = LLISize[bd]; : if (adapter->lli_size) { : ixgbe_validate_option(&adapter->lli_size, &opt); 0.00 : 1b98: 48 8d bb f4 1a 00 00 lea 0x1af4(%rbx),%rdi 0.00 : 1b9f: 48 c7 c6 00 00 00 00 mov $0x0,%rsi 0.00 : 1ba6: e8 45 f7 ff ff callq 12f0 0.00 : 1bab: e9 3f fb ff ff jmpq 16ef : DPRINTK(PROBE, INFO, "%s turned off\n", : opt.name); : } : #ifdef module_param_array : } else { : adapter->lli_size = opt.def; 0.00 : 1bb0: 8b 05 00 00 00 00 mov 0x0(%rip),%eax # 1bb6 0.00 : 1bb6: 89 83 f4 1a 00 00 mov %eax,0x1af4(%rbx) 0.00 : 1bbc: e9 2e fb ff ff jmpq 16ef : #endif : adapter->lli_port = LLIPort[bd]; : if (adapter->lli_port) { : ixgbe_validate_option(&adapter->lli_port, &opt); : } else { : DPRINTK(PROBE, INFO, "%s turned off\n", 0.00 : 1bc1: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1bc8: 48 8b 0d 00 00 00 00 mov 0x0(%rip),%rcx # 1bcf 0.00 : 1bcf: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1bd6: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1bdd: 31 c0 xor %eax,%eax 0.00 : 1bdf: e8 00 00 00 00 callq 1be4 0.00 : 1be4: e9 d6 fa ff ff jmpq 16bf : #ifdef module_param_array : if (num_LLIPort > bd) { : #endif : adapter->lli_port = LLIPort[bd]; : if (adapter->lli_port) { : ixgbe_validate_option(&adapter->lli_port, &opt); 0.00 : 1be9: 48 8d bb f0 1a 00 00 lea 0x1af0(%rbx),%rdi 0.00 : 1bf0: 48 c7 c6 00 00 00 00 mov $0x0,%rsi 0.00 : 1bf7: e8 f4 f6 ff ff callq 12f0 0.00 : 1bfc: e9 be fa ff ff jmpq 16bf : DPRINTK(PROBE, INFO, "%s turned off\n", : opt.name); : } : #ifdef module_param_array : } else { : adapter->lli_port = opt.def; 0.00 : 1c01: 8b 05 00 00 00 00 mov 0x0(%rip),%eax # 1c07 0.00 : 1c07: 89 83 f0 1a 00 00 mov %eax,0x1af0(%rbx) 0.00 : 1c0d: e9 ad fa ff ff jmpq 16bf : if (num_InterruptThrottleRate > bd) { : #endif : u32 itr = InterruptThrottleRate[bd]; : switch (itr) { : case 0: : DPRINTK(PROBE, INFO, "%s turned off\n", 0.00 : 1c12: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1c19: 48 8b 0d 00 00 00 00 mov 0x0(%rip),%rcx # 1c20 0.00 : 1c20: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1c27: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1c2e: 31 c0 xor %eax,%eax 0.00 : 1c30: e8 00 00 00 00 callq 1c35 0.00 : 1c35: e9 3e fa ff ff jmpq 1678 : : #ifdef module_param_array : if (num_InterruptThrottleRate > bd) { : #endif : u32 itr = InterruptThrottleRate[bd]; : switch (itr) { 0.00 : 1c3a: 83 e8 01 sub $0x1,%eax 0.00 : 1c3d: 74 50 je 1c8f : DPRINTK(PROBE, INFO, "dynamic interrupt " : "throttling enabled\n"); : adapter->rx_itr_setting = 1; : break; : default: : ixgbe_validate_option(&itr, &opt); 0.00 : 1c3f: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1c46: 00 0.00 : 1c47: 48 c7 c6 00 00 00 00 mov $0x0,%rsi 0.00 : 1c4e: e8 9d f6 ff ff callq 12f0 : /* the first bit is used as control */ : adapter->rx_itr_setting = (1000000/itr) << 2; 0.00 : 1c53: b8 40 42 0f 00 mov $0xf4240,%eax 0.00 : 1c58: 31 d2 xor %edx,%edx 0.00 : 1c5a: f7 b4 24 9c 00 00 00 divl 0x9c(%rsp) 0.00 : 1c61: c1 e0 02 shl $0x2,%eax 0.00 : 1c64: 66 89 83 2c 02 00 00 mov %ax,0x22c(%rbx) 0.00 : 1c6b: e9 11 fa ff ff jmpq 1681 : break; : } : adapter->tx_itr_setting = adapter->rx_itr_setting; : #ifdef module_param_array : } else { : adapter->rx_itr_setting = opt.def; 0.00 : 1c70: 8b 05 00 00 00 00 mov 0x0(%rip),%eax # 1c76 0.00 : 1c76: 66 89 83 2c 02 00 00 mov %ax,0x22c(%rbx) : adapter->tx_itr_setting = opt.def; 0.00 : 1c7d: 8b 05 00 00 00 00 mov 0x0(%rip),%eax # 1c83 0.00 : 1c83: 66 89 83 24 02 00 00 mov %ax,0x224(%rbx) 0.00 : 1c8a: e9 00 fa ff ff jmpq 168f : DPRINTK(PROBE, INFO, "%s turned off\n", : opt.name); : adapter->rx_itr_setting = 0; : break; : case 1: : DPRINTK(PROBE, INFO, "dynamic interrupt " 0.00 : 1c8f: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) 0.00 : 1c96: 0f 85 a5 01 00 00 jne 1e41 : "throttling enabled\n"); : adapter->rx_itr_setting = 1; 0.00 : 1c9c: 66 c7 83 2c 02 00 00 movw $0x1,0x22c(%rbx) 0.00 : 1ca3: 01 00 : break; 0.00 : 1ca5: e9 d7 f9 ff ff jmpq 1681 : }; : : #ifdef module_param_array : if (num_L2LBen > bd) { : #endif : unsigned int l2LBen = L2LBen[bd]; 0.00 : 1caa: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 1cb1: 00 : ixgbe_validate_option(&l2LBen, &opt); 0.00 : 1cb2: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1cb9: 00 0.00 : 1cba: 48 c7 c6 00 00 00 00 mov $0x0,%rsi : }; : : #ifdef module_param_array : if (num_L2LBen > bd) { : #endif : unsigned int l2LBen = L2LBen[bd]; 0.00 : 1cc1: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : ixgbe_validate_option(&l2LBen, &opt); 0.00 : 1cc8: e8 23 f6 ff ff callq 12f0 : if (l2LBen) 0.00 : 1ccd: 8b bc 24 9c 00 00 00 mov 0x9c(%rsp),%edi 0.00 : 1cd4: 85 ff test %edi,%edi 0.00 : 1cd6: 0f 84 6b f9 ff ff je 1647 : adapter->flags |= : IXGBE_FLAG_SRIOV_L2LOOPBACK_ENABLE; : #ifdef module_param_array : } else { : if (opt.def == OPTION_ENABLED) : adapter->flags |= 0.00 : 1cdc: 81 8b 18 02 00 00 00 orl $0x800000,0x218(%rbx) 0.00 : 1ce3: 00 80 00 0.00 : 1ce6: e9 5c f9 ff ff jmpq 1647 : } else { : if (opt.def == OPTION_DISABLED) { : adapter->num_vfs = 0; : *aflags &= ~IXGBE_FLAG_SRIOV_ENABLED; : } else { : adapter->num_vfs = opt.def; 0.00 : 1ceb: 89 83 58 7c 00 00 mov %eax,0x7c58(%rbx) : *aflags |= IXGBE_FLAG_SRIOV_ENABLED; 0.00 : 1cf1: 81 8b 18 02 00 00 00 orl $0x100000,0x218(%rbx) 0.00 : 1cf8: 00 10 00 0.00 : 1cfb: e9 f3 f8 ff ff jmpq 15f3 : }; : : #ifdef module_param_array : if (num_max_vfs > bd) { : #endif : unsigned int vfs = max_vfs[bd]; 0.00 : 1d00: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 1d07: 00 : if (ixgbe_validate_option(&vfs, &opt)) { 0.00 : 1d08: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1d0f: 00 0.00 : 1d10: 48 c7 c6 00 00 00 00 mov $0x0,%rsi : }; : : #ifdef module_param_array : if (num_max_vfs > bd) { : #endif : unsigned int vfs = max_vfs[bd]; 0.00 : 1d17: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : if (ixgbe_validate_option(&vfs, &opt)) { 0.00 : 1d1e: e8 cd f5 ff ff callq 12f0 0.00 : 1d23: 85 c0 test %eax,%eax 0.00 : 1d25: 74 14 je 1d3b : vfs = 0; : DPRINTK(PROBE, INFO, 0.00 : 1d27: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) : #ifdef module_param_array : if (num_max_vfs > bd) { : #endif : unsigned int vfs = max_vfs[bd]; : if (ixgbe_validate_option(&vfs, &opt)) { : vfs = 0; 0.00 : 1d2e: c7 84 24 9c 00 00 00 movl $0x0,0x9c(%rsp) 0.00 : 1d35: 00 00 00 00 : DPRINTK(PROBE, INFO, 0.00 : 1d39: 75 17 jne 1d52 : "max_vfs out of range " : "Disabling SR-IOV.\n"); : } : : adapter->num_vfs = vfs; 0.00 : 1d3b: 8b 84 24 9c 00 00 00 mov 0x9c(%rsp),%eax : : if (vfs) 0.00 : 1d42: 85 c0 test %eax,%eax : DPRINTK(PROBE, INFO, : "max_vfs out of range " : "Disabling SR-IOV.\n"); : } : : adapter->num_vfs = vfs; 0.00 : 1d44: 89 83 58 7c 00 00 mov %eax,0x7c58(%rbx) : : if (vfs) 0.00 : 1d4a: 0f 84 99 f8 ff ff je 15e9 0.00 : 1d50: eb 9f jmp 1cf1 : if (num_max_vfs > bd) { : #endif : unsigned int vfs = max_vfs[bd]; : if (ixgbe_validate_option(&vfs, &opt)) { : vfs = 0; : DPRINTK(PROBE, INFO, 0.00 : 1d52: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1d59: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1d60: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1d67: 31 c0 xor %eax,%eax 0.00 : 1d69: e8 00 00 00 00 callq 1d6e 0.00 : 1d6e: eb cb jmp 1d3b : #endif : : /* Check Interoperability */ : if (*aflags & IXGBE_FLAG_SRIOV_ENABLED) { : if (!(*aflags & IXGBE_FLAG_SRIOV_CAPABLE)) { : DPRINTK(PROBE, INFO, 0.00 : 1d70: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1d77: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1d7e: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1d85: 31 c0 xor %eax,%eax 0.00 : 1d87: e8 00 00 00 00 callq 1d8c 0.00 : 1d8c: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax 0.00 : 1d92: e9 81 f8 ff ff jmpq 1618 : "IOV is not supported on this " : "hardware. Disabling IOV.\n"); : *aflags &= ~IXGBE_FLAG_SRIOV_ENABLED; : adapter->num_vfs = 0; : } else if (!(*aflags & IXGBE_FLAG_MQ_CAPABLE)) { 0.00 : 1d97: f6 c4 02 test $0x2,%ah 0.00 : 1d9a: 0f 85 8d f8 ff ff jne 162d : DPRINTK(PROBE, INFO, 0.00 : 1da0: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) 0.00 : 1da7: 0f 84 6b f8 ff ff je 1618 0.00 : 1dad: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1db4: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1dbb: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1dc2: 31 c0 xor %eax,%eax 0.00 : 1dc4: e8 00 00 00 00 callq 1dc9 0.00 : 1dc9: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax 0.00 : 1dcf: e9 44 f8 ff ff jmpq 1618 : } else { : if (opt.def == OPTION_ENABLED) : *aflags |= IXGBE_FLAG_FCOE_CAPABLE; : } : #endif : DPRINTK(PROBE, INFO, "FCoE Offload feature %sabled\n", 0.00 : 1dd4: f6 83 1a 02 00 00 02 testb $0x2,0x21a(%rbx) 0.00 : 1ddb: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1de2: 48 c7 c0 00 00 00 00 mov $0x0,%rax 0.00 : 1de9: 48 c7 c1 00 00 00 00 mov $0x0,%rcx 0.00 : 1df0: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1df7: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1dfe: 48 0f 45 c8 cmovne %rax,%rcx 0.00 : 1e02: 31 c0 xor %eax,%eax 0.00 : 1e04: e8 00 00 00 00 callq 1e09 0.00 : 1e09: e9 20 fa ff ff jmpq 182e : .def = OPTION_ENABLED : }; : #ifdef module_param_array : if (num_FCoE > bd) { : #endif : unsigned int fcoe = FCoE[bd]; 0.00 : 1e0e: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 1e15: 00 : : ixgbe_validate_option(&fcoe, &opt); 0.00 : 1e16: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1e1d: 00 0.00 : 1e1e: 48 89 d6 mov %rdx,%rsi : .def = OPTION_ENABLED : }; : #ifdef module_param_array : if (num_FCoE > bd) { : #endif : unsigned int fcoe = FCoE[bd]; 0.00 : 1e21: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : : ixgbe_validate_option(&fcoe, &opt); 0.00 : 1e28: e8 c3 f4 ff ff callq 12f0 : if (fcoe) 0.00 : 1e2d: 8b 8c 24 9c 00 00 00 mov 0x9c(%rsp),%ecx 0.00 : 1e34: 85 c9 test %ecx,%ecx 0.00 : 1e36: 0f 84 e5 f9 ff ff je 1821 0.00 : 1e3c: e9 d6 f9 ff ff jmpq 1817 : DPRINTK(PROBE, INFO, "%s turned off\n", : opt.name); : adapter->rx_itr_setting = 0; : break; : case 1: : DPRINTK(PROBE, INFO, "dynamic interrupt " 0.00 : 1e41: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1e48: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1e4f: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1e56: 31 c0 xor %eax,%eax 0.00 : 1e58: e8 00 00 00 00 callq 1e5d 0.00 : 1e5d: e9 3a fe ff ff jmpq 1c9c : #ifdef module_param_array : } else { : if (opt.def == OPTION_DISABLED) : *aflags &= ~IXGBE_FLAG_VMDQ_ENABLED; : else : *aflags |= IXGBE_FLAG_VMDQ_ENABLED; 0.00 : 1e62: 81 8b 18 02 00 00 00 orl $0x800,0x218(%rbx) 0.00 : 1e69: 08 00 00 0.00 : 1e6c: e9 17 f7 ff ff jmpq 1588 : } : : #ifdef module_param_array : if (num_VMDQ > bd) { : #endif : unsigned int vmdq = VMDQ[bd]; 0.00 : 1e71: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 1e78: 00 : : ixgbe_validate_option(&vmdq, &opt); 0.00 : 1e79: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1e80: 00 0.00 : 1e81: 48 c7 c6 00 00 00 00 mov $0x0,%rsi : } : : #ifdef module_param_array : if (num_VMDQ > bd) { : #endif : unsigned int vmdq = VMDQ[bd]; 0.00 : 1e88: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : : ixgbe_validate_option(&vmdq, &opt); 0.00 : 1e8f: e8 5c f4 ff ff callq 12f0 : : /* zero or one both mean disabled from our driver's : * perspective */ : if (vmdq > 1) 0.00 : 1e94: 83 bc 24 9c 00 00 00 cmpl $0x1,0x9c(%rsp) 0.00 : 1e9b: 01 0.00 : 1e9c: 76 6e jbe 1f0c : *aflags |= IXGBE_FLAG_VMDQ_ENABLED; 0.00 : 1e9e: 81 8b 18 02 00 00 00 orl $0x800,0x218(%rbx) 0.00 : 1ea5: 08 00 00 : else : *aflags &= ~IXGBE_FLAG_VMDQ_ENABLED; : : feature[RING_F_VMDQ].limit = vmdq; 0.00 : 1ea8: 8b 84 24 9c 00 00 00 mov 0x9c(%rsp),%eax 0.00 : 1eaf: 66 89 83 d0 0b 00 00 mov %ax,0xbd0(%rbx) 0.00 : 1eb6: e9 da f6 ff ff jmpq 1595 : feature[RING_F_FDIR].limit = rss; : : feature[RING_F_RSS].limit = rss; : #ifdef module_param_array : } else if (opt.def == 0) { : rss = min_t(int, IXGBE_MAX_RSS_INDICES, 0.00 : 1ebb: 48 8b 3d 00 00 00 00 mov 0x0(%rip),%rdi # 1ec2 0.00 : 1ec2: e8 00 00 00 00 callq 1ec7 0.00 : 1ec7: ba 10 00 00 00 mov $0x10,%edx 0.00 : 1ecc: 83 f8 10 cmp $0x10,%eax 0.00 : 1ecf: 0f 4e d0 cmovle %eax,%edx 0.00 : 1ed2: 89 94 24 9c 00 00 00 mov %edx,0x9c(%rsp) : num_online_cpus()); : feature[RING_F_RSS].limit = rss; 0.00 : 1ed9: 66 89 93 d8 0b 00 00 mov %dx,0xbd8(%rbx) 0.00 : 1ee0: e9 3a f6 ff ff jmpq 151f : } : #endif : /* Check Interoperability */ : if (*aflags & IXGBE_FLAG_VMDQ_ENABLED) { : if (!(*aflags & IXGBE_FLAG_MQ_CAPABLE)) { : DPRINTK(PROBE, INFO, 0.00 : 1ee5: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1eec: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 1ef3: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 1efa: 31 c0 xor %eax,%eax 0.00 : 1efc: e8 00 00 00 00 callq 1f01 0.00 : 1f01: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax 0.00 : 1f07: e9 a6 f6 ff ff jmpq 15b2 : /* zero or one both mean disabled from our driver's : * perspective */ : if (vmdq > 1) : *aflags |= IXGBE_FLAG_VMDQ_ENABLED; : else : *aflags &= ~IXGBE_FLAG_VMDQ_ENABLED; 0.00 : 1f0c: 81 a3 18 02 00 00 ff andl $0xfffff7ff,0x218(%rbx) 0.00 : 1f13: f7 ff ff 0.00 : 1f16: eb 90 jmp 1ea8 : unsigned int rss = RSS[bd]; : : #ifdef module_param_array : if (num_RSS > bd) { : #endif : ixgbe_validate_option(&rss, &opt); 0.00 : 1f18: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1f1f: 00 0.00 : 1f20: 48 c7 c6 00 00 00 00 mov $0x0,%rsi 0.00 : 1f27: e8 c4 f3 ff ff callq 12f0 : /* base it off num_online_cpus() with hardware limit */ : if (!rss) 0.00 : 1f2c: 8b 84 24 9c 00 00 00 mov 0x9c(%rsp),%eax 0.00 : 1f33: 85 c0 test %eax,%eax 0.00 : 1f35: 74 22 je 1f59 : rss = min_t(int, IXGBE_MAX_RSS_INDICES, : num_online_cpus()); : else : feature[RING_F_FDIR].limit = rss; 0.00 : 1f37: 66 89 83 e0 0b 00 00 mov %ax,0xbe0(%rbx) : : feature[RING_F_RSS].limit = rss; 0.00 : 1f3e: 66 89 83 d8 0b 00 00 mov %ax,0xbd8(%rbx) 0.00 : 1f45: e9 d5 f5 ff ff jmpq 151f : if (opt.def == OPTION_DISABLED) : *aflags &= ~IXGBE_FLAG_DCA_CAPABLE; : } : #endif : if (dca == IXGBE_MAX_DCA) : adapter->flags |= IXGBE_FLAG_DCA_ENABLED_DATA; 0.00 : 1f4a: 81 8b 18 02 00 00 00 orl $0x100,0x218(%rbx) 0.00 : 1f51: 01 00 00 0.00 : 1f54: e9 9a f5 ff ff jmpq 14f3 : if (num_RSS > bd) { : #endif : ixgbe_validate_option(&rss, &opt); : /* base it off num_online_cpus() with hardware limit */ : if (!rss) : rss = min_t(int, IXGBE_MAX_RSS_INDICES, 0.00 : 1f59: 48 8b 3d 00 00 00 00 mov 0x0(%rip),%rdi # 1f60 0.00 : 1f60: e8 00 00 00 00 callq 1f65 0.00 : 1f65: ba 10 00 00 00 mov $0x10,%edx 0.00 : 1f6a: 83 f8 10 cmp $0x10,%eax 0.00 : 1f6d: 0f 4e d0 cmovle %eax,%edx 0.00 : 1f70: 89 94 24 9c 00 00 00 mov %edx,0x9c(%rsp) 0.00 : 1f77: 89 d0 mov %edx,%eax 0.00 : 1f79: eb c3 jmp 1f3e : unsigned int dca = opt.def; : : #ifdef module_param_array : if (num_DCA > bd) { : #endif : dca = DCA[bd]; 0.00 : 1f7b: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 1f82: 00 : ixgbe_validate_option(&dca, &opt); 0.00 : 1f83: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 1f8a: 00 0.00 : 1f8b: 48 c7 c6 00 00 00 00 mov $0x0,%rsi : unsigned int dca = opt.def; : : #ifdef module_param_array : if (num_DCA > bd) { : #endif : dca = DCA[bd]; 0.00 : 1f92: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : ixgbe_validate_option(&dca, &opt); 0.00 : 1f99: e8 52 f3 ff ff callq 12f0 : if (!dca) 0.00 : 1f9e: 44 8b 9c 24 9c 00 00 mov 0x9c(%rsp),%r11d 0.00 : 1fa5: 00 0.00 : 1fa6: 45 85 db test %r11d,%r11d 0.00 : 1fa9: 75 0a jne 1fb5 : *aflags &= ~IXGBE_FLAG_DCA_CAPABLE; 0.00 : 1fab: 81 a3 18 02 00 00 7f andl $0xffffff7f,0x218(%rbx) 0.00 : 1fb2: ff ff ff : : /* Check Interoperability */ : if (!(*aflags & IXGBE_FLAG_DCA_CAPABLE)) { 0.00 : 1fb5: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax 0.00 : 1fbb: 84 c0 test %al,%al 0.00 : 1fbd: 78 12 js 1fd1 : DPRINTK(PROBE, INFO, "DCA is disabled\n"); 0.00 : 1fbf: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) 0.00 : 1fc6: 75 50 jne 2018 : *aflags &= ~IXGBE_FLAG_DCA_ENABLED; 0.00 : 1fc8: 83 e0 bf and $0xffffffbf,%eax 0.00 : 1fcb: 89 83 18 02 00 00 mov %eax,0x218(%rbx) : } : : if (dca == IXGBE_MAX_DCA) { 0.00 : 1fd1: 83 bc 24 9c 00 00 00 cmpl $0x2,0x9c(%rsp) 0.00 : 1fd8: 02 0.00 : 1fd9: 0f 85 14 f5 ff ff jne 14f3 : DPRINTK(PROBE, INFO, 0.00 : 1fdf: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) 0.00 : 1fe6: 75 54 jne 203c : "DCA enabled for rx data\n"); : adapter->flags |= IXGBE_FLAG_DCA_ENABLED_DATA; 0.00 : 1fe8: 81 8b 18 02 00 00 00 orl $0x100,0x218(%rbx) 0.00 : 1fef: 01 00 00 0.00 : 1ff2: e9 ee f4 ff ff jmpq 14e5 : } : #endif : /* Check Interoperability */ : if (rss > 1) { : if (!(*aflags & IXGBE_FLAG_MQ_CAPABLE)) { : DPRINTK(PROBE, INFO, 0.00 : 1ff7: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 1ffe: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 2005: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 200c: 31 c0 xor %eax,%eax 0.00 : 200e: e8 00 00 00 00 callq 2013 0.00 : 2013: e9 27 f5 ff ff jmpq 153f : if (!dca) : *aflags &= ~IXGBE_FLAG_DCA_CAPABLE; : : /* Check Interoperability */ : if (!(*aflags & IXGBE_FLAG_DCA_CAPABLE)) { : DPRINTK(PROBE, INFO, "DCA is disabled\n"); 0.00 : 2018: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 201f: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 2026: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 202d: 31 c0 xor %eax,%eax 0.00 : 202f: e8 00 00 00 00 callq 2034 0.00 : 2034: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax 0.00 : 203a: eb 8c jmp 1fc8 : *aflags &= ~IXGBE_FLAG_DCA_ENABLED; : } : : if (dca == IXGBE_MAX_DCA) { : DPRINTK(PROBE, INFO, 0.00 : 203c: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 2043: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 204a: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 2051: 31 c0 xor %eax,%eax 0.00 : 2053: e8 00 00 00 00 callq 2058 0.00 : 2058: eb 8e jmp 1fe8 : } : #endif : /* Check Interoperability */ : if ((*aflags & IXGBE_FLAG_MQ_CAPABLE) && : !(*aflags & IXGBE_FLAG_MSIX_CAPABLE)) { : DPRINTK(PROBE, INFO, 0.00 : 205a: f6 83 a8 14 00 00 02 testb $0x2,0x14a8(%rbx) 0.00 : 2061: 75 4f jne 20b2 : "Multiple queues are not supported while MSI-X " : "is disabled. Disabling Multiple Queues.\n"); : *aflags &= ~IXGBE_FLAG_MQ_CAPABLE; 0.00 : 2063: 80 e6 fd and $0xfd,%dh 0.00 : 2066: 89 93 18 02 00 00 mov %edx,0x218(%rbx) 0.00 : 206c: e9 44 f4 ff ff jmpq 14b5 : }; : : #ifdef module_param_array : if (num_MQ > bd) { : #endif : unsigned int mq = MQ[bd]; 0.00 : 2071: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 2078: 00 : ixgbe_validate_option(&mq, &opt); 0.00 : 2079: 48 8d bc 24 9c 00 00 lea 0x9c(%rsp),%rdi 0.00 : 2080: 00 0.00 : 2081: 48 c7 c6 00 00 00 00 mov $0x0,%rsi : }; : : #ifdef module_param_array : if (num_MQ > bd) { : #endif : unsigned int mq = MQ[bd]; 0.00 : 2088: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) : ixgbe_validate_option(&mq, &opt); 0.00 : 208f: e8 5c f2 ff ff callq 12f0 : if (mq) 0.00 : 2094: 8b ac 24 9c 00 00 00 mov 0x9c(%rsp),%ebp 0.00 : 209b: 85 ed test %ebp,%ebp 0.00 : 209d: 0f 84 f0 f3 ff ff je 1493 : else : *aflags &= ~IXGBE_FLAG_MQ_CAPABLE; : #ifdef module_param_array : } else { : if (opt.def == OPTION_ENABLED) : *aflags |= IXGBE_FLAG_MQ_CAPABLE; 0.00 : 20a3: 81 8b 18 02 00 00 00 orl $0x200,0x218(%rbx) 0.00 : 20aa: 02 00 00 0.00 : 20ad: e9 eb f3 ff ff jmpq 149d : } : #endif : /* Check Interoperability */ : if ((*aflags & IXGBE_FLAG_MQ_CAPABLE) && : !(*aflags & IXGBE_FLAG_MSIX_CAPABLE)) { : DPRINTK(PROBE, INFO, 0.00 : 20b2: 48 8b b3 00 02 00 00 mov 0x200(%rbx),%rsi 0.00 : 20b9: 48 c7 c2 00 00 00 00 mov $0x0,%rdx 0.00 : 20c0: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 20c7: 31 c0 xor %eax,%eax 0.00 : 20c9: e8 00 00 00 00 callq 20ce 0.00 : 20ce: 8b 93 18 02 00 00 mov 0x218(%rbx),%edx 0.00 : 20d4: eb 8d jmp 2063 : if (int_mode == OPTION_UNSET) : int_mode = InterruptType[bd]; : ixgbe_validate_option(&int_mode, &opt); : switch (int_mode) { : case IXGBE_INT_MSIX: : if (!(*aflags & IXGBE_FLAG_MSIX_CAPABLE)) 0.00 : 20d6: f6 83 18 02 00 00 04 testb $0x4,0x218(%rbx) 0.00 : 20dd: 0f 85 96 f3 ff ff jne 1479 : printk(KERN_INFO 0.00 : 20e3: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 20ea: 31 c0 xor %eax,%eax 0.00 : 20ec: e8 00 00 00 00 callq 20f1 0.00 : 20f1: e9 83 f3 ff ff jmpq 1479 : "Ignoring MSI-X setting; " : "support unavailable\n"); : break; : case IXGBE_INT_MSI: : if (!(*aflags & IXGBE_FLAG_MSI_CAPABLE)) { 0.00 : 20f6: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax 0.00 : 20fc: a8 01 test $0x1,%al 0.00 : 20fe: 74 22 je 2122 : printk(KERN_INFO : "Ignoring MSI setting; " : "support unavailable\n"); : } else { : *aflags &= ~IXGBE_FLAG_MSIX_CAPABLE; 0.00 : 2100: 83 e0 fb and $0xfffffffb,%eax 0.00 : 2103: 89 83 18 02 00 00 mov %eax,0x218(%rbx) 0.00 : 2109: e9 6b f3 ff ff jmpq 1479 : #ifdef module_param_array : if (num_IntMode > bd || num_InterruptType > bd) { : #endif : int_mode = IntMode[bd]; : if (int_mode == OPTION_UNSET) : int_mode = InterruptType[bd]; 0.00 : 210e: 42 8b 04 ad 00 00 00 mov 0x0(,%r13,4),%eax 0.00 : 2115: 00 0.00 : 2116: 89 84 24 9c 00 00 00 mov %eax,0x9c(%rsp) 0.00 : 211d: e9 23 f3 ff ff jmpq 1445 : "Ignoring MSI-X setting; " : "support unavailable\n"); : break; : case IXGBE_INT_MSI: : if (!(*aflags & IXGBE_FLAG_MSI_CAPABLE)) { : printk(KERN_INFO 0.00 : 2122: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 2129: 31 c0 xor %eax,%eax 0.00 : 212b: e8 00 00 00 00 callq 2130 0.00 : 2130: e9 44 f3 ff ff jmpq 1479 : int bd = adapter->bd_number; : u32 *aflags = &adapter->flags; : struct ixgbe_ring_feature *feature = adapter->ring_feature; : : if (bd >= IXGBE_MAX_NIC) { : printk(KERN_NOTICE 0.00 : 2135: 44 89 e6 mov %r12d,%esi 0.00 : 2138: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 213f: 31 c0 xor %eax,%eax 0.00 : 2141: e8 00 00 00 00 callq 2146 : "Warning: no configuration for board #%d\n", bd); : printk(KERN_NOTICE "Using defaults for all values\n"); 0.00 : 2146: 48 c7 c7 00 00 00 00 mov $0x0,%rdi 0.00 : 214d: 31 c0 xor %eax,%eax 0.00 : 214f: e8 00 00 00 00 callq 2154 0.00 : 2154: e9 bb f2 ff ff jmpq 1414 : break; : } : #ifdef module_param_array : } else { : /* default settings */ : if (opt.def == IXGBE_INT_MSIX && 0.00 : 2159: 8b 15 00 00 00 00 mov 0x0(%rip),%edx # 215f 0.00 : 215f: 83 fa 02 cmp $0x2,%edx 0.00 : 2162: 74 1c je 2180 : *aflags & IXGBE_FLAG_MSIX_CAPABLE) { : *aflags |= IXGBE_FLAG_MSIX_CAPABLE; : *aflags |= IXGBE_FLAG_MSI_CAPABLE; : } else if (opt.def == IXGBE_INT_MSI && 0.00 : 2164: 83 ea 01 sub $0x1,%edx : break; : } : #ifdef module_param_array : } else { : /* default settings */ : if (opt.def == IXGBE_INT_MSIX && 0.00 : 2167: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax : *aflags & IXGBE_FLAG_MSIX_CAPABLE) { : *aflags |= IXGBE_FLAG_MSIX_CAPABLE; : *aflags |= IXGBE_FLAG_MSI_CAPABLE; : } else if (opt.def == IXGBE_INT_MSI && 0.00 : 216d: 74 2c je 219b : *aflags & IXGBE_FLAG_MSI_CAPABLE) { : *aflags &= ~IXGBE_FLAG_MSIX_CAPABLE; : *aflags |= IXGBE_FLAG_MSI_CAPABLE; : } else { : *aflags &= ~IXGBE_FLAG_MSIX_CAPABLE; : *aflags &= ~IXGBE_FLAG_MSI_CAPABLE; 0.00 : 216f: 83 e0 fa and $0xfffffffa,%eax 0.00 : 2172: 4d 63 ec movslq %r12d,%r13 0.00 : 2175: 89 83 18 02 00 00 mov %eax,0x218(%rbx) 0.00 : 217b: e9 f9 f2 ff ff jmpq 1479 : break; : } : #ifdef module_param_array : } else { : /* default settings */ : if (opt.def == IXGBE_INT_MSIX && 0.00 : 2180: 8b 83 18 02 00 00 mov 0x218(%rbx),%eax 0.00 : 2186: a8 04 test $0x4,%al 0.00 : 2188: 74 e5 je 216f : *aflags & IXGBE_FLAG_MSIX_CAPABLE) { : *aflags |= IXGBE_FLAG_MSIX_CAPABLE; : *aflags |= IXGBE_FLAG_MSI_CAPABLE; 0.00 : 218a: 83 c8 05 or $0x5,%eax 0.00 : 218d: 4d 63 ec movslq %r12d,%r13 0.00 : 2190: 89 83 18 02 00 00 mov %eax,0x218(%rbx) : break; : } : #ifdef module_param_array : } else { : /* default settings */ : if (opt.def == IXGBE_INT_MSIX && 0.00 : 2196: e9 de f2 ff ff jmpq 1479 : *aflags & IXGBE_FLAG_MSIX_CAPABLE) { : *aflags |= IXGBE_FLAG_MSIX_CAPABLE; : *aflags |= IXGBE_FLAG_MSI_CAPABLE; : } else if (opt.def == IXGBE_INT_MSI && 0.00 : 219b: a8 01 test $0x1,%al 0.00 : 219d: 74 d0 je 216f : *aflags & IXGBE_FLAG_MSI_CAPABLE) { : *aflags &= ~IXGBE_FLAG_MSIX_CAPABLE; : *aflags |= IXGBE_FLAG_MSI_CAPABLE; 0.00 : 219f: 83 e0 fb and $0xfffffffb,%eax 0.00 : 21a2: 4d 63 ec movslq %r12d,%r13 0.00 : 21a5: 83 c8 01 or $0x1,%eax 0.00 : 21a8: 89 83 18 02 00 00 mov %eax,0x218(%rbx) : /* default settings */ : if (opt.def == IXGBE_INT_MSIX && : *aflags & IXGBE_FLAG_MSIX_CAPABLE) { : *aflags |= IXGBE_FLAG_MSIX_CAPABLE; : *aflags |= IXGBE_FLAG_MSI_CAPABLE; : } else if (opt.def == IXGBE_INT_MSI && 66.67 : 21ae: e9 c6 f2 ff ff jmpq 1479 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 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:4168 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005acec0 : : */ : static Datum : ExecEvalRelabelType(GenericExprState *exprstate, : ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { 0.00 : 5acec0: 55 push %rbp : return ExecEvalExpr(exprstate->arg, econtext, isNull, isDone); 0.00 : 5acec1: 48 8b 47 18 mov 0x18(%rdi),%rax : */ : static Datum : ExecEvalRelabelType(GenericExprState *exprstate, : ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:4168 100.00 : 5acec5: 48 89 e5 mov %rsp,%rbp : return ExecEvalExpr(exprstate->arg, econtext, isNull, isDone); 0.00 : 5acec8: 4c 8b 58 10 mov 0x10(%rax),%r11 0.00 : 5acecc: 48 89 c7 mov %rax,%rdi : } 0.00 : 5acecf: c9 leaveq : static Datum : ExecEvalRelabelType(GenericExprState *exprstate, : ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { : return ExecEvalExpr(exprstate->arg, econtext, isNull, isDone); 0.00 : 5aced0: 41 ff e3 jmpq *%r11 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:663 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:698 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) : { /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:663 50.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 0.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; 0.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; 0.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 : } /home/Computational/mark/src/postgres-andres/src/backend/executor/execTuples.c:698 50.00 : 5b3fae: eb bc jmp 5b3f6c Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:797 50.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:869 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b9ac0 : : static void : finalize_aggregate(AggState *aggstate, : AggStatePerAgg peraggstate, : AggStatePerGroup pergroupstate, : Datum *resultVal, bool *resultIsNull) : { 0.00 : 5b9ac0: 55 push %rbp 0.00 : 5b9ac1: 48 89 e5 mov %rsp,%rbp 0.00 : 5b9ac4: 41 57 push %r15 0.00 : 5b9ac6: 41 56 push %r14 0.00 : 5b9ac8: 41 55 push %r13 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:797 50.00 : 5b9aca: 41 54 push %r12 0.00 : 5b9acc: 53 push %rbx 0.00 : 5b9acd: 48 81 ec e8 03 00 00 sub $0x3e8,%rsp : #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 : 5b9ad4: 48 8b 05 85 0d 60 00 mov 0x600d85(%rip),%rax # bba860 0.00 : 5b9adb: 48 89 bd 10 fc ff ff mov %rdi,-0x3f0(%rbp) 0.00 : 5b9ae2: 48 89 b5 08 fc ff ff mov %rsi,-0x3f8(%rbp) 0.00 : 5b9ae9: 48 89 95 00 fc ff ff mov %rdx,-0x400(%rbp) 0.00 : 5b9af0: 48 89 8d f8 fb ff ff mov %rcx,-0x408(%rbp) 0.00 : 5b9af7: 4c 89 85 f0 fb ff ff mov %r8,-0x410(%rbp) 0.00 : 5b9afe: 48 89 85 18 fc ff ff mov %rax,-0x3e8(%rbp) : : CurrentMemoryContext = context; 0.00 : 5b9b05: 48 8b 47 60 mov 0x60(%rdi),%rax 0.00 : 5b9b09: 48 8b 40 28 mov 0x28(%rax),%rax 0.00 : 5b9b0d: 48 89 05 4c 0d 60 00 mov %rax,0x600d4c(%rip) # bba860 : * (which is unlikely anyway), so that side-effects happen as expected. : * The direct arguments go into arg positions 1 and up, leaving position 0 : * for the transition state value. : */ : i = 1; : foreach(lc, peraggstate->aggrefstate->aggdirectargs) 0.00 : 5b9b14: 48 8b 06 mov (%rsi),%rax 0.00 : 5b9b17: 48 8b 40 18 mov 0x18(%rax),%rax : #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 : 5b9b1b: 48 85 c0 test %rax,%rax 0.00 : 5b9b1e: 0f 84 4a 02 00 00 je 5b9d6e 0.00 : 5b9b24: 4c 8b 60 08 mov 0x8(%rax),%r12 0.00 : 5b9b28: 4d 85 e4 test %r12,%r12 0.00 : 5b9b2b: 0f 84 3d 02 00 00 je 5b9d6e 0.00 : 5b9b31: 48 8d 85 20 fc ff ff lea -0x3e0(%rbp),%rax 0.00 : 5b9b38: 45 31 ff xor %r15d,%r15d 0.00 : 5b9b3b: 41 be 01 00 00 00 mov $0x1,%r14d 0.00 : 5b9b41: 48 8d 98 41 03 00 00 lea 0x341(%rax),%rbx 0.00 : 5b9b48: 4c 8d 68 28 lea 0x28(%rax),%r13 0.00 : 5b9b4c: 0f 1f 40 00 nopl 0x0(%rax) : { : ExprState *expr = (ExprState *) lfirst(lc); 0.00 : 5b9b50: 49 8b 04 24 mov (%r12),%rax : : fcinfo.arg[i] = ExecEvalExpr(expr, 0.00 : 5b9b54: 48 8b 95 10 fc ff ff mov -0x3f0(%rbp),%rdx 0.00 : 5b9b5b: 31 c9 xor %ecx,%ecx : aggstate->ss.ps.ps_ExprContext, : &fcinfo.argnull[i], : NULL); : anynull |= fcinfo.argnull[i]; : i++; 0.00 : 5b9b5d: 41 83 c6 01 add $0x1,%r14d : i = 1; : foreach(lc, peraggstate->aggrefstate->aggdirectargs) : { : ExprState *expr = (ExprState *) lfirst(lc); : : fcinfo.arg[i] = ExecEvalExpr(expr, 0.00 : 5b9b61: 48 8b 72 60 mov 0x60(%rdx),%rsi 0.00 : 5b9b65: 48 89 c7 mov %rax,%rdi 0.00 : 5b9b68: 48 89 da mov %rbx,%rdx 0.00 : 5b9b6b: ff 50 10 callq *0x10(%rax) 0.00 : 5b9b6e: 49 89 45 00 mov %rax,0x0(%r13) : * (which is unlikely anyway), so that side-effects happen as expected. : * The direct arguments go into arg positions 1 and up, leaving position 0 : * for the transition state value. : */ : i = 1; : foreach(lc, peraggstate->aggrefstate->aggdirectargs) 0.00 : 5b9b72: 4d 8b 64 24 08 mov 0x8(%r12),%r12 0.00 : 5b9b77: 49 83 c5 08 add $0x8,%r13 : : fcinfo.arg[i] = ExecEvalExpr(expr, : aggstate->ss.ps.ps_ExprContext, : &fcinfo.argnull[i], : NULL); : anynull |= fcinfo.argnull[i]; 0.00 : 5b9b7b: 44 0a 3b or (%rbx),%r15b : * (which is unlikely anyway), so that side-effects happen as expected. : * The direct arguments go into arg positions 1 and up, leaving position 0 : * for the transition state value. : */ : i = 1; : foreach(lc, peraggstate->aggrefstate->aggdirectargs) 0.00 : 5b9b7e: 48 83 c3 01 add $0x1,%rbx 0.00 : 5b9b82: 4d 85 e4 test %r12,%r12 0.00 : 5b9b85: 75 c9 jne 5b9b50 : } : : /* : * Apply the agg's finalfn if one is provided, else return transValue. : */ : if (OidIsValid(peraggstate->finalfn_oid)) 0.00 : 5b9b87: 48 8b 85 08 fc ff ff mov -0x3f8(%rbp),%rax 0.00 : 5b9b8e: 8b 58 24 mov 0x24(%rax),%ebx 0.00 : 5b9b91: 85 db test %ebx,%ebx 0.00 : 5b9b93: 0f 84 f4 00 00 00 je 5b9c8d : { : int numFinalArgs = peraggstate->numFinalArgs; : : /* set up aggstate->curperagg for AggGetAggref() */ : aggstate->curperagg = peraggstate; 0.00 : 5b9b99: 48 8b 95 10 fc ff ff mov -0x3f0(%rbp),%rdx : /* : * Apply the agg's finalfn if one is provided, else return transValue. : */ : if (OidIsValid(peraggstate->finalfn_oid)) : { : int numFinalArgs = peraggstate->numFinalArgs; 0.00 : 5b9ba0: 8b 48 1c mov 0x1c(%rax),%ecx : : /* set up aggstate->curperagg for AggGetAggref() */ : aggstate->curperagg = peraggstate; 0.00 : 5b9ba3: 48 89 82 c8 00 00 00 mov %rax,0xc8(%rdx) : : InitFunctionCallInfoData(fcinfo, &(peraggstate->finalfn), 0.00 : 5b9baa: 48 8b 85 08 fc ff ff mov -0x3f8(%rbp),%rax 0.00 : 5b9bb1: 48 89 95 28 fc ff ff mov %rdx,-0x3d8(%rbp) 0.00 : 5b9bb8: 48 8b 95 08 fc ff ff mov -0x3f8(%rbp),%rdx 0.00 : 5b9bbf: 48 c7 85 30 fc ff ff movq $0x0,-0x3d0(%rbp) 0.00 : 5b9bc6: 00 00 00 00 0.00 : 5b9bca: 48 83 c0 58 add $0x58,%rax : fcinfo.arg[0] = pergroupstate->transValue; : fcinfo.argnull[0] = pergroupstate->transValueIsNull; : anynull |= pergroupstate->transValueIsNull; : : /* Fill any remaining argument positions with nulls */ : for (; i < numFinalArgs; i++) 0.00 : 5b9bce: 44 39 f1 cmp %r14d,%ecx : int numFinalArgs = peraggstate->numFinalArgs; : : /* set up aggstate->curperagg for AggGetAggref() */ : aggstate->curperagg = peraggstate; : : InitFunctionCallInfoData(fcinfo, &(peraggstate->finalfn), 0.00 : 5b9bd1: 48 89 85 20 fc ff ff mov %rax,-0x3e0(%rbp) 0.00 : 5b9bd8: 8b 82 88 00 00 00 mov 0x88(%rdx),%eax : numFinalArgs, : peraggstate->aggCollation, : (void *) aggstate, NULL); : : /* Fill in the transition state value */ : fcinfo.arg[0] = pergroupstate->transValue; 0.00 : 5b9bde: 48 8b 95 00 fc ff ff mov -0x400(%rbp),%rdx : int numFinalArgs = peraggstate->numFinalArgs; : : /* set up aggstate->curperagg for AggGetAggref() */ : aggstate->curperagg = peraggstate; : : InitFunctionCallInfoData(fcinfo, &(peraggstate->finalfn), 0.00 : 5b9be5: c6 85 3c fc ff ff 00 movb $0x0,-0x3c4(%rbp) 0.00 : 5b9bec: 66 89 8d 3e fc ff ff mov %cx,-0x3c2(%rbp) 0.00 : 5b9bf3: 89 85 38 fc ff ff mov %eax,-0x3c8(%rbp) : numFinalArgs, : peraggstate->aggCollation, : (void *) aggstate, NULL); : : /* Fill in the transition state value */ : fcinfo.arg[0] = pergroupstate->transValue; 0.00 : 5b9bf9: 48 8b 02 mov (%rdx),%rax 0.00 : 5b9bfc: 48 89 85 40 fc ff ff mov %rax,-0x3c0(%rbp) : fcinfo.argnull[0] = pergroupstate->transValueIsNull; 0.00 : 5b9c03: 0f b6 42 08 movzbl 0x8(%rdx),%eax 0.00 : 5b9c07: 88 85 60 ff ff ff mov %al,-0xa0(%rbp) : anynull |= pergroupstate->transValueIsNull; : : /* Fill any remaining argument positions with nulls */ : for (; i < numFinalArgs; i++) 0.00 : 5b9c0d: 0f 8e 50 01 00 00 jle 5b9d63 0.00 : 5b9c13: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : { : fcinfo.arg[i] = (Datum) 0; 0.00 : 5b9c18: 49 63 c6 movslq %r14d,%rax : fcinfo.arg[0] = pergroupstate->transValue; : fcinfo.argnull[0] = pergroupstate->transValueIsNull; : anynull |= pergroupstate->transValueIsNull; : : /* Fill any remaining argument positions with nulls */ : for (; i < numFinalArgs; i++) 0.00 : 5b9c1b: 41 83 c6 01 add $0x1,%r14d 0.00 : 5b9c1f: 44 39 f1 cmp %r14d,%ecx : { : fcinfo.arg[i] = (Datum) 0; 0.00 : 5b9c22: 48 c7 84 c5 40 fc ff movq $0x0,-0x3c0(%rbp,%rax,8) 0.00 : 5b9c29: ff 00 00 00 00 : fcinfo.argnull[i] = true; 0.00 : 5b9c2e: c6 84 05 60 ff ff ff movb $0x1,-0xa0(%rbp,%rax,1) 0.00 : 5b9c35: 01 : fcinfo.arg[0] = pergroupstate->transValue; : fcinfo.argnull[0] = pergroupstate->transValueIsNull; : anynull |= pergroupstate->transValueIsNull; : : /* Fill any remaining argument positions with nulls */ : for (; i < numFinalArgs; i++) 0.00 : 5b9c36: 7f e0 jg 5b9c18 0.00 : 5b9c38: b8 01 00 00 00 mov $0x1,%eax : fcinfo.arg[i] = (Datum) 0; : fcinfo.argnull[i] = true; : anynull = true; : } : : if (fcinfo.flinfo->fn_strict && anynull) 0.00 : 5b9c3d: 48 8b 95 08 fc ff ff mov -0x3f8(%rbp),%rdx 0.00 : 5b9c44: 80 7a 66 00 cmpb $0x0,0x66(%rdx) 0.00 : 5b9c48: 0f 85 a3 00 00 00 jne 5b9cf1 : *resultVal = (Datum) 0; : *resultIsNull = true; : } : else : { : *resultVal = FunctionCallInvoke(&fcinfo); 0.00 : 5b9c4e: 48 8b 95 08 fc ff ff mov -0x3f8(%rbp),%rdx 0.00 : 5b9c55: 48 8d bd 20 fc ff ff lea -0x3e0(%rbp),%rdi 0.00 : 5b9c5c: ff 52 58 callq *0x58(%rdx) 0.00 : 5b9c5f: 48 8b 95 f8 fb ff ff mov -0x408(%rbp),%rdx 0.00 : 5b9c66: 48 89 02 mov %rax,(%rdx) : *resultIsNull = fcinfo.isnull; 0.00 : 5b9c69: 0f b6 85 3c fc ff ff movzbl -0x3c4(%rbp),%eax 0.00 : 5b9c70: 48 8b 95 f0 fb ff ff mov -0x410(%rbp),%rdx 0.00 : 5b9c77: 88 02 mov %al,(%rdx) : } : aggstate->curperagg = NULL; 0.00 : 5b9c79: 48 8b 85 10 fc ff ff mov -0x3f0(%rbp),%rax 0.00 : 5b9c80: 48 c7 80 c8 00 00 00 movq $0x0,0xc8(%rax) 0.00 : 5b9c87: 00 00 00 00 0.00 : 5b9c8b: eb 28 jmp 5b9cb5 : } : else : { : *resultVal = pergroupstate->transValue; 0.00 : 5b9c8d: 48 8b 95 00 fc ff ff mov -0x400(%rbp),%rdx 0.00 : 5b9c94: 48 8b 02 mov (%rdx),%rax 0.00 : 5b9c97: 48 8b 95 f8 fb ff ff mov -0x408(%rbp),%rdx 0.00 : 5b9c9e: 48 89 02 mov %rax,(%rdx) : *resultIsNull = pergroupstate->transValueIsNull; 0.00 : 5b9ca1: 48 8b 95 00 fc ff ff mov -0x400(%rbp),%rdx /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:869 50.00 : 5b9ca8: 0f b6 42 08 movzbl 0x8(%rdx),%eax 0.00 : 5b9cac: 48 8b 95 f0 fb ff ff mov -0x410(%rbp),%rdx 0.00 : 5b9cb3: 88 02 mov %al,(%rdx) : } : : /* : * If result is pass-by-ref, make sure it is in the right context. : */ : if (!peraggstate->resulttypeByVal && !*resultIsNull && 0.00 : 5b9cb5: 48 8b 85 08 fc ff ff mov -0x3f8(%rbp),%rax 0.00 : 5b9cbc: 80 b8 d1 00 00 00 00 cmpb $0x0,0xd1(%rax) 0.00 : 5b9cc3: 75 0c jne 5b9cd1 0.00 : 5b9cc5: 48 8b 95 f0 fb ff ff mov -0x410(%rbp),%rdx 0.00 : 5b9ccc: 80 3a 00 cmpb $0x0,(%rdx) 0.00 : 5b9ccf: 74 45 je 5b9d16 0.00 : 5b9cd1: 48 8b 85 18 fc ff ff mov -0x3e8(%rbp),%rax 0.00 : 5b9cd8: 48 89 05 81 0b 60 00 mov %rax,0x600b81(%rip) # bba860 : *resultVal = datumCopy(*resultVal, : peraggstate->resulttypeByVal, : peraggstate->resulttypeLen); : : MemoryContextSwitchTo(oldContext); : } 0.00 : 5b9cdf: 48 81 c4 e8 03 00 00 add $0x3e8,%rsp 0.00 : 5b9ce6: 5b pop %rbx 0.00 : 5b9ce7: 41 5c pop %r12 0.00 : 5b9ce9: 41 5d pop %r13 0.00 : 5b9ceb: 41 5e pop %r14 0.00 : 5b9ced: 41 5f pop %r15 0.00 : 5b9cef: c9 leaveq 0.00 : 5b9cf0: c3 retq : fcinfo.arg[i] = (Datum) 0; : fcinfo.argnull[i] = true; : anynull = true; : } : : if (fcinfo.flinfo->fn_strict && anynull) 0.00 : 5b9cf1: 84 c0 test %al,%al 0.00 : 5b9cf3: 0f 84 55 ff ff ff je 5b9c4e : { : /* don't call a strict function with NULL inputs */ : *resultVal = (Datum) 0; 0.00 : 5b9cf9: 48 8b 85 f8 fb ff ff mov -0x408(%rbp),%rax 0.00 : 5b9d00: 48 c7 00 00 00 00 00 movq $0x0,(%rax) : *resultIsNull = true; 0.00 : 5b9d07: 48 8b 95 f0 fb ff ff mov -0x410(%rbp),%rdx 0.00 : 5b9d0e: c6 02 01 movb $0x1,(%rdx) 0.00 : 5b9d11: e9 63 ff ff ff jmpq 5b9c79 : } : : /* : * If result is pass-by-ref, make sure it is in the right context. : */ : if (!peraggstate->resulttypeByVal && !*resultIsNull && 0.00 : 5b9d16: 48 8b 85 f8 fb ff ff mov -0x408(%rbp),%rax 0.00 : 5b9d1d: 48 8b 3d 3c 0b 60 00 mov 0x600b3c(%rip),%rdi # bba860 0.00 : 5b9d24: 48 8b 30 mov (%rax),%rsi 0.00 : 5b9d27: e8 24 ee 1d 00 callq 798b50 0.00 : 5b9d2c: 84 c0 test %al,%al 0.00 : 5b9d2e: 75 a1 jne 5b9cd1 : !MemoryContextContains(CurrentMemoryContext, : DatumGetPointer(*resultVal))) : *resultVal = datumCopy(*resultVal, 0.00 : 5b9d30: 48 8b 85 08 fc ff ff mov -0x3f8(%rbp),%rax 0.00 : 5b9d37: 0f bf 90 cc 00 00 00 movswl 0xcc(%rax),%edx 0.00 : 5b9d3e: 0f be b0 d1 00 00 00 movsbl 0xd1(%rax),%esi 0.00 : 5b9d45: 48 8b 85 f8 fb ff ff mov -0x408(%rbp),%rax 0.00 : 5b9d4c: 48 8b 38 mov (%rax),%rdi 0.00 : 5b9d4f: e8 1c 62 11 00 callq 6cff70 0.00 : 5b9d54: 48 8b 95 f8 fb ff ff mov -0x408(%rbp),%rdx 0.00 : 5b9d5b: 48 89 02 mov %rax,(%rdx) 0.00 : 5b9d5e: e9 6e ff ff ff jmpq 5b9cd1 : fcinfo.arg[0] = pergroupstate->transValue; : fcinfo.argnull[0] = pergroupstate->transValueIsNull; : anynull |= pergroupstate->transValueIsNull; : : /* Fill any remaining argument positions with nulls */ : for (; i < numFinalArgs; i++) 0.00 : 5b9d63: 44 08 f8 or %r15b,%al 0.00 : 5b9d66: 0f 95 c0 setne %al 0.00 : 5b9d69: e9 cf fe ff ff jmpq 5b9c3d : * (which is unlikely anyway), so that side-effects happen as expected. : * The direct arguments go into arg positions 1 and up, leaving position 0 : * for the transition state value. : */ : i = 1; : foreach(lc, peraggstate->aggrefstate->aggdirectargs) 0.00 : 5b9d6e: 45 31 ff xor %r15d,%r15d 0.00 : 5b9d71: 41 be 01 00 00 00 mov $0x1,%r14d 0.00 : 5b9d77: e9 0b fe ff ff jmpq 5b9b87 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/predicate.c:3871 50.00 /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/predicate.c:4064 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 /home/Computational/mark/src/postgres-andres/src/backend/storage/lmgr/predicate.c:3871 50.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) 0.00 : 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 50.00 : 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 ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:778 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000006ed200 : : * test would complain about mismatched entries for a built-in function. : */ : : Datum : int8inc_any(PG_FUNCTION_ARGS) : { 0.00 : 6ed200: 55 push %rbp 0.00 : 6ed201: 48 89 e5 mov %rsp,%rbp : return int8inc(fcinfo); : } /home/Computational/mark/src/postgres-andres/src/backend/utils/adt/int8.c:778 100.00 : 6ed204: c9 leaveq : */ : : Datum : int8inc_any(PG_FUNCTION_ARGS) : { : return int8inc(fcinfo); 0.00 : 6ed205: e9 76 ff ff ff jmpq 6ed180 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 50.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:445 50.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:456 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 /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:445 50.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); /home/Computational/mark/src/postgres-andres/src/backend/utils/hash/chash.c:456 50.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; 0.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/mb/mbutils.c:1016 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000007888e0 : : * encoding of data stored in text-like data types. Affected types include : * cstring, text, varchar, name, xml, and json. : */ : int : GetDatabaseEncoding(void) : { /home/Computational/mark/src/postgres-andres/src/backend/utils/mb/mbutils.c:1016 100.00 : 7888e0: 48 8b 05 69 02 3e 00 mov 0x3e0269(%rip),%rax # b68b50 0.00 : 7888e7: 55 push %rbp 0.00 : 7888e8: 48 89 e5 mov %rsp,%rbp 0.00 : 7888eb: 8b 40 08 mov 0x8(%rax),%eax : return DatabaseEncoding->encoding; : } 0.00 : 7888ee: 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 ---------------------------------------------- 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/drivers/net/ethernet/intel/igb/igb.ko ---------------------------------------------- 50.00 ??:0 50.00 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/drivers/net/ethernet/intel/igb/igb.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000000700 : 0.00 : 700: 53 push %rbx 0.00 : 731: 48 89 fb 48 83 mov $0x2b8,%edi 0.00 : 736: ec 10 66 xor %r10d,%r10d 0.00 : 739: 83 bf f8 xor %r9d,%r9d 0.00 : 73c: 03 00 test %edi,%edi 0.00 : 73e: 00 00 jle 78c 0.00 : 740: 48 8b 87 mov %rbx,%r8 0.00 : 743: a0 04 xor %edi,%edi 0.00 : 745: 00 00 74 xor %r10d,%r10d 0.00 : 748: 09 83 b8 xor %r9d,%r9d 0.00 : 74b: 88 00 00 00 01 mov $0xc030,%ecx 0.00 : 750: 74 0e 48 mov %rcx,%rax 0.00 : 753: 83 c4 10 5b c3 0f 1f add 0x570(%rbx),%rax 0.00 : 75a: 84 00 mov (%rax),%eax 0.00 : 75c: 00 00 test %eax,%eax 0.00 : 75e: 00 00 8b bf b8 02 00 mov 0x2c0(%r8),%rdx 0.00 : 765: 00 45 je 771 0.00 : 767: 31 d2 mov %eax,%eax 0.00 : 769: 45 31 c9 85 add %rax,0x68(%rdx) 0.00 : 76d: ff 7e 4c 49 add %rax,0x70(%rsi) 0.00 : 771: 89 d8 31 ff add 0x60(%rdx),%r10 0.00 : 775: 45 31 d2 45 add 0x58(%rdx),%r9 0.00 : 779: 31 c9 b9 add $0x1,%edi 0.00 : 77c: 30 c0 00 00 add $0x40,%rcx 0.00 : 780: 48 89 c8 48 add $0x8,%r8 0.00 : 784: 03 83 70 05 00 00 cmp %edi,0x2b8(%rbx) 0.00 : 78a: 8b 00 jg 750 0.00 : 78c: 85 c0 49 8b mov %r10,0x10(%rsi) 0.00 : 790: 90 c0 02 mov %r9,(%rsi) 0.00 : 793: 00 00 xor %edi,%edi 0.00 : 795: 74 0a 89 c0 48 01 42 mov 0x234(%rbx),%r8d 0.00 : 79c: 68 48 xor %ecx,%ecx 0.00 : 79e: 01 46 70 test %r8d,%r8d 0.00 : 7a1: 4c 03 jle 7c9 0.00 : 7a3: 52 60 xor %edi,%edi 0.00 : 7a5: 4c 03 xor %ecx,%ecx 0.00 : 7a7: 4a 58 xor %edx,%edx 0.00 : 7a9: 83 c7 01 48 83 c1 40 nopl 0x0(%rax) 0.00 : 7b0: 49 83 c0 08 39 bb b8 mov 0x238(%rbx,%rdx,8),%rax 0.00 : 7b7: 02 0.00 : 7b8: 00 00 7f c4 add $0x1,%rdx 0.00 : 7bc: 4c 89 56 10 add 0x58(%rax),%rdi 0.00 : 7c0: 4c 89 0e 31 add 0x50(%rax),%rcx 0.00 : 7c4: ff 44 8b cmp %edx,%r8d 0.00 : 7c7: 83 34 jg 7b0 0.00 : 7c9: 02 00 00 31 mov %rdi,0x18(%rsi) 0.00 : 7cd: c9 45 85 c0 mov %rcx,0x8(%rsi) 0.00 : 7d1: 7e 26 31 ff 31 c9 31 mov 0x570(%rbx),%rax 0.00 : 7d8: d2 0f 1f 80 00 00 00 mov 0x9c8(%rbx),%rdx 0.00 : 7df: 00 48 8b 84 d3 38 add $0x4000,%rax 0.00 : 7e5: 02 00 mov (%rax),%eax 0.00 : 7e7: 00 48 mov %eax,%eax 0.00 : 7e9: 83 c2 01 add %rdx,%rax 0.00 : 7ec: 48 03 78 58 48 03 48 mov 0xa98(%rbx),%rdx 0.00 : 7f3: 50 41 39 d0 7f e7 48 mov %rax,0x9c8(%rbx) 0.00 : 7fa: 89 7e 18 48 89 4e 08 mov 0x570(%rbx),%rax 0.00 : 801: 48 8b 83 70 05 00 add $0x4074,%rax 0.00 : 807: 00 48 mov (%rax),%eax 0.00 : 809: 8b 93 mov %eax,%eax 0.00 : 80b: c8 09 00 add %rdx,%rax 0.00 : 80e: 00 48 05 00 40 00 00 mov 0xab8(%rbx),%rdx 0.00 : 815: 8b 00 89 c0 48 01 d0 mov %rax,0xa98(%rbx) 0.00 : 81c: 48 8b 93 98 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 823: 48 89 83 c8 09 00 add $0x4088,%rax 0.00 : 829: 00 48 mov (%rax),%eax 0.00 : 82b: 8b 83 mov %eax,%eax 0.00 : 82d: 70 05 00 add %rdx,%rax 0.00 : 830: 00 48 05 74 40 00 00 mov %rax,0xab8(%rbx) 0.00 : 837: 8b 00 89 c0 48 01 d0 mov 0x570(%rbx),%rax 0.00 : 83e: 48 8b 93 b8 0a 00 add $0x408c,%rax 0.00 : 844: 00 48 mov (%rax),%eax 0.00 : 846: 89 83 98 0a 00 00 48 mov 0x570(%rbx),%rax 0.00 : 84d: 8b 83 70 05 00 00 48 mov 0xaa0(%rbx),%rdx 0.00 : 854: 05 88 40 00 00 8b add $0x4078,%rax 0.00 : 85a: 00 89 mov (%rax),%eax 0.00 : 85c: c0 48 mov %eax,%eax 0.00 : 85e: 01 d0 48 add %rdx,%rax 0.00 : 861: 89 83 b8 0a 00 00 48 mov 0xaa8(%rbx),%rdx 0.00 : 868: 8b 83 70 05 00 00 48 mov %rax,0xaa0(%rbx) 0.00 : 86f: 05 8c 40 00 00 8b 00 mov 0x570(%rbx),%rax 0.00 : 876: 48 8b 83 70 05 00 add $0x407c,%rax 0.00 : 87c: 00 48 mov (%rax),%eax 0.00 : 87e: 8b 93 mov %eax,%eax 0.00 : 880: a0 0a 00 add %rdx,%rax 0.00 : 883: 00 48 05 78 40 00 00 mov 0xae0(%rbx),%rdx 0.00 : 88a: 8b 00 89 c0 48 01 d0 mov %rax,0xaa8(%rbx) 0.00 : 891: 48 8b 93 a8 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 898: 48 89 83 a0 0a 00 add $0x40ac,%rax 0.00 : 89e: 00 48 mov (%rax),%eax 0.00 : 8a0: 8b 83 mov %eax,%eax 0.00 : 8a2: 70 05 00 add %rdx,%rax 0.00 : 8a5: 00 48 05 7c 40 00 00 mov 0xa68(%rbx),%rdx 0.00 : 8ac: 8b 00 89 c0 48 01 d0 mov %rax,0xae0(%rbx) 0.00 : 8b3: 48 8b 93 e0 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 8ba: 48 89 83 a8 0a 00 add $0x405c,%rax 0.00 : 8c0: 00 48 mov (%rax),%eax 0.00 : 8c2: 8b 83 mov %eax,%eax 0.00 : 8c4: 70 05 00 add %rdx,%rax 0.00 : 8c7: 00 48 05 ac 40 00 00 mov 0xa70(%rbx),%rdx 0.00 : 8ce: 8b 00 89 c0 48 01 d0 mov %rax,0xa68(%rbx) 0.00 : 8d5: 48 8b 93 68 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 8dc: 48 89 83 e0 0a 00 add $0x4060,%rax 0.00 : 8e2: 00 48 mov (%rax),%eax 0.00 : 8e4: 8b 83 mov %eax,%eax 0.00 : 8e6: 70 05 00 add %rdx,%rax 0.00 : 8e9: 00 48 05 5c 40 00 00 mov 0xa78(%rbx),%rdx 0.00 : 8f0: 8b 00 89 c0 48 01 d0 mov %rax,0xa70(%rbx) 0.00 : 8f7: 48 8b 93 70 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 8fe: 48 89 83 68 0a 00 add $0x4064,%rax 0.00 : 904: 00 48 mov (%rax),%eax 0.00 : 906: 8b 83 mov %eax,%eax 0.00 : 908: 70 05 00 add %rdx,%rax 0.00 : 90b: 00 48 05 60 40 00 00 mov 0xa80(%rbx),%rdx 0.00 : 912: 8b 00 89 c0 48 01 d0 mov %rax,0xa78(%rbx) 0.00 : 919: 48 8b 93 78 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 920: 48 89 83 70 0a 00 add $0x4068,%rax 0.00 : 926: 00 48 mov (%rax),%eax 0.00 : 928: 8b 83 mov %eax,%eax 0.00 : 92a: 70 05 00 add %rdx,%rax 0.00 : 92d: 00 48 05 64 40 00 00 mov 0xa88(%rbx),%rdx 0.00 : 934: 8b 00 89 c0 48 01 d0 mov %rax,0xa80(%rbx) 0.00 : 93b: 48 8b 93 80 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 942: 48 89 83 78 0a 00 add $0x406c,%rax 0.00 : 948: 00 48 mov (%rax),%eax 0.00 : 94a: 8b 83 mov %eax,%eax 0.00 : 94c: 70 05 00 add %rdx,%rax 0.00 : 94f: 00 48 05 68 40 00 00 mov 0xa90(%rbx),%rdx 0.00 : 956: 8b 00 89 c0 48 01 d0 mov %rax,0xa88(%rbx) 0.00 : 95d: 48 8b 93 88 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 964: 48 89 83 80 0a 00 add $0x4070,%rax 0.00 : 96a: 00 48 mov (%rax),%eax 0.00 : 96c: 8b 83 mov %eax,%eax 0.00 : 96e: 70 05 00 add %rdx,%rax 0.00 : 971: 00 48 05 6c 40 00 00 mov 0x9d8(%rbx),%rdx 0.00 : 978: 8b 00 89 c0 48 01 d0 mov %rax,0xa90(%rbx) 0.00 : 97f: 48 8b 93 90 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 986: 48 89 83 88 0a 00 add $0x4008,%rax 0.00 : 98c: 00 48 mov (%rax),%eax 0.00 : 98e: 8b 83 mov %eax,%eax 0.00 : 990: 70 05 00 add %rdx,%rax 0.00 : 993: 00 48 05 70 40 00 00 mov 0xa28(%rbx),%rdx 0.00 : 99a: 8b 00 89 c0 48 01 d0 mov %rax,0x9d8(%rbx) 0.00 : 9a1: 48 8b 93 d8 09 00 00 mov 0x570(%rbx),%rax 0.00 : 9a8: 48 89 83 90 0a 00 add $0x4038,%rax 0.00 : 9ae: 00 48 mov (%rax),%eax 0.00 : 9b0: 8b 83 mov %eax,%eax 0.00 : 9b2: 70 05 00 add %rdx,%rax 0.00 : 9b5: 00 48 05 08 40 00 00 mov %rax,0xa28(%rbx) 0.00 : 9bc: 8b 00 89 c0 48 01 d0 mov 0x570(%rbx),%rax 0.00 : 9c3: 48 8b 93 28 0a 00 add $0x4010,%rax 0.00 : 9c9: 00 48 mov (%rax),%eax 0.00 : 9cb: 89 83 mov %eax,%eax 0.00 : 9cd: d8 09 00 00 48 8b 83 add %rax,0x9e8(%rbx) 0.00 : 9d4: 70 05 00 00 add %rax,0x70(%rsi) 0.00 : 9d8: 48 05 38 40 00 00 8b mov 0x570(%rbx),%rax 0.00 : 9df: 00 89 c0 48 01 d0 48 mov 0x9f0(%rbx),%rdx 0.00 : 9e6: 89 83 28 0a 00 00 add $0x4014,%rax 0.00 : 9ec: 48 8b mov (%rax),%eax 0.00 : 9ee: 83 70 mov %eax,%eax 0.00 : 9f0: 05 00 00 add %rdx,%rax 0.00 : 9f3: 48 05 10 40 00 00 8b mov 0x9f8(%rbx),%rdx 0.00 : 9fa: 00 89 c0 48 01 83 e8 mov %rax,0x9f0(%rbx) 0.00 : a01: 09 00 00 48 01 46 70 mov 0x570(%rbx),%rax 0.00 : a08: 48 8b 83 70 05 00 add $0x4018,%rax 0.00 : a0e: 00 48 mov (%rax),%eax 0.00 : a10: 8b 93 mov %eax,%eax 0.00 : a12: f0 09 00 add %rdx,%rax 0.00 : a15: 00 48 05 14 40 00 00 mov 0xa00(%rbx),%rdx 0.00 : a1c: 8b 00 89 c0 48 01 d0 mov %rax,0x9f8(%rbx) 0.00 : a23: 48 8b 93 f8 09 00 00 mov 0x570(%rbx),%rax 0.00 : a2a: 48 89 83 f0 09 00 add $0x401c,%rax 0.00 : a30: 00 48 mov (%rax),%eax 0.00 : a32: 8b 83 mov %eax,%eax 0.00 : a34: 70 05 00 add %rdx,%rax 0.00 : a37: 00 48 05 18 40 00 00 mov 0xa08(%rbx),%rdx 0.00 : a3e: 8b 00 89 c0 48 01 d0 mov %rax,0xa00(%rbx) 0.00 : a45: 48 8b 93 00 0a 00 00 mov 0x570(%rbx),%rax 0.00 : a4c: 48 89 83 f8 09 00 add $0x4020,%rax 0.00 : a52: 00 48 mov (%rax),%eax 0.00 : a54: 8b 83 mov %eax,%eax 0.00 : a56: 70 05 00 add %rdx,%rax 0.00 : a59: 00 48 05 1c 40 00 00 mov 0xa18(%rbx),%rdx 0.00 : a60: 8b 00 89 c0 48 01 d0 mov %rax,0xa08(%rbx) 0.00 : a67: 48 8b 93 08 0a 00 00 mov 0x570(%rbx),%rax 0.00 : a6e: 48 89 83 00 0a 00 add $0x4030,%rax 0.00 : a74: 00 48 mov (%rax),%eax 0.00 : a76: 8b 83 mov %eax,%eax 0.00 : a78: 70 05 00 add %rdx,%rax 0.00 : a7b: 00 48 05 20 40 00 00 mov 0xa38(%rbx),%rdx 0.00 : a82: 8b 00 89 c0 48 01 d0 mov %rax,0xa18(%rbx) 0.00 : a89: 48 8b 93 18 0a 00 00 mov 0x570(%rbx),%rax 0.00 : a90: 48 89 83 08 0a 00 add $0x4040,%rax 0.00 : a96: 00 48 mov (%rax),%eax 0.00 : a98: 8b 83 mov %eax,%eax 0.00 : a9a: 70 05 00 add %rdx,%rax 0.00 : a9d: 00 48 05 30 40 00 00 mov 0xa40(%rbx),%rdx 0.00 : aa4: 8b 00 89 c0 48 01 d0 mov %rax,0xa38(%rbx) 0.00 : aab: 48 8b 93 38 0a 00 00 mov 0x570(%rbx),%rax 0.00 : ab2: 48 89 83 18 0a 00 add $0x4048,%rax 0.00 : ab8: 00 48 mov (%rax),%eax 0.00 : aba: 8b 83 mov %eax,%eax 0.00 : abc: 70 05 00 add %rdx,%rax 0.00 : abf: 00 48 05 40 40 00 00 mov 0xa48(%rbx),%rdx 0.00 : ac6: 8b 00 89 c0 48 01 d0 mov %rax,0xa40(%rbx) 0.00 : acd: 48 8b 93 40 0a 00 00 mov 0x570(%rbx),%rax 0.00 : ad4: 48 89 83 38 0a 00 add $0x404c,%rax 0.00 : ada: 00 48 mov (%rax),%eax 0.00 : adc: 8b 83 mov %eax,%eax 0.00 : ade: 70 05 00 add %rdx,%rax 0.00 : ae1: 00 48 05 48 40 00 00 mov 0xa50(%rbx),%rdx 0.00 : ae8: 8b 00 89 c0 48 01 d0 mov %rax,0xa48(%rbx) 0.00 : aef: 48 8b 93 48 0a 00 00 mov 0x570(%rbx),%rax 0.00 : af6: 48 89 83 40 0a 00 add $0x4050,%rax 0.00 : afc: 00 48 mov (%rax),%eax 0.00 : afe: 8b 83 mov %eax,%eax 0.00 : b00: 70 05 00 add %rdx,%rax 0.00 : b03: 00 48 05 4c 40 00 00 mov 0xa58(%rbx),%rdx 0.00 : b0a: 8b 00 89 c0 48 01 d0 mov %rax,0xa50(%rbx) 0.00 : b11: 48 8b 93 50 0a 00 00 mov 0x570(%rbx),%rax 0.00 : b18: 48 89 83 48 0a 00 add $0x4054,%rax 0.00 : b1e: 00 48 mov (%rax),%eax 0.00 : b20: 8b 83 mov %eax,%eax 0.00 : b22: 70 05 00 add %rdx,%rax 0.00 : b25: 00 48 05 50 40 00 00 mov 0xa60(%rbx),%rdx 0.00 : b2c: 8b 00 89 c0 48 01 d0 mov %rax,0xa58(%rbx) 0.00 : b33: 48 8b 93 58 0a 00 00 mov 0x570(%rbx),%rax 0.00 : b3a: 48 89 83 50 0a 00 add $0x4058,%rax 0.00 : b40: 00 48 mov (%rax),%eax 0.00 : b42: 8b 83 mov %eax,%eax 0.00 : b44: 70 05 00 add %rdx,%rax 0.00 : b47: 00 48 05 54 40 00 00 mov 0xab0(%rbx),%rdx 0.00 : b4e: 8b 00 89 c0 48 01 d0 mov %rax,0xa60(%rbx) 0.00 : b55: 48 8b 93 60 0a 00 00 mov 0x570(%rbx),%rax 0.00 : b5c: 48 89 83 58 0a 00 add $0x4080,%rax 0.00 : b62: 00 48 mov (%rax),%eax 0.00 : b64: 8b 83 mov %eax,%eax 0.00 : b66: 70 05 00 add %rdx,%rax 0.00 : b69: 00 48 05 58 40 00 00 mov 0xac0(%rbx),%rdx 0.00 : b70: 8b 00 89 c0 48 01 d0 mov %rax,0xab0(%rbx) 0.00 : b77: 48 8b 93 b0 0a 00 00 mov 0x570(%rbx),%rax 0.00 : b7e: 48 89 83 60 0a 00 add $0x4090,%rax 0.00 : b84: 00 48 mov (%rax),%eax 0.00 : b86: 8b 83 mov %eax,%eax 0.00 : b88: 70 05 00 add %rdx,%rax 0.00 : b8b: 00 48 05 80 40 00 00 mov %rax,0xac0(%rbx) 0.00 : b92: 8b 00 89 c0 48 01 d0 mov 0x570(%rbx),%rax 0.00 : b99: 48 8b 93 c0 0a 00 add $0x4094,%rax 0.00 : b9f: 00 48 mov (%rax),%eax 0.00 : ba1: 89 83 b0 0a 00 00 48 mov 0x570(%rbx),%rax 0.00 : ba8: 8b 83 70 05 00 00 48 mov 0xac8(%rbx),%rdx 0.00 : baf: 05 90 40 00 00 8b add $0x40a0,%rax 0.00 : bb5: 00 89 mov (%rax),%eax 0.00 : bb7: c0 48 mov %eax,%eax 0.00 : bb9: 01 d0 48 add %rdx,%rax 0.00 : bbc: 89 83 c0 0a 00 00 48 mov 0xad0(%rbx),%rdx 0.00 : bc3: 8b 83 70 05 00 00 48 mov %rax,0xac8(%rbx) 0.00 : bca: 05 94 40 00 00 8b 00 mov 0x570(%rbx),%rax 0.00 : bd1: 48 8b 83 70 05 00 add $0x40a4,%rax 0.00 : bd7: 00 48 mov (%rax),%eax 0.00 : bd9: 8b 93 mov %eax,%eax 0.00 : bdb: c8 0a 00 add %rdx,%rax 0.00 : bde: 00 48 05 a0 40 00 00 mov 0xad8(%rbx),%rdx 0.00 : be5: 8b 00 89 c0 48 01 d0 mov %rax,0xad0(%rbx) 0.00 : bec: 48 8b 93 d0 0a 00 00 mov 0x570(%rbx),%rax 0.00 : bf3: 48 89 83 c8 0a 00 add $0x40a8,%rax 0.00 : bf9: 00 48 mov (%rax),%eax 0.00 : bfb: 8b 83 mov %eax,%eax 0.00 : bfd: 70 05 00 add %rdx,%rax 0.00 : c00: 00 48 05 a4 40 00 00 mov 0xae8(%rbx),%rdx 0.00 : c07: 8b 00 89 c0 48 01 d0 mov %rax,0xad8(%rbx) 0.00 : c0e: 48 8b 93 d8 0a 00 00 mov 0x570(%rbx),%rax 0.00 : c15: 48 89 83 d0 0a 00 add $0x40b0,%rax 0.00 : c1b: 00 48 mov (%rax),%eax 0.00 : c1d: 8b 83 mov %eax,%eax 0.00 : c1f: 70 05 00 add %rdx,%rax 0.00 : c22: 00 48 05 a8 40 00 00 mov 0xb08(%rbx),%rdx 0.00 : c29: 8b 00 89 c0 48 01 d0 mov %rax,0xae8(%rbx) 0.00 : c30: 48 8b 93 e8 0a 00 00 mov 0x570(%rbx),%rax 0.00 : c37: 48 89 83 d8 0a 00 add $0x40c4,%rax 0.00 : c3d: 00 48 mov (%rax),%eax 0.00 : c3f: 8b 83 mov %eax,%eax 0.00 : c41: 70 05 00 add %rdx,%rax 0.00 : c44: 00 48 05 b0 40 00 00 mov 0xb10(%rbx),%rdx 0.00 : c4b: 8b 00 89 c0 48 01 d0 mov %rax,0xb08(%rbx) 0.00 : c52: 48 8b 93 08 0b 00 00 mov 0x570(%rbx),%rax 0.00 : c59: 48 89 83 e8 0a 00 add $0x40cc,%rax 0.00 : c5f: 00 48 mov (%rax),%eax 0.00 : c61: 8b 83 mov %eax,%eax 0.00 : c63: 70 05 00 add %rdx,%rax 0.00 : c66: 00 48 05 c4 40 00 00 mov 0xb18(%rbx),%rdx 0.00 : c6d: 8b 00 89 c0 48 01 d0 mov %rax,0xb10(%rbx) 0.00 : c74: 48 8b 93 10 0b 00 00 mov 0x570(%rbx),%rax 0.00 : c7b: 48 89 83 08 0b 00 add $0x40d0,%rax 0.00 : c81: 00 48 mov (%rax),%eax 0.00 : c83: 8b 83 mov %eax,%eax 0.00 : c85: 70 05 00 add %rdx,%rax 0.00 : c88: 00 48 05 cc 40 00 00 mov 0xb28(%rbx),%rdx 0.00 : c8f: 8b 00 89 c0 48 01 d0 mov %rax,0xb18(%rbx) 0.00 : c96: 48 8b 93 18 0b 00 00 mov 0x570(%rbx),%rax 0.00 : c9d: 48 89 83 10 0b 00 add $0x40d8,%rax 0.00 : ca3: 00 48 mov (%rax),%eax 0.00 : ca5: 8b 83 mov %eax,%eax 0.00 : ca7: 70 05 00 add %rdx,%rax 0.00 : caa: 00 48 05 d0 40 00 00 mov 0xb30(%rbx),%rdx 0.00 : cb1: 8b 00 89 c0 48 01 d0 mov %rax,0xb28(%rbx) 0.00 : cb8: 48 8b 93 28 0b 00 00 mov 0x570(%rbx),%rax 0.00 : cbf: 48 89 83 18 0b 00 add $0x40dc,%rax 0.00 : cc5: 00 48 mov (%rax),%eax 0.00 : cc7: 8b 83 mov %eax,%eax 0.00 : cc9: 70 05 00 add %rdx,%rax 0.00 : ccc: 00 48 05 d8 40 00 00 mov 0xb38(%rbx),%rdx 0.00 : cd3: 8b 00 89 c0 48 01 d0 mov %rax,0xb30(%rbx) 0.00 : cda: 48 8b 93 30 0b 00 00 mov 0x570(%rbx),%rax 0.00 : ce1: 48 89 83 28 0b 00 add $0x40e0,%rax 0.00 : ce7: 00 48 mov (%rax),%eax 0.00 : ce9: 8b 83 mov %eax,%eax 0.00 : ceb: 70 05 00 add %rdx,%rax 0.00 : cee: 00 48 05 dc 40 00 00 mov 0xb40(%rbx),%rdx 0.00 : cf5: 8b 00 89 c0 48 01 d0 mov %rax,0xb38(%rbx) 0.00 : cfc: 48 8b 93 38 0b 00 00 mov 0x570(%rbx),%rax 0.00 : d03: 48 89 83 30 0b 00 add $0x40e4,%rax 0.00 : d09: 00 48 mov (%rax),%eax 0.00 : d0b: 8b 83 mov %eax,%eax 0.00 : d0d: 70 05 00 add %rdx,%rax 0.00 : d10: 00 48 05 e0 40 00 00 mov 0xb48(%rbx),%rdx 0.00 : d17: 8b 00 89 c0 48 01 d0 mov %rax,0xb40(%rbx) 0.00 : d1e: 48 8b 93 40 0b 00 00 mov 0x570(%rbx),%rax 0.00 : d25: 48 89 83 38 0b 00 add $0x40e8,%rax 0.00 : d2b: 00 48 mov (%rax),%eax 0.00 : d2d: 8b 83 mov %eax,%eax 0.00 : d2f: 70 05 00 add %rdx,%rax 0.00 : d32: 00 48 05 e4 40 00 00 mov 0xb50(%rbx),%rdx 0.00 : d39: 8b 00 89 c0 48 01 d0 mov %rax,0xb48(%rbx) 0.00 : d40: 48 8b 93 48 0b 00 00 mov 0x570(%rbx),%rax 0.00 : d47: 48 89 83 40 0b 00 add $0x40ec,%rax 0.00 : d4d: 00 48 mov (%rax),%eax 0.00 : d4f: 8b 83 mov %eax,%eax 0.00 : d51: 70 05 00 add %rdx,%rax 0.00 : d54: 00 48 05 e8 40 00 00 mov 0xb58(%rbx),%rdx 0.00 : d5b: 8b 00 89 c0 48 01 d0 mov %rax,0xb50(%rbx) 0.00 : d62: 48 8b 93 50 0b 00 00 mov 0x570(%rbx),%rax 0.00 : d69: 48 89 83 48 0b 00 add $0x40f0,%rax 0.00 : d6f: 00 48 mov (%rax),%eax 0.00 : d71: 8b 83 mov %eax,%eax 0.00 : d73: 70 05 00 add %rdx,%rax 0.00 : d76: 00 48 05 ec 40 00 00 mov 0xb60(%rbx),%rdx 0.00 : d7d: 8b 00 89 c0 48 01 d0 mov %rax,0xb58(%rbx) 0.00 : d84: 48 8b 93 58 0b 00 00 mov 0x570(%rbx),%rax 0.00 : d8b: 48 89 83 50 0b 00 add $0x40f4,%rax 0.00 : d91: 00 48 mov (%rax),%eax 0.00 : d93: 8b 83 mov %eax,%eax 0.00 : d95: 70 05 00 add %rdx,%rax 0.00 : d98: 00 48 05 f0 40 00 00 mov 0xb20(%rbx),%rdx 0.00 : d9f: 8b 00 89 c0 48 01 d0 mov %rax,0xb60(%rbx) 0.00 : da6: 48 8b 93 60 0b 00 00 mov 0x570(%rbx),%rax 0.00 : dad: 48 89 83 58 0b 00 add $0x40d4,%rax 0.00 : db3: 00 48 mov (%rax),%eax 0.00 : db5: 8b 83 mov %eax,%eax 0.00 : db7: 70 05 00 add %rdx,%rax 0.00 : dba: 00 48 05 f4 40 00 00 mov 0xa10(%rbx),%rdx 0.00 : dc1: 8b 00 89 c0 48 01 d0 mov %rax,0xb20(%rbx) 0.00 : dc8: 48 8b 93 20 0b 00 00 mov 0x570(%rbx),%rax 0.00 : dcf: 48 89 83 60 0b 00 add $0x4028,%rax 0.00 : dd5: 00 48 mov (%rax),%eax 0.00 : dd7: 8b 83 mov %eax,%eax 0.00 : dd9: 70 05 00 add %rdx,%rax 0.00 : ddc: 00 48 05 d4 40 00 00 mov 0x9d0(%rbx),%rdx 0.00 : de3: 8b 00 89 c0 48 01 d0 mov %rax,0xa10(%rbx) 0.00 : dea: 48 8b 93 10 0a 00 00 mov 0x570(%rbx),%rax 0.00 : df1: 48 89 83 20 0b 00 add $0x4004,%rax 0.00 : df7: 00 48 mov (%rax),%eax 0.00 : df9: 8b 83 mov %eax,%eax 0.00 : dfb: 70 05 00 add %rdx,%rax 0.00 : dfe: 00 48 05 28 40 00 00 mov %rax,0x9d0(%rbx) 0.00 : e05: 8b 00 89 c0 48 01 d0 mov 0x570(%rbx),%rax 0.00 : e0c: 48 8b 93 d0 add $0x18,%rax 0.00 : e10: 09 00 mov (%rax),%eax 0.00 : e12: 00 48 89 83 10 test $0xc00000,%eax 0.00 : e17: 0a 00 jne e6c 0.00 : e19: 00 48 8b 83 70 05 00 mov 0x570(%rbx),%rax 0.00 : e20: 00 48 05 04 40 00 00 mov 0x9e0(%rbx),%rdx 0.00 : e27: 8b 00 89 c0 48 01 add $0x400c,%rax 0.00 : e2d: d0 48 mov (%rax),%eax 0.00 : e2f: 89 83 mov %eax,%eax 0.00 : e31: d0 09 00 add %rdx,%rax 0.00 : e34: 00 48 8b 83 70 05 00 mov %rax,0x9e0(%rbx) 0.00 : e3b: 00 48 83 c0 18 8b mov 0x5e4(%rbx),%eax 0.00 : e41: 00 a9 00 sub $0x5,%eax 0.00 : e44: 00 c0 00 cmp $0x1,%eax 0.00 : e47: 75 53 jbe e6c 0.00 : e49: 48 8b 83 70 05 00 00 mov 0x570(%rbx),%rdx 0.00 : e50: 48 8b 93 e0 09 00 00 mov 0xa20(%rbx),%rax 0.00 : e57: 48 05 0c 40 00 00 8b add $0x4034,%rdx 0.00 : e5e: 00 89 mov (%rdx),%edx 0.00 : e60: c0 48 mov %edx,%edx 0.00 : e62: 01 d0 48 add %rax,%rdx 0.00 : e65: 89 83 e0 09 00 00 8b mov %rdx,0xa20(%rbx) 0.00 : e6c: 83 e4 05 00 00 83 e8 mov 0x570(%rbx),%rax 0.00 : e73: 05 83 f8 01 76 23 48 mov 0xb68(%rbx),%rdx 0.00 : e7a: 8b 93 70 05 00 00 add $0x40f8,%rax 0.00 : e80: 48 8b mov (%rax),%eax ??:0 50.00 : e82: 83 20 mov %eax,%eax 0.00 : e84: 0a 00 00 add %rdx,%rax 0.00 : e87: 48 81 c2 34 40 00 00 mov 0xb70(%rbx),%rdx 0.00 : e8e: 8b 12 89 d2 48 01 c2 mov %rax,0xb68(%rbx) 0.00 : e95: 48 89 93 20 0a 00 00 mov 0x570(%rbx),%rax 0.00 : e9c: 48 8b 83 70 05 00 add $0x40fc,%rax 0.00 : ea2: 00 48 mov (%rax),%eax 0.00 : ea4: 8b 93 mov %eax,%eax 0.00 : ea6: 68 0b 00 add %rdx,%rax 0.00 : ea9: 00 48 05 f8 40 00 00 mov 0xb78(%rbx),%rdx 0.00 : eb0: 8b 00 89 c0 48 01 d0 mov %rax,0xb70(%rbx) 0.00 : eb7: 48 8b 93 70 0b 00 00 mov 0x570(%rbx),%rax 0.00 : ebe: 48 89 83 68 0b 00 add $0x4100,%rax 0.00 : ec4: 00 48 mov (%rax),%eax 0.00 : ec6: 8b 83 mov %eax,%eax 0.00 : ec8: 70 05 00 add %rdx,%rax 0.00 : ecb: 00 48 05 fc 40 00 00 mov 0xbb8(%rbx),%rdx 0.00 : ed2: 8b 00 89 c0 48 01 d0 mov %rax,0xb78(%rbx) 0.00 : ed9: 48 8b 93 78 0b 00 00 mov 0x570(%rbx),%rax 0.00 : ee0: 48 89 83 70 0b 00 add $0x4124,%rax 0.00 : ee6: 00 48 mov (%rax),%eax 0.00 : ee8: 8b 83 mov %eax,%eax 0.00 : eea: 70 05 00 add %rdx,%rax 0.00 : eed: 00 48 05 00 41 00 00 mov 0xb80(%rbx),%rdx 0.00 : ef4: 8b 00 89 c0 48 01 d0 mov %rax,0xbb8(%rbx) 0.00 : efb: 48 8b 93 b8 0b 00 00 mov 0x570(%rbx),%rax 0.00 : f02: 48 89 83 78 0b 00 add $0x4104,%rax 0.00 : f08: 00 48 mov (%rax),%eax 0.00 : f0a: 8b 83 mov %eax,%eax 0.00 : f0c: 70 05 00 add %rdx,%rax 0.00 : f0f: 00 48 05 24 41 00 00 mov 0xb88(%rbx),%rdx 0.00 : f16: 8b 00 89 c0 48 01 d0 mov %rax,0xb80(%rbx) 0.00 : f1d: 48 8b 93 80 0b 00 00 mov 0x570(%rbx),%rax 0.00 : f24: 48 89 83 b8 0b 00 add $0x4108,%rax 0.00 : f2a: 00 48 mov (%rax),%eax 0.00 : f2c: 8b 83 mov %eax,%eax 0.00 : f2e: 70 05 00 add %rdx,%rax 0.00 : f31: 00 48 05 04 41 00 00 mov 0xb90(%rbx),%rdx 0.00 : f38: 8b 00 89 c0 48 01 d0 mov %rax,0xb88(%rbx) 0.00 : f3f: 48 8b 93 88 0b 00 00 mov 0x570(%rbx),%rax 0.00 : f46: 48 89 83 80 0b 00 add $0x410c,%rax 0.00 : f4c: 00 48 mov (%rax),%eax 0.00 : f4e: 8b 83 mov %eax,%eax 0.00 : f50: 70 05 00 add %rdx,%rax 0.00 : f53: 00 48 05 08 41 00 00 mov 0xb98(%rbx),%rdx 0.00 : f5a: 8b 00 89 c0 48 01 d0 mov %rax,0xb90(%rbx) 0.00 : f61: 48 8b 93 90 0b 00 00 mov 0x570(%rbx),%rax 0.00 : f68: 48 89 83 88 0b 00 add $0x4110,%rax 0.00 : f6e: 00 48 mov (%rax),%eax 0.00 : f70: 8b 83 mov %eax,%eax 0.00 : f72: 70 05 00 add %rdx,%rax 0.00 : f75: 00 48 05 0c 41 00 00 mov 0xba0(%rbx),%rdx 0.00 : f7c: 8b 00 89 c0 48 01 d0 mov %rax,0xb98(%rbx) 0.00 : f83: 48 8b 93 98 0b 00 00 mov 0x570(%rbx),%rax 0.00 : f8a: 48 89 83 90 0b 00 add $0x4118,%rax 0.00 : f90: 00 48 mov (%rax),%eax 0.00 : f92: 8b 83 mov %eax,%eax 0.00 : f94: 70 05 00 add %rdx,%rax 0.00 : f97: 00 48 05 10 41 00 00 mov 0xba8(%rbx),%rdx 0.00 : f9e: 8b 00 89 c0 48 01 d0 mov %rax,0xba0(%rbx) 0.00 : fa5: 48 8b 93 a0 0b 00 00 mov 0x570(%rbx),%rax 0.00 : fac: 48 89 83 98 0b 00 add $0x411c,%rax 0.00 : fb2: 00 48 mov (%rax),%eax 0.00 : fb4: 8b 83 mov %eax,%eax 0.00 : fb6: 70 05 00 add %rdx,%rax 0.00 : fb9: 00 48 05 18 41 00 00 mov 0xbb0(%rbx),%rdx 0.00 : fc0: 8b 00 89 c0 48 01 d0 mov %rax,0xba8(%rbx) 0.00 : fc7: 48 8b 93 a8 0b 00 00 mov 0x570(%rbx),%rax 0.00 : fce: 48 89 83 a0 0b 00 add $0x4120,%rax 0.00 : fd4: 00 48 mov (%rax),%eax 0.00 : fd6: 8b 83 mov %eax,%eax 0.00 : fd8: 70 05 00 add %rdx,%rax 0.00 : fdb: 00 48 05 1c 41 00 00 mov %rax,0xbb0(%rbx) 0.00 : fe2: 8b 00 89 c0 48 01 d0 mov 0xaa8(%rbx),%rax 0.00 : fe9: 48 8b 93 b0 mov %rax,0x40(%rsi) 0.00 : fed: 0b 00 00 48 89 83 a8 mov 0xa10(%rbx),%rax 0.00 : ff4: 0b 00 00 48 mov %rax,0x48(%rsi) 0.00 : ff8: 8b 83 70 05 00 00 48 mov 0x9c8(%rbx),%rax 0.00 : fff: 05 20 41 00 00 8b 00 add 0x9e0(%rbx),%rax 0.00 : 1006: 89 c0 48 01 d0 48 89 add 0x9d0(%rbx),%rax 0.00 : 100d: 83 b0 0b 00 00 48 8b add 0xad0(%rbx),%rax 0.00 : 1014: 83 a8 0a 00 00 48 89 add 0xae0(%rbx),%rax 0.00 : 101b: 46 40 48 8b 83 10 0a add 0xa30(%rbx),%rax 0.00 : 1022: 00 00 48 89 mov %rax,0x20(%rsi) 0.00 : 1026: 46 48 48 8b 83 c8 09 mov 0xae0(%rbx),%rax 0.00 : 102d: 00 00 48 03 83 e0 09 add 0xad0(%rbx),%rax 0.00 : 1034: 00 00 48 03 mov %rax,0x50(%rsi) 0.00 : 1038: 83 d0 09 00 00 48 03 mov 0x9c8(%rbx),%rax 0.00 : 103f: 83 d0 0a 00 mov %rax,0x60(%rsi) 0.00 : 1043: 00 48 03 83 e0 0a 00 mov 0x9d0(%rbx),%rax 0.00 : 104a: 00 48 03 83 mov %rax,0x68(%rsi) 0.00 : 104e: 30 0a 00 00 48 89 46 mov 0x9e8(%rbx),%rax 0.00 : 1055: 20 48 8b 83 mov %rax,0x78(%rsi) 0.00 : 1059: e0 0a 00 00 48 03 83 mov 0xa08(%rbx),%rax 0.00 : 1060: d0 0a 00 00 48 89 46 add 0x9f8(%rbx),%rax 0.00 : 1067: 50 48 8b 83 mov %rax,0x28(%rsi) 0.00 : 106b: c8 09 00 00 48 89 46 mov 0x9f8(%rbx),%rax 0.00 : 1072: 60 48 8b 83 d0 09 00 mov %rax,0x80(%rsi) 0.00 : 1079: 00 48 89 46 68 48 8b mov 0xa08(%rbx),%rax 0.00 : 1080: 83 e8 09 00 00 48 89 mov %rax,0xa0(%rsi) 0.00 : 1087: 46 78 48 8b 83 08 0a mov 0xa20(%rbx),%rax 0.00 : 108e: 00 00 48 03 83 f8 09 mov %rax,0x88(%rsi) 0.00 : 1095: 00 00 48 89 46 28 48 cmpl $0x1,0x8bc(%rbx) 0.00 : 109c: 8b 83 f8 09 00 00 je 11b0 0.00 : 10a2: 48 89 86 80 00 00 00 mov 0x570(%rbx),%rax 0.00 : 10a9: 48 8b 83 08 0a 00 00 mov 0xb00(%rbx),%rdx 0.00 : 10b0: 48 89 86 a0 00 00 add $0x40bc,%rax 0.00 : 10b6: 00 48 mov (%rax),%eax 0.00 : 10b8: 8b 83 mov %eax,%eax 0.00 : 10ba: 20 0a 00 add %rdx,%rax 0.00 : 10bd: 00 48 89 86 88 00 00 mov 0xaf0(%rbx),%rdx 0.00 : 10c4: 00 83 bb bc 08 00 00 mov %rax,0xb00(%rbx) 0.00 : 10cb: 01 0f 84 0e 01 00 00 mov 0x570(%rbx),%rax 0.00 : 10d2: 48 8b 83 70 05 00 add $0x40b4,%rax 0.00 : 10d8: 00 48 mov (%rax),%eax 0.00 : 10da: 8b 93 mov %eax,%eax 0.00 : 10dc: 00 0b 00 add %rdx,%rax 0.00 : 10df: 00 48 05 bc 40 00 00 mov 0xaf8(%rbx),%rdx 0.00 : 10e6: 8b 00 89 c0 48 01 d0 mov %rax,0xaf0(%rbx) 0.00 : 10ed: 48 8b 93 f0 0a 00 00 mov 0x570(%rbx),%rax 0.00 : 10f4: 48 89 83 00 0b 00 add $0x40b8,%rax 0.00 : 10fa: 00 48 mov (%rax),%eax 0.00 : 10fc: 8b 83 mov %eax,%eax 0.00 : 10fe: 70 05 00 add %rdx,%rax 0.00 : 1101: 00 48 05 b4 40 00 00 mov %rax,0xaf8(%rbx) 0.00 : 1108: 8b 00 89 c0 48 01 d0 mov 0x570(%rbx),%rax 0.00 : 110f: 48 8b 93 f8 0a 00 add $0x5820,%rax 0.00 : 1115: 00 48 mov (%rax),%eax 50.00 : 1117: 89 83 f0 0a 00 test $0x10000000,%eax 0.00 : 111c: 00 48 8b 83 70 05 je 722 0.00 : 1122: 00 00 48 05 b8 40 00 mov 0x570(%rbx),%rax 0.00 : 1129: 00 8b 00 89 c0 48 01 mov 0xc28(%rbx),%rdx 0.00 : 1130: d0 48 89 83 f8 0a add $0x8fe4,%rax 0.00 : 1136: 00 00 mov (%rax),%eax 0.00 : 1138: 48 8b mov %eax,%eax 0.00 : 113a: 83 70 05 add %rdx,%rax 0.00 : 113d: 00 00 48 05 20 58 00 mov 0xc30(%rbx),%rdx 0.00 : 1144: 00 8b 00 a9 00 00 00 mov %rax,0xc28(%rbx) 0.00 : 114b: 10 0f 84 00 f6 ff ff mov 0x570(%rbx),%rax 0.00 : 1152: 48 8b 83 70 05 00 add $0x415c,%rax 0.00 : 1158: 00 48 mov (%rax),%eax 0.00 : 115a: 8b 93 mov %eax,%eax 0.00 : 115c: 28 0c 00 add %rdx,%rax 0.00 : 115f: 00 48 05 e4 8f 00 00 mov 0xc38(%rbx),%rdx 0.00 : 1166: 8b 00 89 c0 48 01 d0 mov %rax,0xc30(%rbx) 0.00 : 116d: 48 8b 93 30 0c 00 00 mov 0x570(%rbx),%rax 0.00 : 1174: 48 89 83 28 0c 00 add $0x8fe0,%rax 0.00 : 117a: 00 48 mov (%rax),%eax 0.00 : 117c: 8b 83 mov %eax,%eax 0.00 : 117e: 70 05 00 add %rdx,%rax 0.00 : 1181: 00 48 05 5c 41 00 00 mov 0xc40(%rbx),%rdx 0.00 : 1188: 8b 00 89 c0 48 01 d0 mov %rax,0xc38(%rbx) 0.00 : 118f: 48 8b 93 38 0c 00 00 mov 0x570(%rbx),%rax 0.00 : 1196: 48 89 83 30 0c 00 add $0x4158,%rax 0.00 : 119c: 00 48 mov (%rax),%eax 0.00 : 119e: 8b 83 mov %eax,%eax 0.00 : 11a0: 70 05 00 add %rdx,%rax 0.00 : 11a3: 00 48 05 e0 8f 00 00 mov %rax,0xc40(%rbx) 0.00 : 11aa: 8b 00 89 c0 add $0x10,%rsp 0.00 : 11ae: 48 pop %rbx 0.00 : 11af: 01 retq 0.00 : 11b0: d0 48 8b 93 40 0c 00 cmpw $0x3e8,0x3f8(%rbx) 0.00 : 11b7: 00 48 0.00 : 11b9: 89 83 38 0c 00 00 jne 10a2 0.00 : 11bf: 48 8b 83 70 05 00 00 mov 0x860(%rbx),%rax 0.00 : 11c6: 48 05 58 test %rax,%rax 0.00 : 11c9: 41 00 je 11e6 0.00 : 11cb: 00 8b 00 89 c0 lea 0xe(%rsp),%rdx 0.00 : 11d0: 48 01 d0 48 89 83 40 lea 0x568(%rbx),%rdi 0.00 : 11d7: 0c 00 00 48 83 mov $0xa,%esi 0.00 : 11dc: c4 10 callq *%rax 0.00 : 11de: 5b c3 test %eax,%eax 0.00 : 11e0: 66 81 bb f8 03 00 jne 10a2 0.00 : 11e6: 00 e8 03 0f 85 movzbl 0xe(%rsp),%eax 0.00 : 11eb: e3 fe ff ff 48 mov %ax,0xe(%rsp) 0.00 : 11f0: 8b 83 60 movzwl %ax,%eax 0.00 : 11f3: 08 00 00 48 85 c0 add %eax,0xcf8(%rbx) 0.00 : 11f9: 74 1b 48 8d 54 jmpq 10a2 : 11fe: 24 0e xchg %ax,%ax : 1200: 48 8d bb 68 sub $0x18,%rsp : 1204: 05 00 00 be mov %rbx,(%rsp) : 1208: 0a 00 00 00 ff mov %rbp,0x8(%rsp) : 120d: d0 85 c0 mov %rdi,%rbx : 1210: 0f 85 bc fe ff mov %r12,0x10(%rsp) : 1215: ff 0f b6 44 mov 0x20(%rdi),%rsi : 1219: 24 0e 66 mov (%rdi),%rbp : 121c: 89 44 24 test %rsi,%rsi : 121f: 0e 0f b7 c0 01 83 je 13b0 : 1225: f8 0c 00 00 e9 a4 fe testb $0x3,0x220(%rbp) : 122c: ff ff je 127b 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/drivers/net/ethernet/intel/ixgbe/ixgbe.ko ---------------------------------------------- 50.00 ??:0 50.00 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/drivers/net/ethernet/intel/ixgbe/ixgbe.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000002d10 : : : return IRQ_HANDLED; : } : : static irqreturn_t ixgbe_msix_clean_rings(int irq, void *data) : { 0.00 : 2d10: 48 83 ec 08 sub $0x8,%rsp : struct ixgbe_q_vector *q_vector = data; : : /* EIAM disabled interrupts (on this vector) for us */ : : if (q_vector->rx.ring || q_vector->tx.ring) ??:0 50.00 : 2d14: 48 83 7e 10 00 cmpq $0x0,0x10(%rsi) 50.00 : 2d19: 74 2d je 2d48 : return oldbit; : } : : static __always_inline int constant_test_bit(unsigned int nr, const volatile unsigned long *addr) : { : return ((1UL << (nr % BITS_PER_LONG)) & 0.00 : 2d1b: 48 8b 46 50 mov 0x50(%rsi),%rax : : extern void __napi_schedule(struct napi_struct *n); : : static inline int napi_disable_pending(struct napi_struct *n) : { : return test_bit(NAPI_STATE_DISABLE, &n->state); 0.00 : 2d1f: 48 8d 56 50 lea 0x50(%rsi),%rdx : * insure only one NAPI poll instance runs. We also make : * sure there is no pending NAPI disable. : */ : static inline int napi_schedule_prep(struct napi_struct *n) : { : return !napi_disable_pending(n) && 0.00 : 2d23: a8 02 test $0x2,%al 0.00 : 2d25: 75 14 jne 2d3b : */ : static inline int test_and_set_bit(int nr, volatile unsigned long *addr) : { : int oldbit; : : asm volatile(LOCK_PREFIX "bts %2,%1\n\t" 0.00 : 2d27: f0 0f ba 2a 00 lock btsl $0x0,(%rdx) 0.00 : 2d2c: 19 c0 sbb %eax,%eax 0.00 : 2d2e: 85 c0 test %eax,%eax 0.00 : 2d30: 75 09 jne 2d3b : * running. : */ : static inline void napi_schedule(struct napi_struct *n) : { : if (napi_schedule_prep(n)) : __napi_schedule(n); 0.00 : 2d32: 48 8d 7e 40 lea 0x40(%rsi),%rdi 0.00 : 2d36: e8 00 00 00 00 callq 2d3b : napi_schedule(&q_vector->napi); : : return IRQ_HANDLED; : } 0.00 : 2d3b: b8 01 00 00 00 mov $0x1,%eax 0.00 : 2d40: 48 83 c4 08 add $0x8,%rsp 0.00 : 2d44: c3 retq 0.00 : 2d45: 0f 1f 00 nopl (%rax) : { : struct ixgbe_q_vector *q_vector = data; : : /* EIAM disabled interrupts (on this vector) for us */ : : if (q_vector->rx.ring || q_vector->tx.ring) 0.00 : 2d48: 48 83 7e 28 00 cmpq $0x0,0x28(%rsi) 0.00 : 2d4d: 75 cc jne 2d1b 0.00 : 2d4f: 90 nop 0.00 : 2d50: eb e9 jmp 2d3b Sorted summary for file /lib/modules/3.0.101-0.15-default/kernel/drivers/net/ethernet/intel/ixgbe/ixgbe.ko ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/drivers/net/ethernet/intel/ixgbe/ixgbe.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000007c00 : : return true; : } : : static struct sk_buff *ixgbe_fetch_rx_buffer(struct ixgbe_ring *rx_ring, : union ixgbe_adv_rx_desc *rx_desc) : { ??:0 100.00 : 7c00: 48 83 ec 38 sub $0x38,%rsp 0.00 : 7c04: 48 89 6c 24 10 mov %rbp,0x10(%rsp) 0.00 : 7c09: 4c 89 6c 24 20 mov %r13,0x20(%rsp) 0.00 : 7c0e: 48 89 fd mov %rdi,%rbp 0.00 : 7c11: 48 89 5c 24 08 mov %rbx,0x8(%rsp) 0.00 : 7c16: 4c 89 64 24 18 mov %r12,0x18(%rsp) 0.00 : 7c1b: 49 89 f5 mov %rsi,%r13 0.00 : 7c1e: 4c 89 74 24 28 mov %r14,0x28(%rsp) 0.00 : 7c23: 4c 89 7c 24 30 mov %r15,0x30(%rsp) : struct ixgbe_rx_buffer *rx_buffer; : struct sk_buff *skb; : struct page *page; : : rx_buffer = &rx_ring->rx_buffer_info[rx_ring->next_to_clean]; 0.00 : 7c28: 0f b7 5f 52 movzwl 0x52(%rdi),%ebx 0.00 : 7c2c: 48 c1 e3 05 shl $0x5,%rbx 0.00 : 7c30: 48 03 5f 28 add 0x28(%rdi),%rbx : page = rx_buffer->page; 0.00 : 7c34: 48 8b 53 10 mov 0x10(%rbx),%rdx : * Useful for spinlocks to avoid one state transition in the : * cache coherency protocol: : */ : static inline void prefetchw(const void *x) : { : alternative_input(BASE_PREFETCH, 0.00 : 7c38: 0f 18 0a prefetcht0 (%rdx) : prefetchw(page); : : skb = rx_buffer->skb; 0.00 : 7c3b: 4c 8b 23 mov (%rbx),%r12 : : if (likely(!skb)) { 0.00 : 7c3e: 4d 85 e4 test %r12,%r12 0.00 : 7c41: 0f 85 49 02 00 00 jne 7e90 : * It's not worth to care about 3dnow prefetches for the K6 : * because they are microcoded there and very slow. : */ : static inline void prefetch(const void *x) : { : alternative_input(BASE_PREFETCH, 0.00 : 7c47: 48 b8 00 00 00 00 00 movabs $0x160000000000,%rax 0.00 : 7c4e: 16 00 00 0.00 : 7c51: 48 8d 04 02 lea (%rdx,%rax,1),%rax 0.00 : 7c55: 48 ba b7 6d db b6 6d movabs $0x6db6db6db6db6db7,%rdx 0.00 : 7c5c: db b6 6d 0.00 : 7c5f: 48 c1 f8 03 sar $0x3,%rax 0.00 : 7c63: 48 0f af c2 imul %rdx,%rax 0.00 : 7c67: 48 ba 00 00 00 00 00 movabs $0xffff880000000000,%rdx 0.00 : 7c6e: 88 ff ff 0.00 : 7c71: 48 c1 e0 0c shl $0xc,%rax 0.00 : 7c75: 48 01 d0 add %rdx,%rax 0.00 : 7c78: 8b 53 18 mov 0x18(%rbx),%edx 0.00 : 7c7b: 48 01 d0 add %rdx,%rax 0.00 : 7c7e: 0f 18 08 prefetcht0 (%rax) : } : : static inline struct sk_buff *__netdev_alloc_skb_ip_align(struct net_device *dev, : unsigned int length, gfp_t gfp) : { : struct sk_buff *skb = __netdev_alloc_skb(dev, length + NET_IP_ALIGN, gfp); 0.00 : 7c81: 48 8b 7f 10 mov 0x10(%rdi),%rdi 0.00 : 7c85: ba 20 00 00 00 mov $0x20,%edx 0.00 : 7c8a: be 00 01 00 00 mov $0x100,%esi 0.00 : 7c8f: e8 00 00 00 00 callq 7c94 : #endif : : /* allocate a skb to store the frags */ : skb = netdev_alloc_skb_ip_align(netdev_ring(rx_ring), : IXGBE_RX_HDR_SIZE); : if (unlikely(!skb)) { 0.00 : 7c94: 48 85 c0 test %rax,%rax 0.00 : 7c97: 49 89 c4 mov %rax,%r12 0.00 : 7c9a: 0f 84 60 02 00 00 je 7f00 : * Useful for spinlocks to avoid one state transition in the : * cache coherency protocol: : */ : static inline void prefetchw(const void *x) : { : alternative_input(BASE_PREFETCH, 0.00 : 7ca0: 48 8b 80 e0 00 00 00 mov 0xe0(%rax),%rax 0.00 : 7ca7: 0f 18 08 prefetcht0 (%rax) : * Delay unmapping of the first packet. It carries the : * header information, HW may still access the header : * after the writeback. Only unmap it when EOP is : * reached : */ : if (likely(ixgbe_test_staterr(rx_desc, IXGBE_RXD_STAT_EOP))) 0.00 : 7caa: 41 f6 45 08 02 testb $0x2,0x8(%r13) 0.00 : 7caf: 4c 8d 75 30 lea 0x30(%rbp),%r14 0.00 : 7cb3: 0f 84 2f 02 00 00 je 7ee8 : return oldbit; : } : : static __always_inline int constant_test_bit(unsigned int nr, const volatile unsigned long *addr) : { : return ((1UL << (nr % BITS_PER_LONG)) & 0.00 : 7cb9: 49 8b 06 mov (%r14),%rax : if (ixgbe_test_staterr(rx_desc, IXGBE_RXD_STAT_EOP)) : ixgbe_dma_sync_frag(rx_ring, skb); : : dma_sync: : /* we are reusing so sync this buffer for CPU use */ : dma_sync_single_range_for_cpu(rx_ring->dev, 0.00 : 7cbc: 48 8b 7d 18 mov 0x18(%rbp),%rdi 0.00 : 7cc0: 8b 73 18 mov 0x18(%rbx),%esi 0.00 : 7cc3: 48 8b 4b 08 mov 0x8(%rbx),%rcx : { : #if MAX_SKB_FRAGS < 8 : return ALIGN(IXGBE_MAX_RXBUFFER / MAX_SKB_FRAGS, 1024); : #else : #ifdef IXGBE_FCOE : if (test_bit(__IXGBE_RX_FCOE, &ring->state)) 0.00 : 7cc7: 83 e0 20 and $0x20,%eax 0.00 : 7cca: 48 83 f8 01 cmp $0x1,%rax 0.00 : 7cce: 48 19 d2 sbb %rdx,%rdx 0.00 : 7cd1: 48 81 e2 00 f8 ff ff and $0xfffffffffffff800,%rdx 0.00 : 7cd8: 48 81 c2 00 10 00 00 add $0x1000,%rdx : static inline struct dma_map_ops *get_dma_ops(struct device *dev) : { : #ifdef CONFIG_X86_32 : return dma_ops; : #else : if (unlikely(!dev) || !dev->archdata.dma_ops) 0.00 : 7cdf: 48 85 ff test %rdi,%rdi 0.00 : 7ce2: 0f 84 68 01 00 00 je 7e50 0.00 : 7ce8: 48 8b 87 00 02 00 00 mov 0x200(%rdi),%rax 0.00 : 7cef: 48 85 c0 test %rax,%rax 0.00 : 7cf2: 0f 84 58 01 00 00 je 7e50 : enum dma_data_direction dir) : { : struct dma_map_ops *ops = get_dma_ops(dev); : : BUG_ON(!valid_dma_direction(dir)); : if (ops->sync_single_for_cpu) 0.00 : 7cf8: 48 8b 40 30 mov 0x30(%rax),%rax 0.00 : 7cfc: 48 85 c0 test %rax,%rax 0.00 : 7cff: 74 0c je 7d0d : ops->sync_single_for_cpu(dev, addr, size, dir); 0.00 : 7d01: 89 f6 mov %esi,%esi 0.00 : 7d03: 48 01 ce add %rcx,%rsi 0.00 : 7d06: b9 02 00 00 00 mov $0x2,%ecx 0.00 : 7d0b: ff d0 callq *%rax : ixgbe_rx_bufsz(rx_ring), : DMA_FROM_DEVICE); : } : : /* pull page into skb */ : if (ixgbe_add_rx_frag(rx_ring, rx_buffer, rx_desc, skb)) { 0.00 : 7d0d: 4c 89 e1 mov %r12,%rcx 0.00 : 7d10: 4c 89 ea mov %r13,%rdx 0.00 : 7d13: 48 89 de mov %rbx,%rsi 0.00 : 7d16: 48 89 ef mov %rbp,%rdi 0.00 : 7d19: e8 72 d7 ff ff callq 5490 0.00 : 7d1e: 84 c0 test %al,%al 0.00 : 7d20: 0f 85 9a 00 00 00 jne 7dc0 : /* hand second half of page back to the ring */ : ixgbe_reuse_rx_page(rx_ring, rx_buffer); : } else if (IXGBE_CB(skb)->dma == rx_buffer->dma) { 0.00 : 7d26: 48 8b 73 08 mov 0x8(%rbx),%rsi 0.00 : 7d2a: 49 39 74 24 28 cmp %rsi,0x28(%r12) 0.00 : 7d2f: 49 8d 44 24 28 lea 0x28(%r12),%rax 0.00 : 7d34: 0f 84 26 01 00 00 je 7e60 : /* the page has been released from the ring */ : IXGBE_CB(skb)->page_released = true; : } else { : /* we are not reusing the buffer so unmap it */ : dma_unmap_page(rx_ring->dev, rx_buffer->dma, 0.00 : 7d3a: 48 8b 7d 18 mov 0x18(%rbp),%rdi 0.00 : 7d3e: 48 8b 55 30 mov 0x30(%rbp),%rdx 0.00 : 7d42: 48 85 ff test %rdi,%rdi 0.00 : 7d45: 0f 84 35 01 00 00 je 7e80 0.00 : 7d4b: 48 8b 87 00 02 00 00 mov 0x200(%rdi),%rax 0.00 : 7d52: 48 85 c0 test %rax,%rax 0.00 : 7d55: 0f 84 25 01 00 00 je 7e80 : size_t size, enum dma_data_direction dir) : { : struct dma_map_ops *ops = get_dma_ops(dev); : : BUG_ON(!valid_dma_direction(dir)); : if (ops->unmap_page) 0.00 : 7d5b: 48 8b 40 18 mov 0x18(%rax),%rax 0.00 : 7d5f: 48 85 c0 test %rax,%rax 0.00 : 7d62: 74 1b je 7d7f : ops->unmap_page(dev, addr, size, dir, NULL); 0.00 : 7d64: 48 c1 ea 05 shr $0x5,%rdx 0.00 : 7d68: 45 31 c0 xor %r8d,%r8d 0.00 : 7d6b: 89 d1 mov %edx,%ecx 0.00 : 7d6d: ba 00 10 00 00 mov $0x1000,%edx 0.00 : 7d72: 83 e1 01 and $0x1,%ecx 0.00 : 7d75: 48 d3 e2 shl %cl,%rdx 0.00 : 7d78: b9 02 00 00 00 mov $0x2,%ecx 0.00 : 7d7d: ff d0 callq *%rax : ixgbe_rx_pg_size(rx_ring), : DMA_FROM_DEVICE); : } : : /* clear contents of buffer_info */ : rx_buffer->skb = NULL; 0.00 : 7d7f: 48 c7 03 00 00 00 00 movq $0x0,(%rbx) : rx_buffer->dma = 0; 0.00 : 7d86: 48 c7 43 08 00 00 00 movq $0x0,0x8(%rbx) 0.00 : 7d8d: 00 : rx_buffer->page = NULL; 0.00 : 7d8e: 48 c7 43 10 00 00 00 movq $0x0,0x10(%rbx) 0.00 : 7d95: 00 : : return skb; : } 0.00 : 7d96: 4c 89 e0 mov %r12,%rax 0.00 : 7d99: 48 8b 5c 24 08 mov 0x8(%rsp),%rbx 0.00 : 7d9e: 48 8b 6c 24 10 mov 0x10(%rsp),%rbp 0.00 : 7da3: 4c 8b 64 24 18 mov 0x18(%rsp),%r12 0.00 : 7da8: 4c 8b 6c 24 20 mov 0x20(%rsp),%r13 0.00 : 7dad: 4c 8b 74 24 28 mov 0x28(%rsp),%r14 0.00 : 7db2: 4c 8b 7c 24 30 mov 0x30(%rsp),%r15 0.00 : 7db7: 48 83 c4 38 add $0x38,%rsp 0.00 : 7dbb: c3 retq 0.00 : 7dbc: 0f 1f 40 00 nopl 0x0(%rax) : **/ : static void ixgbe_reuse_rx_page(struct ixgbe_ring *rx_ring, : struct ixgbe_rx_buffer *old_buff) : { : struct ixgbe_rx_buffer *new_buff; : u16 nta = rx_ring->next_to_alloc; 0.00 : 7dc0: 0f b7 45 54 movzwl 0x54(%rbp),%eax : : new_buff = &rx_ring->rx_buffer_info[nta]; : : /* update, and store next to alloc */ : nta++; : rx_ring->next_to_alloc = (nta < rx_ring->count) ? nta : 0; 0.00 : 7dc4: ba 00 00 00 00 mov $0x0,%edx : struct ixgbe_rx_buffer *old_buff) : { : struct ixgbe_rx_buffer *new_buff; : u16 nta = rx_ring->next_to_alloc; : : new_buff = &rx_ring->rx_buffer_info[nta]; 0.00 : 7dc9: 0f b7 c8 movzwl %ax,%ecx : : /* update, and store next to alloc */ : nta++; 0.00 : 7dcc: 83 c0 01 add $0x1,%eax : struct ixgbe_rx_buffer *old_buff) : { : struct ixgbe_rx_buffer *new_buff; : u16 nta = rx_ring->next_to_alloc; : : new_buff = &rx_ring->rx_buffer_info[nta]; 0.00 : 7dcf: 48 c1 e1 05 shl $0x5,%rcx 0.00 : 7dd3: 48 03 4d 28 add 0x28(%rbp),%rcx : : /* update, and store next to alloc */ : nta++; : rx_ring->next_to_alloc = (nta < rx_ring->count) ? nta : 0; 0.00 : 7dd7: 66 3b 45 4c cmp 0x4c(%rbp),%ax 0.00 : 7ddb: 0f 43 c2 cmovae %edx,%eax 0.00 : 7dde: 66 89 45 54 mov %ax,0x54(%rbp) : : /* transfer page from old buffer to new buffer */ : new_buff->page = old_buff->page; 0.00 : 7de2: 48 8b 43 10 mov 0x10(%rbx),%rax 0.00 : 7de6: 48 89 41 10 mov %rax,0x10(%rcx) : new_buff->dma = old_buff->dma; 0.00 : 7dea: 48 8b 53 08 mov 0x8(%rbx),%rdx 0.00 : 7dee: 48 89 51 08 mov %rdx,0x8(%rcx) : new_buff->page_offset = old_buff->page_offset; 0.00 : 7df2: 8b 73 18 mov 0x18(%rbx),%esi 0.00 : 7df5: 89 71 18 mov %esi,0x18(%rcx) 0.00 : 7df8: 48 8b 45 30 mov 0x30(%rbp),%rax : : /* sync the buffer for use by the device */ : dma_sync_single_range_for_device(rx_ring->dev, new_buff->dma, 0.00 : 7dfc: 48 8b 7d 18 mov 0x18(%rbp),%rdi 0.00 : 7e00: 83 e0 20 and $0x20,%eax 0.00 : 7e03: 48 83 f8 01 cmp $0x1,%rax 0.00 : 7e07: 4d 19 c0 sbb %r8,%r8 0.00 : 7e0a: 49 81 e0 00 f8 ff ff and $0xfffffffffffff800,%r8 0.00 : 7e11: 49 81 c0 00 10 00 00 add $0x1000,%r8 0.00 : 7e18: 48 85 ff test %rdi,%rdi 0.00 : 7e1b: 74 53 je 7e70 0.00 : 7e1d: 48 8b 87 00 02 00 00 mov 0x200(%rdi),%rax 0.00 : 7e24: 48 85 c0 test %rax,%rax 0.00 : 7e27: 74 47 je 7e70 : enum dma_data_direction dir) : { : struct dma_map_ops *ops = get_dma_ops(dev); : : BUG_ON(!valid_dma_direction(dir)); : if (ops->sync_single_for_device) 0.00 : 7e29: 48 8b 40 38 mov 0x38(%rax),%rax 0.00 : 7e2d: 48 85 c0 test %rax,%rax 0.00 : 7e30: 0f 84 49 ff ff ff je 7d7f : ops->sync_single_for_device(dev, addr, size, dir); 0.00 : 7e36: 89 f6 mov %esi,%esi 0.00 : 7e38: b9 02 00 00 00 mov $0x2,%ecx 0.00 : 7e3d: 48 01 d6 add %rdx,%rsi 0.00 : 7e40: 4c 89 c2 mov %r8,%rdx 0.00 : 7e43: ff d0 callq *%rax 0.00 : 7e45: e9 35 ff ff ff jmpq 7d7f 0.00 : 7e4a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : return dma_ops; 0.00 : 7e50: 48 8b 05 00 00 00 00 mov 0x0(%rip),%rax # 7e57 0.00 : 7e57: e9 9c fe ff ff jmpq 7cf8 0.00 : 7e5c: 0f 1f 40 00 nopl 0x0(%rax) : if (ixgbe_add_rx_frag(rx_ring, rx_buffer, rx_desc, skb)) { : /* hand second half of page back to the ring */ : ixgbe_reuse_rx_page(rx_ring, rx_buffer); : } else if (IXGBE_CB(skb)->dma == rx_buffer->dma) { : /* the page has been released from the ring */ : IXGBE_CB(skb)->page_released = true; 0.00 : 7e60: c6 40 1a 01 movb $0x1,0x1a(%rax) 0.00 : 7e64: e9 16 ff ff ff jmpq 7d7f 0.00 : 7e69: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 7e70: 48 8b 05 00 00 00 00 mov 0x0(%rip),%rax # 7e77 0.00 : 7e77: eb b0 jmp 7e29 0.00 : 7e79: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) 0.00 : 7e80: 48 8b 05 00 00 00 00 mov 0x0(%rip),%rax # 7e87 0.00 : 7e87: e9 cf fe ff ff jmpq 7d5b 0.00 : 7e8c: 0f 1f 40 00 nopl 0x0(%rax) : if (likely(ixgbe_test_staterr(rx_desc, IXGBE_RXD_STAT_EOP))) : goto dma_sync; : : IXGBE_CB(skb)->dma = rx_buffer->dma; : } else { : if (ixgbe_test_staterr(rx_desc, IXGBE_RXD_STAT_EOP)) 0.00 : 7e90: f6 46 08 02 testb $0x2,0x8(%rsi) 0.00 : 7e94: 4c 8d 77 30 lea 0x30(%rdi),%r14 0.00 : 7e98: 0f 84 1b fe ff ff je 7cb9 : */ : static void ixgbe_dma_sync_frag(struct ixgbe_ring *rx_ring, : struct sk_buff *skb) : { : /* if the page was released unmap it, else just sync our portion */ : if (unlikely(IXGBE_CB(skb)->page_released)) { 0.00 : 7e9e: 4d 8d 7c 24 28 lea 0x28(%r12),%r15 0.00 : 7ea3: 41 80 7f 1a 00 cmpb $0x0,0x1a(%r15) 0.00 : 7ea8: 74 63 je 7f0d 0.00 : 7eaa: 48 8b 4f 30 mov 0x30(%rdi),%rcx : dma_unmap_page(rx_ring->dev, IXGBE_CB(skb)->dma, 0.00 : 7eae: 49 8b 74 24 28 mov 0x28(%r12),%rsi 0.00 : 7eb3: ba 00 10 00 00 mov $0x1000,%edx 0.00 : 7eb8: 48 8b 7f 18 mov 0x18(%rdi),%rdi 0.00 : 7ebc: 48 c1 e9 05 shr $0x5,%rcx 0.00 : 7ec0: 83 e1 01 and $0x1,%ecx 0.00 : 7ec3: 48 d3 e2 shl %cl,%rdx 0.00 : 7ec6: b9 02 00 00 00 mov $0x2,%ecx 0.00 : 7ecb: e8 30 81 ff ff callq 0 : ixgbe_rx_pg_size(rx_ring), DMA_FROM_DEVICE); : IXGBE_CB(skb)->page_released = false; 0.00 : 7ed0: 41 c6 47 1a 00 movb $0x0,0x1a(%r15) : IXGBE_CB(skb)->dma, : skb_shinfo(skb)->frags[0].page_offset, : ixgbe_rx_bufsz(rx_ring), : DMA_FROM_DEVICE); : } : IXGBE_CB(skb)->dma = 0; 0.00 : 7ed5: 49 c7 07 00 00 00 00 movq $0x0,(%r15) 0.00 : 7edc: e9 d8 fd ff ff jmpq 7cb9 0.00 : 7ee1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * reached : */ : if (likely(ixgbe_test_staterr(rx_desc, IXGBE_RXD_STAT_EOP))) : goto dma_sync; : : IXGBE_CB(skb)->dma = rx_buffer->dma; 0.00 : 7ee8: 48 8b 43 08 mov 0x8(%rbx),%rax 0.00 : 7eec: 49 89 44 24 28 mov %rax,0x28(%r12) 0.00 : 7ef1: e9 17 fe ff ff jmpq 7d0d 0.00 : 7ef6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 7efd: 00 00 00 : : /* allocate a skb to store the frags */ : skb = netdev_alloc_skb_ip_align(netdev_ring(rx_ring), : IXGBE_RX_HDR_SIZE); : if (unlikely(!skb)) { : rx_ring->rx_stats.alloc_rx_buff_failed++; 0.00 : 7f00: 48 83 85 88 00 00 00 addq $0x1,0x88(%rbp) 0.00 : 7f07: 01 : rx_buffer->skb = NULL; : rx_buffer->dma = 0; : rx_buffer->page = NULL; : : return skb; : } 0.00 : 7f08: e9 89 fe ff ff jmpq 7d96 0.00 : 7f0d: 48 8b 47 30 mov 0x30(%rdi),%rax : if (unlikely(IXGBE_CB(skb)->page_released)) { : dma_unmap_page(rx_ring->dev, IXGBE_CB(skb)->dma, : ixgbe_rx_pg_size(rx_ring), DMA_FROM_DEVICE); : IXGBE_CB(skb)->page_released = false; : } else { : dma_sync_single_range_for_cpu(rx_ring->dev, 0.00 : 7f11: 41 8b 94 24 d0 00 00 mov 0xd0(%r12),%edx 0.00 : 7f18: 00 0.00 : 7f19: 48 8b 7f 18 mov 0x18(%rdi),%rdi 0.00 : 7f1d: 83 e0 20 and $0x20,%eax 0.00 : 7f20: 48 83 f8 01 cmp $0x1,%rax 0.00 : 7f24: 49 8b 84 24 d8 00 00 mov 0xd8(%r12),%rax 0.00 : 7f2b: 00 0.00 : 7f2c: 4d 19 c0 sbb %r8,%r8 0.00 : 7f2f: 49 81 e0 00 f8 ff ff and $0xfffffffffffff800,%r8 0.00 : 7f36: 49 81 c0 00 10 00 00 add $0x1000,%r8 : static inline struct dma_map_ops *get_dma_ops(struct device *dev) : { : #ifdef CONFIG_X86_32 : return dma_ops; : #else : if (unlikely(!dev) || !dev->archdata.dma_ops) 0.00 : 7f3d: 48 85 ff test %rdi,%rdi 0.00 : 7f40: 8b 4c 10 40 mov 0x40(%rax,%rdx,1),%ecx 0.00 : 7f44: 49 8b 54 24 28 mov 0x28(%r12),%rdx 0.00 : 7f49: 74 2d je 7f78 0.00 : 7f4b: 48 8b 87 00 02 00 00 mov 0x200(%rdi),%rax 0.00 : 7f52: 48 85 c0 test %rax,%rax 0.00 : 7f55: 74 21 je 7f78 : enum dma_data_direction dir) : { : struct dma_map_ops *ops = get_dma_ops(dev); : : BUG_ON(!valid_dma_direction(dir)); : if (ops->sync_single_for_cpu) 0.00 : 7f57: 48 8b 40 30 mov 0x30(%rax),%rax 0.00 : 7f5b: 48 85 c0 test %rax,%rax 0.00 : 7f5e: 0f 84 71 ff ff ff je 7ed5 : ops->sync_single_for_cpu(dev, addr, size, dir); 0.00 : 7f64: 89 ce mov %ecx,%esi 0.00 : 7f66: b9 02 00 00 00 mov $0x2,%ecx 0.00 : 7f6b: 48 01 d6 add %rdx,%rsi 0.00 : 7f6e: 4c 89 c2 mov %r8,%rdx 0.00 : 7f71: ff d0 callq *%rax 0.00 : 7f73: e9 5d ff ff ff jmpq 7ed5 : return dma_ops; 0.00 : 7f78: 48 8b 05 00 00 00 00 mov 0x0(%rip),%rax # 7f7f 0.00 : 7f7f: eb d6 jmp 7f57 Sorted summary for file /lib/modules/3.0.101-0.15-default/kernel/drivers/net/ethernet/intel/igb/igb.ko ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/drivers/net/ethernet/intel/igb/igb.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000006fb0 : 0.00 : 6fb0: 48 83 ec 08 sub $0x8,%rsp 0.00 : 6fe4: 80 7e 12 00 48 8b 0e rex.RX sbb %r9b,0x1246c608(%rcx) 0.00 : 6feb: 0f b7 46 add %cl,-0x75(%rax) 0.00 : 6fee: 10 74 rex.RX (bad) 0.00 : 6ff0: 2b 89 c2 b8 lea 0x60(%rsi),%rdx 0.00 : 6ff4: 04 00 test $0x2,%al 0.00 : 6ff6: 00 00 jne 7003 0.00 : 6ff8: 81 e2 fc 7f 00 lock btsl $0x0,(%rdx) 0.00 : 6ffd: 00 0f sbb %eax,%eax 0.00 : 6fff: 44 d0 test %eax,%eax 0.00 : 7001: 83 b9 je 7010 0.00 : 7003: e4 05 00 00 01 mov $0x1,%eax 0.00 : 7008: 74 4e 89 d1 add $0x8,%rsp 0.00 : 700c: 81 retq 0.00 : 700d: c9 00 00 nopl (%rax) ??:0 100.00 : 7010: 00 80 48 8b lea 0x50(%rsi),%rdi 0.00 : 7014: 46 18 89 08 c6 callq 7019 0.00 : 7019: 46 12 00 48 8b mov $0x1,%eax 0.00 : 701e: 46 60 48 8d add $0x8,%rsp 0.00 : 7022: 56 retq 0.00 : 7023: 60 a8 02 75 0b nopl 0x0(%rax,%rax,1) 0.00 : 7028: f0 0f mov %edx,%ecx 0.00 : 702a: ba 2a 00 shl $0x10,%ecx 0.00 : 702d: 19 c0 or %edx,%ecx 0.00 : 702f: 85 c0 jmp 6fe2 : 7031: 74 0d b8 01 00 00 00 data32 data32 data32 data32 data32 nopw %cs:0x0(%rax,%rax,1) : 7038: 48 83 c4 08 c3 0f 1f : 703f: 00 : 7040: 48 push %rbp : 7041: 8d push %rbx : 7042: 7e 50 e8 mov %rdi,%rbx : 7045: 00 00 00 00 sub $0x8,%rsp : 7049: b8 01 00 00 mov 0x10(%rdi),%rbp : 704d: 00 48 83 c4 movzwl 0x44(%rdi),%edi : 7051: 08 c3 0f 1f lea (%rdi,%rdi,2),%rdi : 7055: 44 00 00 89 shl $0x4,%rdi : 7059: d1 c1 e1 10 09 callq 705e : 705e: d1 eb b1 test %rax,%rax 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 : 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 ??:0 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .plt: : : 0000000000469a50 : 100.00 : 469a50: ff 25 3a d9 6f 00 jmpq *0x6fd93a(%rip) # b67390 <_GLOBAL_OFFSET_TABLE_+0x390> 0.00 : 469a56: 68 6f 00 00 00 pushq $0x6f 0.00 : 469a5b: e9 f0 f8 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/heaptuple.c:121 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 0.00 : 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) : { 0.00 : 470388: 48 83 ec 08 sub $0x8,%rsp : Size data_length = 0; : int i; : int numberOfAttributes = tupleDesc->natts; 0.00 : 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 0.00 : 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 100.00 : 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 ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:328 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 0.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 0.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 /home/Computational/mark/src/postgres-andres/src/backend/access/hash/hashfunc.c:328 100.00 : 4904b0: 31 c6 xor %eax,%esi 0.00 : 4904b2: 89 f0 mov %esi,%eax 0.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 0.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/nbtree/nbtsearch.c:648 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000004ad290 <_bt_first>: : * Within this routine, we build a temporary insertion-type scankey to use : * in locating the scan start position. : */ : bool : _bt_first(IndexScanDesc scan, ScanDirection dir) : { 0.00 : 4ad290: 55 push %rbp 0.00 : 4ad291: 48 89 e5 mov %rsp,%rbp 0.00 : 4ad294: 41 57 push %r15 0.00 : 4ad296: 41 56 push %r14 0.00 : 4ad298: 41 55 push %r13 0.00 : 4ad29a: 41 54 push %r12 0.00 : 4ad29c: 53 push %rbx 0.00 : 4ad29d: 48 81 ec 68 13 00 00 sub $0x1368,%rsp 0.00 : 4ad2a4: 48 89 bd a0 ec ff ff mov %rdi,-0x1360(%rbp) 0.00 : 4ad2ab: 89 b5 9c ec ff ff mov %esi,-0x1364(%rbp) : Relation rel = scan->indexRelation; 0.00 : 4ad2b1: 48 8b 47 08 mov 0x8(%rdi),%rax 0.00 : 4ad2b5: 48 89 85 a8 ec ff ff mov %rax,-0x1358(%rbp) : BTScanOpaque so = (BTScanOpaque) scan->opaque; 0.00 : 4ad2bc: 48 8b 57 38 mov 0x38(%rdi),%rdx 0.00 : 4ad2c0: 48 89 95 b0 ec ff ff mov %rdx,-0x1350(%rbp) : int keysCount = 0; : int i; : StrategyNumber strat_total; : BTScanPosItem *currItem; : : pgstat_count_index_scan(rel); 0.00 : 4ad2c7: 48 8b 80 38 01 00 00 mov 0x138(%rax),%rax 0.00 : 4ad2ce: 48 85 c0 test %rax,%rax 0.00 : 4ad2d1: 74 05 je 4ad2d8 <_bt_first+0x48> 0.00 : 4ad2d3: 48 83 40 10 01 addq $0x1,0x10(%rax) : : /* : * Examine the scan keys and eliminate any redundant keys; also mark the : * keys that must be matched to continue the scan. : */ : _bt_preprocess_keys(scan); 0.00 : 4ad2d8: 48 8b bd a0 ec ff ff mov -0x1360(%rbp),%rdi 0.00 : 4ad2df: e8 ec 18 00 00 callq 4aebd0 <_bt_preprocess_keys> : : /* : * Quit now if _bt_preprocess_keys() discovered that the scan keys can : * never be satisfied (eg, x == 1 AND x > 2). : */ : if (!so->qual_ok) 0.00 : 4ad2e4: 48 8b 85 b0 ec ff ff mov -0x1350(%rbp),%rax 0.00 : 4ad2eb: 80 38 00 cmpb $0x0,(%rax) 0.00 : 4ad2ee: 0f 84 cc 00 00 00 je 4ad3c0 <_bt_first+0x130> : * The selected scan keys (at most one per index column) are remembered by : * storing their addresses into the local startKeys[] array. : *---------- : */ : strat_total = BTEqualStrategyNumber; : if (so->numberOfKeys > 0) 0.00 : 4ad2f4: 8b 50 04 mov 0x4(%rax),%edx 0.00 : 4ad2f7: 85 d2 test %edx,%edx 0.00 : 4ad2f9: 0f 8e 31 04 00 00 jle 4ad730 <_bt_first+0x4a0> : /* : * Loop iterates from 0 to numberOfKeys inclusive; we use the last : * pass to handle after-last-key processing. Actual exit from the : * loop is at one of the "break" statements below. : */ : for (cur = so->keyData, i = 0;; cur++, i++) 0.00 : 4ad2ff: 4c 8b 60 08 mov 0x8(%rax),%r12 0.00 : 4ad303: 45 31 ff xor %r15d,%r15d 0.00 : 4ad306: 45 31 ed xor %r13d,%r13d 0.00 : 4ad309: 66 c7 85 be ec ff ff movw $0x3,-0x1342(%rbp) 0.00 : 4ad310: 03 00 0.00 : 4ad312: 41 be 01 00 00 00 mov $0x1,%r14d 0.00 : 4ad318: 31 db xor %ebx,%ebx 0.00 : 4ad31a: 31 f6 xor %esi,%esi 0.00 : 4ad31c: 0f 1f 40 00 nopl 0x0(%rax) : { : if (i >= so->numberOfKeys || cur->sk_attno != curattr) 0.00 : 4ad320: 41 39 d5 cmp %edx,%r13d 0.00 : 4ad323: 7d 0c jge 4ad331 <_bt_first+0xa1> 0.00 : 4ad325: 41 0f b7 4c 24 04 movzwl 0x4(%r12),%ecx 0.00 : 4ad32b: 66 44 39 f1 cmp %r14w,%cx 0.00 : 4ad32f: 74 74 je 4ad3a5 <_bt_first+0x115> : { : /* : * Done looking at keys for curattr. If we didn't find a : * usable boundary key, see if we can deduce a NOT NULL key. : */ : if (chosen == NULL && impliesNN != NULL && 0.00 : 4ad331: 48 85 db test %rbx,%rbx 0.00 : 4ad334: 0f 84 fe 00 00 00 je 4ad438 <_bt_first+0x1a8> : * If we still didn't find a usable boundary key, quit; else : * save the boundary key pointer in startKeys. : */ : if (chosen == NULL) : break; : startKeys[keysCount++] = chosen; 0.00 : 4ad33a: 49 63 c7 movslq %r15d,%rax 0.00 : 4ad33d: 41 83 c7 01 add $0x1,%r15d 0.00 : 4ad341: 48 89 9c c5 c0 fe ff mov %rbx,-0x140(%rbp,%rax,8) 0.00 : 4ad348: ff : : /* : * Adjust strat_total, and quit if we have stored a > or < : * key. : */ : strat = chosen->sk_strategy; 0.00 : 4ad349: 0f b7 43 06 movzwl 0x6(%rbx),%eax : if (strat != BTEqualStrategyNumber) 0.00 : 4ad34d: 66 83 f8 03 cmp $0x3,%ax 0.00 : 4ad351: 74 1b je 4ad36e <_bt_first+0xde> : { : strat_total = strat; : if (strat == BTGreaterStrategyNumber || 0.00 : 4ad353: 66 83 f8 05 cmp $0x5,%ax 0.00 : 4ad357: 0f 84 33 05 00 00 je 4ad890 <_bt_first+0x600> 0.00 : 4ad35d: 66 83 f8 01 cmp $0x1,%ax 0.00 : 4ad361: 0f 84 29 05 00 00 je 4ad890 <_bt_first+0x600> : strat == BTLessStrategyNumber) : break; 0.00 : 4ad367: 66 89 85 be ec ff ff mov %ax,-0x1342(%rbp) : /* : * Done if that was the last attribute, or if next key is not : * in sequence (implying no boundary key is available for the : * next attribute). : */ : if (i >= so->numberOfKeys || 0.00 : 4ad36e: 48 8b 95 b0 ec ff ff mov -0x1350(%rbp),%rdx 0.00 : 4ad375: 44 3b 6a 04 cmp 0x4(%rdx),%r13d 0.00 : 4ad379: 0f 8d e0 00 00 00 jge 4ad45f <_bt_first+0x1cf> 0.00 : 4ad37f: 41 0f b7 4c 24 04 movzwl 0x4(%r12),%ecx 0.00 : 4ad385: 41 0f bf c6 movswl %r14w,%eax 0.00 : 4ad389: 83 c0 01 add $0x1,%eax 0.00 : 4ad38c: 0f bf d1 movswl %cx,%edx /home/Computational/mark/src/postgres-andres/src/backend/access/nbtree/nbtsearch.c:648 100.00 : 4ad38f: 39 c2 cmp %eax,%edx 0.00 : 4ad391: 0f 85 c8 00 00 00 jne 4ad45f <_bt_first+0x1cf> 0.00 : 4ad397: 48 8b 85 b0 ec ff ff mov -0x1350(%rbp),%rax 0.00 : 4ad39e: 31 db xor %ebx,%ebx 0.00 : 4ad3a0: 31 f6 xor %esi,%esi 0.00 : 4ad3a2: 8b 50 04 mov 0x4(%rax),%edx : * : * If not, does it imply a NOT NULL constraint? (Because : * SK_SEARCHNULL keys are always assigned BTEqualStrategyNumber, : * *any* inequality key works for that; we need not test.) : */ : switch (cur->sk_strategy) 0.00 : 4ad3a5: 66 41 83 7c 24 06 05 cmpw $0x5,0x6(%r12) 0.00 : 4ad3ac: 77 4a ja 4ad3f8 <_bt_first+0x168> 0.00 : 4ad3ae: 41 0f b7 44 24 06 movzwl 0x6(%r12),%eax 0.00 : 4ad3b4: ff 24 c5 60 48 7b 00 jmpq *0x7b4860(,%rax,8) 0.00 : 4ad3bb: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : : /* OK, itemIndex says what to return */ : currItem = &so->currPos.items[so->currPos.itemIndex]; : scan->xs_ctup.t_self = currItem->heapTid; : if (scan->xs_want_itup) : scan->xs_itup = (IndexTuple) (so->currTuples + currItem->tupleOffset); 0.00 : 4ad3c0: 31 d2 xor %edx,%edx : : return true; : } 0.00 : 4ad3c2: 48 81 c4 68 13 00 00 add $0x1368,%rsp 0.00 : 4ad3c9: 89 d0 mov %edx,%eax 0.00 : 4ad3cb: 5b pop %rbx 0.00 : 4ad3cc: 41 5c pop %r12 0.00 : 4ad3ce: 41 5d pop %r13 0.00 : 4ad3d0: 41 5e pop %r14 0.00 : 4ad3d2: 41 5f pop %r15 0.00 : 4ad3d4: c9 leaveq 0.00 : 4ad3d5: c3 retq 0.00 : 4ad3d6: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 4ad3dd: 00 00 00 : /* override any non-equality choice */ : chosen = cur; : break; : case BTGreaterEqualStrategyNumber: : case BTGreaterStrategyNumber: : if (chosen == NULL) 0.00 : 4ad3e0: 48 85 db test %rbx,%rbx 0.00 : 4ad3e3: 75 13 jne 4ad3f8 <_bt_first+0x168> : { : if (ScanDirectionIsForward(dir)) 0.00 : 4ad3e5: 83 bd 9c ec ff ff 01 cmpl $0x1,-0x1364(%rbp) 0.00 : 4ad3ec: 74 32 je 4ad420 <_bt_first+0x190> 0.00 : 4ad3ee: 4c 89 e6 mov %r12,%rsi 0.00 : 4ad3f1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : /* : * Loop iterates from 0 to numberOfKeys inclusive; we use the last : * pass to handle after-last-key processing. Actual exit from the : * loop is at one of the "break" statements below. : */ : for (cur = so->keyData, i = 0;; cur++, i++) 0.00 : 4ad3f8: 49 83 c4 48 add $0x48,%r12 0.00 : 4ad3fc: 41 83 c5 01 add $0x1,%r13d 0.00 : 4ad400: 41 89 ce mov %ecx,%r14d : else : impliesNN = cur; : } : break; : } : } 0.00 : 4ad403: e9 18 ff ff ff jmpq 4ad320 <_bt_first+0x90> 0.00 : 4ad408: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 4ad40f: 00 : */ : switch (cur->sk_strategy) : { : case BTLessStrategyNumber: : case BTLessEqualStrategyNumber: : if (chosen == NULL) 0.00 : 4ad410: 48 85 db test %rbx,%rbx 0.00 : 4ad413: 75 e3 jne 4ad3f8 <_bt_first+0x168> : { : if (ScanDirectionIsBackward(dir)) 0.00 : 4ad415: 83 bd 9c ec ff ff ff cmpl $0xffffffff,-0x1364(%rbp) 0.00 : 4ad41c: 75 d0 jne 4ad3ee <_bt_first+0x15e> 0.00 : 4ad41e: 66 90 xchg %ax,%ax : break; : case BTGreaterEqualStrategyNumber: : case BTGreaterStrategyNumber: : if (chosen == NULL) : { : if (ScanDirectionIsForward(dir)) 0.00 : 4ad420: 4c 89 e3 mov %r12,%rbx : /* : * Loop iterates from 0 to numberOfKeys inclusive; we use the last : * pass to handle after-last-key processing. Actual exit from the : * loop is at one of the "break" statements below. : */ : for (cur = so->keyData, i = 0;; cur++, i++) 0.00 : 4ad423: 41 83 c5 01 add $0x1,%r13d 0.00 : 4ad427: 49 83 c4 48 add $0x48,%r12 0.00 : 4ad42b: 41 89 ce mov %ecx,%r14d 0.00 : 4ad42e: e9 ed fe ff ff jmpq 4ad320 <_bt_first+0x90> 0.00 : 4ad433: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : { : /* : * Done looking at keys for curattr. If we didn't find a : * usable boundary key, see if we can deduce a NOT NULL key. : */ : if (chosen == NULL && impliesNN != NULL && 0.00 : 4ad438: 48 85 f6 test %rsi,%rsi 0.00 : 4ad43b: 74 22 je 4ad45f <_bt_first+0x1cf> 0.00 : 4ad43d: 8b 36 mov (%rsi),%esi 0.00 : 4ad43f: 89 f2 mov %esi,%edx 0.00 : 4ad441: 81 e2 00 00 00 02 and $0x2000000,%edx 0.00 : 4ad447: 0f 84 73 02 00 00 je 4ad6c0 <_bt_first+0x430> 0.00 : 4ad44d: 83 bd 9c ec ff ff 01 cmpl $0x1,-0x1364(%rbp) 0.00 : 4ad454: 0f 94 c0 sete %al 0.00 : 4ad457: 84 c0 test %al,%al 0.00 : 4ad459: 0f 85 09 02 00 00 jne 4ad668 <_bt_first+0x3d8> : /* : * If we found no usable boundary keys, we have to start from one end of : * the tree. Walk down that edge to the first or last key, and scan from : * there. : */ : if (keysCount == 0) 0.00 : 4ad45f: 41 83 ff 00 cmp $0x0,%r15d 0.00 : 4ad463: 0f 84 c7 02 00 00 je 4ad730 <_bt_first+0x4a0> : * insertion scankey we can use to search for the boundary point we : * identified above. The insertion scankey is built in the local : * scankeys[] array, using the keys identified by startKeys[]. : */ : Assert(keysCount <= INDEX_MAX_KEYS); : for (i = 0; i < keysCount; i++) 0.00 : 4ad469: 0f 8e b5 01 00 00 jle 4ad624 <_bt_first+0x394> : : /* OK, itemIndex says what to return */ : currItem = &so->currPos.items[so->currPos.itemIndex]; : scan->xs_ctup.t_self = currItem->heapTid; : if (scan->xs_want_itup) : scan->xs_itup = (IndexTuple) (so->currTuples + currItem->tupleOffset); 0.00 : 4ad46f: 48 8d 8d c0 f5 ff ff lea -0xa40(%rbp),%rcx : * scheme. But, by the same token, if we aren't able to use all : * the row members, then the part of the row comparison that we : * did use has to be treated as just a ">=" or "<=" condition, and : * so we'd better adjust strat_total accordingly. : */ : if (i == keysCount - 1) 0.00 : 4ad476: 41 8d 47 ff lea -0x1(%r15),%eax : : /* OK, itemIndex says what to return */ : currItem = &so->currPos.items[so->currPos.itemIndex]; : scan->xs_ctup.t_self = currItem->heapTid; : if (scan->xs_want_itup) : scan->xs_itup = (IndexTuple) (so->currTuples + currItem->tupleOffset); 0.00 : 4ad47a: 45 31 ed xor %r13d,%r13d 0.00 : 4ad47d: 45 31 f6 xor %r14d,%r14d 0.00 : 4ad480: 48 89 8d 90 ec ff ff mov %rcx,-0x1370(%rbp) 0.00 : 4ad487: 48 89 cb mov %rcx,%rbx : * scheme. But, by the same token, if we aren't able to use all : * the row members, then the part of the row comparison that we : * did use has to be treated as just a ">=" or "<=" condition, and : * so we'd better adjust strat_total accordingly. : */ : if (i == keysCount - 1) 0.00 : 4ad48a: 89 85 8c ec ff ff mov %eax,-0x1374(%rbp) 0.00 : 4ad490: eb 7c jmp 4ad50e <_bt_first+0x27e> 0.00 : 4ad492: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * have sk_func = 3-way-comparison function), but we have to watch : * out for nulls, which _bt_preprocess_keys didn't check. A null : * in the first row member makes the condition unmatchable, just : * like qual_ok = false. : */ : ScanKey subkey = (ScanKey) DatumGetPointer(cur->sk_argument); 0.00 : 4ad498: 49 8b 4c 24 40 mov 0x40(%r12),%rcx : : Assert(subkey->sk_flags & SK_ROW_MEMBER); : if (subkey->sk_flags & SK_ISNULL) 0.00 : 4ad49d: f6 01 01 testb $0x1,(%rcx) 0.00 : 4ad4a0: 0f 85 1a ff ff ff jne 4ad3c0 <_bt_first+0x130> : return false; : memcpy(scankeys + i, subkey, sizeof(ScanKeyData)); 0.00 : 4ad4a6: 48 8b 01 mov (%rcx),%rax 0.00 : 4ad4a9: 48 89 03 mov %rax,(%rbx) 0.00 : 4ad4ac: 48 8b 41 08 mov 0x8(%rcx),%rax 0.00 : 4ad4b0: 48 89 43 08 mov %rax,0x8(%rbx) 0.00 : 4ad4b4: 48 8b 41 10 mov 0x10(%rcx),%rax 0.00 : 4ad4b8: 48 89 43 10 mov %rax,0x10(%rbx) 0.00 : 4ad4bc: 48 8b 41 18 mov 0x18(%rcx),%rax 0.00 : 4ad4c0: 48 89 43 18 mov %rax,0x18(%rbx) 0.00 : 4ad4c4: 48 8b 41 20 mov 0x20(%rcx),%rax 0.00 : 4ad4c8: 48 89 43 20 mov %rax,0x20(%rbx) 0.00 : 4ad4cc: 48 8b 41 28 mov 0x28(%rcx),%rax 0.00 : 4ad4d0: 48 89 43 28 mov %rax,0x28(%rbx) 0.00 : 4ad4d4: 48 8b 41 30 mov 0x30(%rcx),%rax 0.00 : 4ad4d8: 48 89 43 30 mov %rax,0x30(%rbx) 0.00 : 4ad4dc: 48 8b 41 38 mov 0x38(%rcx),%rax 0.00 : 4ad4e0: 48 89 43 38 mov %rax,0x38(%rbx) 0.00 : 4ad4e4: 48 8b 41 40 mov 0x40(%rcx),%rax 0.00 : 4ad4e8: 48 89 43 40 mov %rax,0x40(%rbx) : * scheme. But, by the same token, if we aren't able to use all : * the row members, then the part of the row comparison that we : * did use has to be treated as just a ">=" or "<=" condition, and : * so we'd better adjust strat_total accordingly. : */ : if (i == keysCount - 1) 0.00 : 4ad4ec: 44 39 ad 8c ec ff ff cmp %r13d,-0x1374(%rbp) 0.00 : 4ad4f3: 0f 84 9a 00 00 00 je 4ad593 <_bt_first+0x303> : * insertion scankey we can use to search for the boundary point we : * identified above. The insertion scankey is built in the local : * scankeys[] array, using the keys identified by startKeys[]. : */ : Assert(keysCount <= INDEX_MAX_KEYS); : for (i = 0; i < keysCount; i++) 0.00 : 4ad4f9: 41 83 c5 01 add $0x1,%r13d 0.00 : 4ad4fd: 48 83 c3 48 add $0x48,%rbx 0.00 : 4ad501: 49 83 c6 04 add $0x4,%r14 0.00 : 4ad505: 45 39 ef cmp %r13d,%r15d 0.00 : 4ad508: 0f 8e 16 01 00 00 jle 4ad624 <_bt_first+0x394> : { : ScanKey cur = startKeys[i]; 0.00 : 4ad50e: 4e 8b a4 75 c0 fe ff mov -0x140(%rbp,%r14,2),%r12 0.00 : 4ad515: ff : : Assert(cur->sk_attno == i + 1); : : if (cur->sk_flags & SK_ROW_HEADER) 0.00 : 4ad516: 41 f6 04 24 04 testb $0x4,(%r12) 0.00 : 4ad51b: 0f 85 77 ff ff ff jne 4ad498 <_bt_first+0x208> : * : * We support the convention that sk_subtype == InvalidOid means : * the opclass input type; this is a hack to simplify life for : * ScanKeyInit(). : */ : if (cur->sk_subtype == rel->rd_opcintype[i] || 0.00 : 4ad521: 48 8b 8d a8 ec ff ff mov -0x1358(%rbp),%rcx 0.00 : 4ad528: 41 8b 54 24 08 mov 0x8(%r12),%edx 0.00 : 4ad52d: 48 8b 81 d0 00 00 00 mov 0xd0(%rcx),%rax 0.00 : 4ad534: 42 8b 34 30 mov (%rax,%r14,1),%esi 0.00 : 4ad538: 39 f2 cmp %esi,%edx 0.00 : 4ad53a: 74 08 je 4ad544 <_bt_first+0x2b4> 0.00 : 4ad53c: 85 d2 test %edx,%edx 0.00 : 4ad53e: 0f 85 8c 01 00 00 jne 4ad6d0 <_bt_first+0x440> : cur->sk_subtype == InvalidOid) : { : FmgrInfo *procinfo; : : procinfo = index_getprocinfo(rel, cur->sk_attno, BTORDER_PROC); 0.00 : 4ad544: 41 0f bf 74 24 04 movswl 0x4(%r12),%esi 0.00 : 4ad54a: 48 8b bd a8 ec ff ff mov -0x1358(%rbp),%rdi 0.00 : 4ad551: ba 01 00 00 00 mov $0x1,%edx 0.00 : 4ad556: e8 65 7b ff ff callq 4a50c0 : ScanKeyEntryInitializeWithInfo(scankeys + i, 0.00 : 4ad55b: 49 8b 4c 24 40 mov 0x40(%r12),%rcx 0.00 : 4ad560: 41 0f bf 54 24 04 movswl 0x4(%r12),%edx 0.00 : 4ad566: 48 89 df mov %rbx,%rdi 0.00 : 4ad569: 45 8b 4c 24 0c mov 0xc(%r12),%r9d 0.00 : 4ad56e: 45 8b 44 24 08 mov 0x8(%r12),%r8d 0.00 : 4ad573: 48 89 04 24 mov %rax,(%rsp) 0.00 : 4ad577: 48 89 4c 24 08 mov %rcx,0x8(%rsp) 0.00 : 4ad57c: 41 8b 34 24 mov (%r12),%esi 0.00 : 4ad580: 31 c9 xor %ecx,%ecx 0.00 : 4ad582: e8 b9 65 fc ff callq 473b40 : * : * We support the convention that sk_subtype == InvalidOid means : * the opclass input type; this is a hack to simplify life for : * ScanKeyInit(). : */ : if (cur->sk_subtype == rel->rd_opcintype[i] || 0.00 : 4ad587: e9 6d ff ff ff jmpq 4ad4f9 <_bt_first+0x269> 0.00 : 4ad58c: 0f 1f 40 00 nopl 0x0(%rax) : if (subkey->sk_flags & SK_ISNULL) : break; /* can't use null keys */ : Assert(keysCount < INDEX_MAX_KEYS); : memcpy(scankeys + keysCount, subkey, sizeof(ScanKeyData)); : keysCount++; : if (subkey->sk_flags & SK_ROW_END) 0.00 : 4ad590: 41 89 f7 mov %esi,%r15d : bool used_all_subkeys = false; : : Assert(!(subkey->sk_flags & SK_ROW_END)); : for (;;) : { : subkey++; 0.00 : 4ad593: 48 83 c1 48 add $0x48,%rcx : Assert(subkey->sk_flags & SK_ROW_MEMBER); : if (subkey->sk_attno != keysCount + 1) 0.00 : 4ad597: 41 8d 47 01 lea 0x1(%r15),%eax 0.00 : 4ad59b: 0f bf 71 04 movswl 0x4(%rcx),%esi 0.00 : 4ad59f: 39 c6 cmp %eax,%esi 0.00 : 4ad5a1: 0f 85 f1 05 00 00 jne 4adb98 <_bt_first+0x908> : break; /* out-of-sequence, can't use it */ : if (subkey->sk_strategy != cur->sk_strategy) 0.00 : 4ad5a7: 0f b7 41 06 movzwl 0x6(%rcx),%eax 0.00 : 4ad5ab: 66 41 3b 44 24 06 cmp 0x6(%r12),%ax 0.00 : 4ad5b1: 0f 85 e1 05 00 00 jne 4adb98 <_bt_first+0x908> : break; /* wrong direction, can't use it */ : if (subkey->sk_flags & SK_ISNULL) 0.00 : 4ad5b7: f6 01 01 testb $0x1,(%rcx) 0.00 : 4ad5ba: 0f 85 d8 05 00 00 jne 4adb98 <_bt_first+0x908> : break; /* can't use null keys */ : Assert(keysCount < INDEX_MAX_KEYS); : memcpy(scankeys + keysCount, subkey, sizeof(ScanKeyData)); 0.00 : 4ad5c0: 48 8b 95 90 ec ff ff mov -0x1370(%rbp),%rdx 0.00 : 4ad5c7: 49 63 c7 movslq %r15d,%rax 0.00 : 4ad5ca: 48 8d 04 c0 lea (%rax,%rax,8),%rax 0.00 : 4ad5ce: 48 8d 04 c2 lea (%rdx,%rax,8),%rax 0.00 : 4ad5d2: 48 8b 11 mov (%rcx),%rdx 0.00 : 4ad5d5: 48 89 10 mov %rdx,(%rax) 0.00 : 4ad5d8: 48 8b 51 08 mov 0x8(%rcx),%rdx 0.00 : 4ad5dc: 48 89 50 08 mov %rdx,0x8(%rax) 0.00 : 4ad5e0: 48 8b 51 10 mov 0x10(%rcx),%rdx 0.00 : 4ad5e4: 48 89 50 10 mov %rdx,0x10(%rax) 0.00 : 4ad5e8: 48 8b 51 18 mov 0x18(%rcx),%rdx 0.00 : 4ad5ec: 48 89 50 18 mov %rdx,0x18(%rax) 0.00 : 4ad5f0: 48 8b 51 20 mov 0x20(%rcx),%rdx 0.00 : 4ad5f4: 48 89 50 20 mov %rdx,0x20(%rax) 0.00 : 4ad5f8: 48 8b 51 28 mov 0x28(%rcx),%rdx 0.00 : 4ad5fc: 48 89 50 28 mov %rdx,0x28(%rax) 0.00 : 4ad600: 48 8b 51 30 mov 0x30(%rcx),%rdx 0.00 : 4ad604: 48 89 50 30 mov %rdx,0x30(%rax) 0.00 : 4ad608: 48 8b 51 38 mov 0x38(%rcx),%rdx 0.00 : 4ad60c: 48 89 50 38 mov %rdx,0x38(%rax) 0.00 : 4ad610: 48 8b 51 40 mov 0x40(%rcx),%rdx 0.00 : 4ad614: 48 89 50 40 mov %rdx,0x40(%rax) : keysCount++; : if (subkey->sk_flags & SK_ROW_END) 0.00 : 4ad618: f6 01 10 testb $0x10,(%rcx) 0.00 : 4ad61b: 0f 84 6f ff ff ff je 4ad590 <_bt_first+0x300> 0.00 : 4ad621: 41 89 f7 mov %esi,%r15d : * : * If goback = true, we will then step back one item, while if : * goback = false, we will start the scan on the located item. : *---------- : */ : switch (strat_total) 0.00 : 4ad624: 66 83 bd be ec ff ff cmpw $0x5,-0x1342(%rbp) 0.00 : 4ad62b: 05 0.00 : 4ad62c: 0f 86 4e 02 00 00 jbe 4ad880 <_bt_first+0x5f0> : goback = false; : break; : : default: : /* can't get here, but keep compiler quiet */ : elog(ERROR, "unrecognized strat_total: %d", (int) strat_total); 0.00 : 4ad632: ba df 48 7b 00 mov $0x7b48df,%edx 0.00 : 4ad637: be a4 03 00 00 mov $0x3a4,%esi 0.00 : 4ad63c: bf 70 47 7b 00 mov $0x7b4770,%edi 0.00 : 4ad641: e8 da dd 2c 00 callq 77b420 0.00 : 4ad646: 0f b7 95 be ec ff ff movzwl -0x1342(%rbp),%edx 0.00 : 4ad64d: be 97 47 7b 00 mov $0x7b4797,%esi 0.00 : 4ad652: bf 14 00 00 00 mov $0x14,%edi 0.00 : 4ad657: 31 c0 xor %eax,%eax 0.00 : 4ad659: e8 d2 db 2c 00 callq 77b230 0.00 : 4ad65e: e8 6d be fb ff callq 4694d0 0.00 : 4ad663: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : ((impliesNN->sk_flags & SK_BT_NULLS_FIRST) ? : ScanDirectionIsForward(dir) : : ScanDirectionIsBackward(dir))) : { : /* Yes, so build the key in notnullkeys[keysCount] */ : chosen = ¬nullkeys[keysCount]; 0.00 : 4ad668: 49 63 c7 movslq %r15d,%rax : ScanKeyEntryInitialize(chosen, 0.00 : 4ad66b: 83 fa 01 cmp $0x1,%edx 0.00 : 4ad66e: 41 0f bf d6 movswl %r14w,%edx : ((impliesNN->sk_flags & SK_BT_NULLS_FIRST) ? : ScanDirectionIsForward(dir) : : ScanDirectionIsBackward(dir))) : { : /* Yes, so build the key in notnullkeys[keysCount] */ : chosen = ¬nullkeys[keysCount]; 0.00 : 4ad672: 48 8d 04 c0 lea (%rax,%rax,8),%rax : ScanKeyEntryInitialize(chosen, 0.00 : 4ad676: 19 c9 sbb %ecx,%ecx 0.00 : 4ad678: 81 e6 00 00 00 03 and $0x3000000,%esi 0.00 : 4ad67e: 83 e1 fc and $0xfffffffc,%ecx 0.00 : 4ad681: 40 80 ce 81 or $0x81,%sil 0.00 : 4ad685: 45 31 c9 xor %r9d,%r9d : ((impliesNN->sk_flags & SK_BT_NULLS_FIRST) ? : ScanDirectionIsForward(dir) : : ScanDirectionIsBackward(dir))) : { : /* Yes, so build the key in notnullkeys[keysCount] */ : chosen = ¬nullkeys[keysCount]; 0.00 : 4ad688: 48 8d 9c c5 c0 ec ff lea -0x1340(%rbp,%rax,8),%rbx 0.00 : 4ad68f: ff : ScanKeyEntryInitialize(chosen, 0.00 : 4ad690: 83 c1 05 add $0x5,%ecx 0.00 : 4ad693: 45 31 c0 xor %r8d,%r8d 0.00 : 4ad696: 48 c7 44 24 08 00 00 movq $0x0,0x8(%rsp) 0.00 : 4ad69d: 00 00 0.00 : 4ad69f: c7 04 24 00 00 00 00 movl $0x0,(%rsp) 0.00 : 4ad6a6: 48 89 df mov %rbx,%rdi 0.00 : 4ad6a9: e8 02 65 fc ff callq 473bb0 : : /* : * If we still didn't find a usable boundary key, quit; else : * save the boundary key pointer in startKeys. : */ : if (chosen == NULL) 0.00 : 4ad6ae: 48 85 db test %rbx,%rbx 0.00 : 4ad6b1: 0f 85 83 fc ff ff jne 4ad33a <_bt_first+0xaa> 0.00 : 4ad6b7: e9 a3 fd ff ff jmpq 4ad45f <_bt_first+0x1cf> 0.00 : 4ad6bc: 0f 1f 40 00 nopl 0x0(%rax) : { : /* : * Done looking at keys for curattr. If we didn't find a : * usable boundary key, see if we can deduce a NOT NULL key. : */ : if (chosen == NULL && impliesNN != NULL && 0.00 : 4ad6c0: 83 bd 9c ec ff ff ff cmpl $0xffffffff,-0x1364(%rbp) 0.00 : 4ad6c7: 0f 94 c0 sete %al 0.00 : 4ad6ca: e9 88 fd ff ff jmpq 4ad457 <_bt_first+0x1c7> 0.00 : 4ad6cf: 90 nop : } : else : { : RegProcedure cmp_proc; : : cmp_proc = get_opfamily_proc(rel->rd_opfamily[i], 0.00 : 4ad6d0: 48 8b 8d a8 ec ff ff mov -0x1358(%rbp),%rcx 0.00 : 4ad6d7: 48 8b 81 c8 00 00 00 mov 0xc8(%rcx),%rax 0.00 : 4ad6de: b9 01 00 00 00 mov $0x1,%ecx 0.00 : 4ad6e3: 42 8b 3c 30 mov (%rax,%r14,1),%edi 0.00 : 4ad6e7: e8 c4 51 2c 00 callq 7728b0 : rel->rd_opcintype[i], : cur->sk_subtype, : BTORDER_PROC); : if (!RegProcedureIsValid(cmp_proc)) 0.00 : 4ad6ec: 85 c0 test %eax,%eax : } : else : { : RegProcedure cmp_proc; : : cmp_proc = get_opfamily_proc(rel->rd_opfamily[i], 0.00 : 4ad6ee: 89 c1 mov %eax,%ecx : rel->rd_opcintype[i], : cur->sk_subtype, : BTORDER_PROC); : if (!RegProcedureIsValid(cmp_proc)) 0.00 : 4ad6f0: 0f 84 4e 04 00 00 je 4adb44 <_bt_first+0x8b4> : elog(ERROR, "missing support function %d(%u,%u) for attribute %d of index \"%s\"", : BTORDER_PROC, rel->rd_opcintype[i], cur->sk_subtype, : cur->sk_attno, RelationGetRelationName(rel)); : ScanKeyEntryInitialize(scankeys + i, 0.00 : 4ad6f6: 49 8b 44 24 40 mov 0x40(%r12),%rax 0.00 : 4ad6fb: 41 0f bf 54 24 04 movswl 0x4(%r12),%edx 0.00 : 4ad701: 48 89 df mov %rbx,%rdi 0.00 : 4ad704: 45 8b 4c 24 0c mov 0xc(%r12),%r9d 0.00 : 4ad709: 45 8b 44 24 08 mov 0x8(%r12),%r8d 0.00 : 4ad70e: 89 0c 24 mov %ecx,(%rsp) 0.00 : 4ad711: 31 c9 xor %ecx,%ecx 0.00 : 4ad713: 48 89 44 24 08 mov %rax,0x8(%rsp) 0.00 : 4ad718: 41 8b 34 24 mov (%r12),%esi 0.00 : 4ad71c: e8 8f 64 fc ff callq 473bb0 0.00 : 4ad721: e9 d3 fd ff ff jmpq 4ad4f9 <_bt_first+0x269> 0.00 : 4ad726: 66 2e 0f 1f 84 00 00 nopw %cs:0x0(%rax,%rax,1) 0.00 : 4ad72d: 00 00 00 : * same as for _bt_first(). : */ : static bool : _bt_endpoint(IndexScanDesc scan, ScanDirection dir) : { : Relation rel = scan->indexRelation; 0.00 : 4ad730: 48 8b 95 a0 ec ff ff mov -0x1360(%rbp),%rdx 0.00 : 4ad737: 4c 8b 6a 08 mov 0x8(%rdx),%r13 : BTScanOpaque so = (BTScanOpaque) scan->opaque; 0.00 : 4ad73b: 4c 8b 72 38 mov 0x38(%rdx),%r14 : /* : * Scan down to the leftmost or rightmost leaf page. This is a simplified : * version of _bt_search(). We don't maintain a stack since we know we : * won't need it. : */ : buf = _bt_get_endpoint(rel, 0, ScanDirectionIsBackward(dir)); 0.00 : 4ad73f: 31 d2 xor %edx,%edx 0.00 : 4ad741: 83 bd 9c ec ff ff ff cmpl $0xffffffff,-0x1364(%rbp) 0.00 : 4ad748: 4c 89 ef mov %r13,%rdi 0.00 : 4ad74b: 0f 94 c2 sete %dl 0.00 : 4ad74e: 31 f6 xor %esi,%esi 0.00 : 4ad750: e8 eb ea ff ff callq 4ac240 <_bt_get_endpoint> : : if (!BufferIsValid(buf)) 0.00 : 4ad755: 85 c0 test %eax,%eax : /* : * Scan down to the leftmost or rightmost leaf page. This is a simplified : * version of _bt_search(). We don't maintain a stack since we know we : * won't need it. : */ : buf = _bt_get_endpoint(rel, 0, ScanDirectionIsBackward(dir)); 0.00 : 4ad757: 41 89 c4 mov %eax,%r12d : : if (!BufferIsValid(buf)) 0.00 : 4ad75a: 0f 84 3c 01 00 00 je 4ad89c <_bt_first+0x60c> : PredicateLockRelation(rel, scan->xs_snapshot); : so->currPos.buf = InvalidBuffer; : return false; : } : : PredicateLockPage(rel, BufferGetBlockNumber(buf), scan->xs_snapshot); 0.00 : 4ad760: 48 8b 85 a0 ec ff ff mov -0x1360(%rbp),%rax 0.00 : 4ad767: 44 89 e7 mov %r12d,%edi 0.00 : 4ad76a: 48 8b 58 10 mov 0x10(%rax),%rbx 0.00 : 4ad76e: e8 bd 68 1c 00 callq 674030 0.00 : 4ad773: 4c 89 ef mov %r13,%rdi 0.00 : 4ad776: 89 c6 mov %eax,%esi 0.00 : 4ad778: 48 89 da mov %rbx,%rdx 0.00 : 4ad77b: e8 e0 5a 1e 00 callq 693260 : page = BufferGetPage(buf); 0.00 : 4ad780: 45 85 e4 test %r12d,%r12d 0.00 : 4ad783: 0f 88 91 03 00 00 js 4adb1a <_bt_first+0x88a> 0.00 : 4ad789: 41 8d 44 24 ff lea -0x1(%r12),%eax 0.00 : 4ad78e: 48 63 d0 movslq %eax,%rdx 0.00 : 4ad791: 48 c1 e2 0d shl $0xd,%rdx 0.00 : 4ad795: 48 03 15 5c 23 71 00 add 0x71235c(%rip),%rdx # bbfaf8 : opaque = (BTPageOpaque) PageGetSpecialPointer(page); : Assert(P_ISLEAF(opaque)); : : if (ScanDirectionIsForward(dir)) 0.00 : 4ad79c: 83 bd 9c ec ff ff 01 cmpl $0x1,-0x1364(%rbp) : return false; : } : : PredicateLockPage(rel, BufferGetBlockNumber(buf), scan->xs_snapshot); : page = BufferGetPage(buf); : opaque = (BTPageOpaque) PageGetSpecialPointer(page); 0.00 : 4ad7a3: 0f b7 42 10 movzwl 0x10(%rdx),%eax : Assert(P_ISLEAF(opaque)); : : if (ScanDirectionIsForward(dir)) 0.00 : 4ad7a7: 0f 84 4d 03 00 00 je 4adafa <_bt_first+0x86a> : /* There could be dead pages to the left, so not this: */ : /* Assert(P_LEFTMOST(opaque)); */ : : start = P_FIRSTDATAKEY(opaque); : } : else if (ScanDirectionIsBackward(dir)) 0.00 : 4ad7ad: 83 bd 9c ec ff ff ff cmpl $0xffffffff,-0x1364(%rbp) 0.00 : 4ad7b4: 0f 85 ff 03 00 00 jne 4adbb9 <_bt_first+0x929> : { : Assert(P_RIGHTMOST(opaque)); : : start = PageGetMaxOffsetNumber(page); 0.00 : 4ad7ba: 0f b7 42 0c movzwl 0xc(%rdx),%eax : : /* OK, itemIndex says what to return */ : currItem = &so->currPos.items[so->currPos.itemIndex]; : scan->xs_ctup.t_self = currItem->heapTid; : if (scan->xs_want_itup) : scan->xs_itup = (IndexTuple) (so->currTuples + currItem->tupleOffset); 0.00 : 4ad7be: 31 d2 xor %edx,%edx : } : else if (ScanDirectionIsBackward(dir)) : { : Assert(P_RIGHTMOST(opaque)); : : start = PageGetMaxOffsetNumber(page); 0.00 : 4ad7c0: 66 83 f8 18 cmp $0x18,%ax 0.00 : 4ad7c4: 0f 87 f4 00 00 00 ja 4ad8be <_bt_first+0x62e> : elog(ERROR, "invalid scan direction: %d", (int) dir); : start = 0; /* keep compiler quiet */ : } : : /* remember which buffer we have pinned */ : so->currPos.buf = buf; 0.00 : 4ad7ca: 45 89 66 54 mov %r12d,0x54(%r14) : so->currPos.moreLeft = false; : so->currPos.moreRight = true; : } : else : { : so->currPos.moreLeft = true; 0.00 : 4ad7ce: 41 c6 46 5c 01 movb $0x1,0x5c(%r14) : so->currPos.moreRight = false; 0.00 : 4ad7d3: 41 c6 46 5d 00 movb $0x0,0x5d(%r14) : } : so->numKilled = 0; /* just paranoia */ 0.00 : 4ad7d8: 41 c7 46 38 00 00 00 movl $0x0,0x38(%r14) 0.00 : 4ad7df: 00 : so->markItemIndex = -1; /* ditto */ 0.00 : 4ad7e0: 41 c7 46 50 ff ff ff movl $0xffffffff,0x50(%r14) 0.00 : 4ad7e7: ff : : /* : * Now load data from the first page of the scan. : */ : if (!_bt_readpage(scan, dir, start)) 0.00 : 4ad7e8: 8b b5 9c ec ff ff mov -0x1364(%rbp),%esi 0.00 : 4ad7ee: 48 8b bd a0 ec ff ff mov -0x1360(%rbp),%rdi 0.00 : 4ad7f5: e8 e6 eb ff ff callq 4ac3e0 <_bt_readpage> 0.00 : 4ad7fa: 84 c0 test %al,%al 0.00 : 4ad7fc: 75 1c jne 4ad81a <_bt_first+0x58a> : { : /* : * There's no actually-matching data on this page. Try to advance to : * the next page. Return false if there's no matching data at all. : */ : if (!_bt_steppage(scan, dir)) 0.00 : 4ad7fe: 8b b5 9c ec ff ff mov -0x1364(%rbp),%esi 0.00 : 4ad804: 48 8b bd a0 ec ff ff mov -0x1360(%rbp),%rdi 0.00 : 4ad80b: e8 70 ee ff ff callq 4ac680 <_bt_steppage> 0.00 : 4ad810: 31 d2 xor %edx,%edx 0.00 : 4ad812: 84 c0 test %al,%al 0.00 : 4ad814: 0f 84 a8 fb ff ff je 4ad3c2 <_bt_first+0x132> : return false; : } : : /* Drop the lock, but not pin, on the current page */ : LockBuffer(so->currPos.buf, BUFFER_LOCK_UNLOCK); 0.00 : 4ad81a: 41 8b 7e 54 mov 0x54(%r14),%edi 0.00 : 4ad81e: 31 f6 xor %esi,%esi 0.00 : 4ad820: e8 eb 6e 1c 00 callq 674710 : : /* OK, itemIndex says what to return */ : currItem = &so->currPos.items[so->currPos.itemIndex]; 0.00 : 4ad825: 49 63 46 6c movslq 0x6c(%r14),%rax : scan->xs_ctup.t_self = currItem->heapTid; 0.00 : 4ad829: 48 8b 95 a0 ec ff ff mov -0x1360(%rbp),%rdx 0.00 : 4ad830: 48 8d 04 80 lea (%rax,%rax,4),%rax 0.00 : 4ad834: 49 8d 4c 46 60 lea 0x60(%r14,%rax,2),%rcx 0.00 : 4ad839: 8b 41 10 mov 0x10(%rcx),%eax 0.00 : 4ad83c: 89 42 54 mov %eax,0x54(%rdx) 0.00 : 4ad83f: 0f b7 41 14 movzwl 0x14(%rcx),%eax 0.00 : 4ad843: 66 89 42 58 mov %ax,0x58(%rdx) : if (scan->xs_want_itup) 0.00 : 4ad847: 48 8b 85 a0 ec ff ff mov -0x1360(%rbp),%rax 0.00 : 4ad84e: ba 01 00 00 00 mov $0x1,%edx 0.00 : 4ad853: 80 78 30 00 cmpb $0x0,0x30(%rax) 0.00 : 4ad857: 0f 84 65 fb ff ff je 4ad3c2 <_bt_first+0x132> : scan->xs_itup = (IndexTuple) (so->currTuples + currItem->tupleOffset); 0.00 : 4ad85d: 0f b7 41 18 movzwl 0x18(%rcx),%eax 0.00 : 4ad861: 48 8b 95 a0 ec ff ff mov -0x1360(%rbp),%rdx 0.00 : 4ad868: 49 03 46 40 add 0x40(%r14),%rax 0.00 : 4ad86c: 48 89 42 40 mov %rax,0x40(%rdx) 0.00 : 4ad870: ba 01 00 00 00 mov $0x1,%edx 0.00 : 4ad875: e9 48 fb ff ff jmpq 4ad3c2 <_bt_first+0x132> 0.00 : 4ad87a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * : * If goback = true, we will then step back one item, while if : * goback = false, we will start the scan on the located item. : *---------- : */ : switch (strat_total) 0.00 : 4ad880: 0f b7 85 be ec ff ff movzwl -0x1342(%rbp),%eax 0.00 : 4ad887: ff 24 c5 90 48 7b 00 jmpq *0x7b4890(,%rax,8) 0.00 : 4ad88e: 66 90 xchg %ax,%ax : else : impliesNN = cur; : } : break; : } : } 0.00 : 4ad890: 66 89 85 be ec ff ff mov %ax,-0x1342(%rbp) 0.00 : 4ad897: e9 c3 fb ff ff jmpq 4ad45f <_bt_first+0x1cf> : { : /* : * Empty index. Lock the whole relation, as nothing finer to lock : * exists. : */ : PredicateLockRelation(rel, scan->xs_snapshot); 0.00 : 4ad89c: 48 8b 8d a0 ec ff ff mov -0x1360(%rbp),%rcx 0.00 : 4ad8a3: 4c 89 ef mov %r13,%rdi 0.00 : 4ad8a6: 48 8b 71 10 mov 0x10(%rcx),%rsi 0.00 : 4ad8aa: e8 21 6d 1e 00 callq 6945d0 : so->currPos.buf = InvalidBuffer; 0.00 : 4ad8af: 41 c7 46 54 00 00 00 movl $0x0,0x54(%r14) 0.00 : 4ad8b6: 00 0.00 : 4ad8b7: 31 d2 xor %edx,%edx 0.00 : 4ad8b9: e9 04 fb ff ff jmpq 4ad3c2 <_bt_first+0x132> : } : else if (ScanDirectionIsBackward(dir)) : { : Assert(P_RIGHTMOST(opaque)); : : start = PageGetMaxOffsetNumber(page); 0.00 : 4ad8be: 0f b7 c0 movzwl %ax,%eax 0.00 : 4ad8c1: 48 83 e8 18 sub $0x18,%rax 0.00 : 4ad8c5: 48 c1 e8 02 shr $0x2,%rax 0.00 : 4ad8c9: 0f b7 d0 movzwl %ax,%edx 0.00 : 4ad8cc: e9 f9 fe ff ff jmpq 4ad7ca <_bt_first+0x53a> 0.00 : 4ad8d1: 48 8d 95 c0 f5 ff ff lea -0xa40(%rbp),%rdx : * : * If goback = true, we will then step back one item, while if : * goback = false, we will start the scan on the located item. : *---------- : */ : switch (strat_total) 0.00 : 4ad8d8: 45 31 ed xor %r13d,%r13d 0.00 : 4ad8db: 41 bc 01 00 00 00 mov $0x1,%r12d 0.00 : 4ad8e1: 48 89 95 90 ec ff ff mov %rdx,-0x1370(%rbp) 0.00 : 4ad8e8: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 4ad8ef: 00 : : /* : * Use the manufactured insertion scan key to descend the tree and : * position ourselves on the target leaf page. : */ : stack = _bt_search(rel, keysCount, scankeys, nextkey, &buf, BT_READ); 0.00 : 4ad8f0: 48 8b 95 90 ec ff ff mov -0x1370(%rbp),%rdx 0.00 : 4ad8f7: 48 8b bd a8 ec ff ff mov -0x1358(%rbp),%rdi 0.00 : 4ad8fe: 4c 8d 45 cc lea -0x34(%rbp),%r8 0.00 : 4ad902: 44 89 e1 mov %r12d,%ecx 0.00 : 4ad905: 41 b9 01 00 00 00 mov $0x1,%r9d 0.00 : 4ad90b: 44 89 fe mov %r15d,%esi 0.00 : 4ad90e: e8 ed f7 ff ff callq 4ad100 <_bt_search> 0.00 : 4ad913: 48 89 c7 mov %rax,%rdi : : /* don't need to keep the stack around... */ : _bt_freestack(stack); 0.00 : 4ad916: e8 55 1f 00 00 callq 4af870 <_bt_freestack> : : /* remember which buffer we have pinned, if any */ : so->currPos.buf = buf; 0.00 : 4ad91b: 8b 45 cc mov -0x34(%rbp),%eax 0.00 : 4ad91e: 48 8b 8d b0 ec ff ff mov -0x1350(%rbp),%rcx 0.00 : 4ad925: 89 41 54 mov %eax,0x54(%rcx) : : if (!BufferIsValid(buf)) 0.00 : 4ad928: 8b 7d cc mov -0x34(%rbp),%edi 0.00 : 4ad92b: 85 ff test %edi,%edi 0.00 : 4ad92d: 0f 84 95 01 00 00 je 4adac8 <_bt_first+0x838> : */ : PredicateLockRelation(rel, scan->xs_snapshot); : return false; : } : else : PredicateLockPage(rel, BufferGetBlockNumber(buf), 0.00 : 4ad933: 48 8b 95 a0 ec ff ff mov -0x1360(%rbp),%rdx 0.00 : 4ad93a: 48 8b 5a 10 mov 0x10(%rdx),%rbx 0.00 : 4ad93e: e8 ed 66 1c 00 callq 674030 0.00 : 4ad943: 48 8b bd a8 ec ff ff mov -0x1358(%rbp),%rdi 0.00 : 4ad94a: 89 c6 mov %eax,%esi 0.00 : 4ad94c: 48 89 da mov %rbx,%rdx 0.00 : 4ad94f: e8 0c 59 1e 00 callq 693260 : scan->xs_snapshot); : : /* initialize moreLeft/moreRight appropriately for scan direction */ : if (ScanDirectionIsForward(dir)) 0.00 : 4ad954: 83 bd 9c ec ff ff 01 cmpl $0x1,-0x1364(%rbp) 0.00 : 4ad95b: 0f 84 85 01 00 00 je 4adae6 <_bt_first+0x856> : so->currPos.moreLeft = false; : so->currPos.moreRight = true; : } : else : { : so->currPos.moreLeft = true; 0.00 : 4ad961: 48 8b 85 b0 ec ff ff mov -0x1350(%rbp),%rax 0.00 : 4ad968: c6 40 5c 01 movb $0x1,0x5c(%rax) : so->currPos.moreRight = false; 0.00 : 4ad96c: c6 40 5d 00 movb $0x0,0x5d(%rax) : } : so->numKilled = 0; /* just paranoia */ 0.00 : 4ad970: 48 8b 95 b0 ec ff ff mov -0x1350(%rbp),%rdx : so->markItemIndex = -1; /* ditto */ : : /* position to the precise item on the page */ : offnum = _bt_binsrch(rel, buf, keysCount, scankeys, nextkey); 0.00 : 4ad977: 45 89 e0 mov %r12d,%r8d : else : { : so->currPos.moreLeft = true; : so->currPos.moreRight = false; : } : so->numKilled = 0; /* just paranoia */ 0.00 : 4ad97a: c7 42 38 00 00 00 00 movl $0x0,0x38(%rdx) : so->markItemIndex = -1; /* ditto */ 0.00 : 4ad981: c7 42 50 ff ff ff ff movl $0xffffffff,0x50(%rdx) : : /* position to the precise item on the page */ : offnum = _bt_binsrch(rel, buf, keysCount, scankeys, nextkey); 0.00 : 4ad988: 44 89 fa mov %r15d,%edx 0.00 : 4ad98b: 8b 75 cc mov -0x34(%rbp),%esi 0.00 : 4ad98e: 48 8b 8d 90 ec ff ff mov -0x1370(%rbp),%rcx 0.00 : 4ad995: 48 8b bd a8 ec ff ff mov -0x1358(%rbp),%rdi 0.00 : 4ad99c: e8 bf f4 ff ff callq 4ace60 <_bt_binsrch> : * this results in an offset before the first item or after the last one, : * _bt_readpage will report no items found, and then we'll step to the : * next page as needed.) : */ : if (goback) : offnum = OffsetNumberPrev(offnum); 0.00 : 4ad9a1: 41 80 fd 01 cmp $0x1,%r13b : : /* : * Now load data from the first page of the scan. : */ : if (!_bt_readpage(scan, dir, offnum)) 0.00 : 4ad9a5: 8b b5 9c ec ff ff mov -0x1364(%rbp),%esi 0.00 : 4ad9ab: 48 8b bd a0 ec ff ff mov -0x1360(%rbp),%rdi : * this results in an offset before the first item or after the last one, : * _bt_readpage will report no items found, and then we'll step to the : * next page as needed.) : */ : if (goback) : offnum = OffsetNumberPrev(offnum); 0.00 : 4ad9b2: 66 83 d0 ff adc $0xffff,%ax : : /* : * Now load data from the first page of the scan. : */ : if (!_bt_readpage(scan, dir, offnum)) 0.00 : 4ad9b6: 0f b7 d0 movzwl %ax,%edx 0.00 : 4ad9b9: e8 22 ea ff ff callq 4ac3e0 <_bt_readpage> 0.00 : 4ad9be: 84 c0 test %al,%al 0.00 : 4ad9c0: 75 1a jne 4ad9dc <_bt_first+0x74c> : { : /* : * There's no actually-matching data on this page. Try to advance to : * the next page. Return false if there's no matching data at all. : */ : if (!_bt_steppage(scan, dir)) 0.00 : 4ad9c2: 8b b5 9c ec ff ff mov -0x1364(%rbp),%esi 0.00 : 4ad9c8: 48 8b bd a0 ec ff ff mov -0x1360(%rbp),%rdi 0.00 : 4ad9cf: e8 ac ec ff ff callq 4ac680 <_bt_steppage> 0.00 : 4ad9d4: 84 c0 test %al,%al 0.00 : 4ad9d6: 0f 84 e4 f9 ff ff je 4ad3c0 <_bt_first+0x130> : return false; : } : : /* Drop the lock, but not pin, on the current page */ : LockBuffer(so->currPos.buf, BUFFER_LOCK_UNLOCK); 0.00 : 4ad9dc: 48 8b 8d b0 ec ff ff mov -0x1350(%rbp),%rcx 0.00 : 4ad9e3: 31 f6 xor %esi,%esi 0.00 : 4ad9e5: 8b 79 54 mov 0x54(%rcx),%edi 0.00 : 4ad9e8: e8 23 6d 1c 00 callq 674710 : : /* OK, itemIndex says what to return */ : currItem = &so->currPos.items[so->currPos.itemIndex]; 0.00 : 4ad9ed: 48 8b 95 b0 ec ff ff mov -0x1350(%rbp),%rdx 0.00 : 4ad9f4: 48 63 42 6c movslq 0x6c(%rdx),%rax : scan->xs_ctup.t_self = currItem->heapTid; 0.00 : 4ad9f8: 48 8d 04 80 lea (%rax,%rax,4),%rax 0.00 : 4ad9fc: 48 8d 4c 42 60 lea 0x60(%rdx,%rax,2),%rcx 0.00 : 4ada01: 48 8b 95 a0 ec ff ff mov -0x1360(%rbp),%rdx 0.00 : 4ada08: 8b 41 10 mov 0x10(%rcx),%eax 0.00 : 4ada0b: 89 42 54 mov %eax,0x54(%rdx) 0.00 : 4ada0e: 0f b7 41 14 movzwl 0x14(%rcx),%eax 0.00 : 4ada12: 66 89 42 58 mov %ax,0x58(%rdx) : if (scan->xs_want_itup) 0.00 : 4ada16: 48 8b 85 a0 ec ff ff mov -0x1360(%rbp),%rax 0.00 : 4ada1d: ba 01 00 00 00 mov $0x1,%edx 0.00 : 4ada22: 80 78 30 00 cmpb $0x0,0x30(%rax) 0.00 : 4ada26: 0f 84 96 f9 ff ff je 4ad3c2 <_bt_first+0x132> : scan->xs_itup = (IndexTuple) (so->currTuples + currItem->tupleOffset); 0.00 : 4ada2c: 48 8b 95 b0 ec ff ff mov -0x1350(%rbp),%rdx 0.00 : 4ada33: 0f b7 41 18 movzwl 0x18(%rcx),%eax 0.00 : 4ada37: 48 8b 8d a0 ec ff ff mov -0x1360(%rbp),%rcx 0.00 : 4ada3e: 48 03 42 40 add 0x40(%rdx),%rax 0.00 : 4ada42: ba 01 00 00 00 mov $0x1,%edx 0.00 : 4ada47: 48 89 41 40 mov %rax,0x40(%rcx) 0.00 : 4ada4b: e9 72 f9 ff ff jmpq 4ad3c2 <_bt_first+0x132> : : /* : * If a backward scan was specified, need to start with last equal : * item not first one. : */ : if (ScanDirectionIsBackward(dir)) 0.00 : 4ada50: 83 bd 9c ec ff ff ff cmpl $0xffffffff,-0x1364(%rbp) 0.00 : 4ada57: 48 8d 85 c0 f5 ff ff lea -0xa40(%rbp),%rax 0.00 : 4ada5e: 48 89 85 90 ec ff ff mov %rax,-0x1370(%rbp) 0.00 : 4ada65: 0f 84 c6 00 00 00 je 4adb31 <_bt_first+0x8a1> : goback = false; : break; : : default: : /* can't get here, but keep compiler quiet */ : elog(ERROR, "unrecognized strat_total: %d", (int) strat_total); 0.00 : 4ada6b: 45 31 ed xor %r13d,%r13d 0.00 : 4ada6e: 45 31 e4 xor %r12d,%r12d 0.00 : 4ada71: e9 7a fe ff ff jmpq 4ad8f0 <_bt_first+0x660> 0.00 : 4ada76: 48 8d 8d c0 f5 ff ff lea -0xa40(%rbp),%rcx : * : * If goback = true, we will then step back one item, while if : * goback = false, we will start the scan on the located item. : *---------- : */ : switch (strat_total) 0.00 : 4ada7d: 41 bd 01 00 00 00 mov $0x1,%r13d 0.00 : 4ada83: 45 31 e4 xor %r12d,%r12d 0.00 : 4ada86: 48 89 8d 90 ec ff ff mov %rcx,-0x1370(%rbp) 0.00 : 4ada8d: e9 5e fe ff ff jmpq 4ad8f0 <_bt_first+0x660> 0.00 : 4ada92: 48 8d 8d c0 f5 ff ff lea -0xa40(%rbp),%rcx 0.00 : 4ada99: 48 89 8d 90 ec ff ff mov %rcx,-0x1370(%rbp) 0.00 : 4adaa0: eb c9 jmp 4ada6b <_bt_first+0x7db> 0.00 : 4adaa2: 48 8d 85 c0 f5 ff ff lea -0xa40(%rbp),%rax 0.00 : 4adaa9: 48 89 85 90 ec ff ff mov %rax,-0x1370(%rbp) : goback = false; : break; : : default: : /* can't get here, but keep compiler quiet */ : elog(ERROR, "unrecognized strat_total: %d", (int) strat_total); 0.00 : 4adab0: 41 bd 01 00 00 00 mov $0x1,%r13d 0.00 : 4adab6: 41 bc 01 00 00 00 mov $0x1,%r12d 0.00 : 4adabc: e9 2f fe ff ff jmpq 4ad8f0 <_bt_first+0x660> 0.00 : 4adac1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : { : /* : * We only get here if the index is completely empty. Lock relation : * because nothing finer to lock exists. : */ : PredicateLockRelation(rel, scan->xs_snapshot); 0.00 : 4adac8: 48 8b 85 a0 ec ff ff mov -0x1360(%rbp),%rax 0.00 : 4adacf: 48 8b bd a8 ec ff ff mov -0x1358(%rbp),%rdi 0.00 : 4adad6: 48 8b 70 10 mov 0x10(%rax),%rsi 0.00 : 4adada: e8 f1 6a 1e 00 callq 6945d0 0.00 : 4adadf: 31 d2 xor %edx,%edx : scan->xs_ctup.t_self = currItem->heapTid; : if (scan->xs_want_itup) : scan->xs_itup = (IndexTuple) (so->currTuples + currItem->tupleOffset); : : return true; : } 0.00 : 4adae1: e9 dc f8 ff ff jmpq 4ad3c2 <_bt_first+0x132> : scan->xs_snapshot); : : /* initialize moreLeft/moreRight appropriately for scan direction */ : if (ScanDirectionIsForward(dir)) : { : so->currPos.moreLeft = false; 0.00 : 4adae6: 48 8b 8d b0 ec ff ff mov -0x1350(%rbp),%rcx 0.00 : 4adaed: c6 41 5c 00 movb $0x0,0x5c(%rcx) : so->currPos.moreRight = true; 0.00 : 4adaf1: c6 41 5d 01 movb $0x1,0x5d(%rcx) 0.00 : 4adaf5: e9 76 fe ff ff jmpq 4ad970 <_bt_first+0x6e0> : if (ScanDirectionIsForward(dir)) : { : /* There could be dead pages to the left, so not this: */ : /* Assert(P_LEFTMOST(opaque)); */ : : start = P_FIRSTDATAKEY(opaque); 0.00 : 4adafa: 0f b7 c0 movzwl %ax,%eax 0.00 : 4adafd: 83 7c 02 04 01 cmpl $0x1,0x4(%rdx,%rax,1) : elog(ERROR, "invalid scan direction: %d", (int) dir); : start = 0; /* keep compiler quiet */ : } : : /* remember which buffer we have pinned */ : so->currPos.buf = buf; 0.00 : 4adb02: 45 89 66 54 mov %r12d,0x54(%r14) : : /* initialize moreLeft/moreRight appropriately for scan direction */ : if (ScanDirectionIsForward(dir)) : { : so->currPos.moreLeft = false; 0.00 : 4adb06: 41 c6 46 5c 00 movb $0x0,0x5c(%r14) : so->currPos.moreRight = true; 0.00 : 4adb0b: 41 c6 46 5d 01 movb $0x1,0x5d(%r14) : if (ScanDirectionIsForward(dir)) : { : /* There could be dead pages to the left, so not this: */ : /* Assert(P_LEFTMOST(opaque)); */ : : start = P_FIRSTDATAKEY(opaque); 0.00 : 4adb10: 19 d2 sbb %edx,%edx 0.00 : 4adb12: 83 c2 02 add $0x2,%edx 0.00 : 4adb15: e9 be fc ff ff jmpq 4ad7d8 <_bt_first+0x548> : so->currPos.buf = InvalidBuffer; : return false; : } : : PredicateLockPage(rel, BufferGetBlockNumber(buf), scan->xs_snapshot); : page = BufferGetPage(buf); 0.00 : 4adb1a: 44 89 e0 mov %r12d,%eax 0.00 : 4adb1d: 48 8b 15 f4 f5 6c 00 mov 0x6cf5f4(%rip),%rdx # b7d118 0.00 : 4adb24: f7 d0 not %eax 0.00 : 4adb26: 48 98 cltq 0.00 : 4adb28: 48 8b 14 c2 mov (%rdx,%rax,8),%rdx 0.00 : 4adb2c: e9 6b fc ff ff jmpq 4ad79c <_bt_first+0x50c> 0.00 : 4adb31: 48 8d 95 c0 f5 ff ff lea -0xa40(%rbp),%rdx 0.00 : 4adb38: 48 89 95 90 ec ff ff mov %rdx,-0x1370(%rbp) 0.00 : 4adb3f: e9 6c ff ff ff jmpq 4adab0 <_bt_first+0x820> : cmp_proc = get_opfamily_proc(rel->rd_opfamily[i], : rel->rd_opcintype[i], : cur->sk_subtype, : BTORDER_PROC); : if (!RegProcedureIsValid(cmp_proc)) : elog(ERROR, "missing support function %d(%u,%u) for attribute %d of index \"%s\"", 0.00 : 4adb44: ba df 48 7b 00 mov $0x7b48df,%edx 0.00 : 4adb49: be 40 03 00 00 mov $0x340,%esi 0.00 : 4adb4e: bf 70 47 7b 00 mov $0x7b4770,%edi 0.00 : 4adb53: e8 c8 d8 2c 00 callq 77b420 0.00 : 4adb58: 48 8b 95 a8 ec ff ff mov -0x1358(%rbp),%rdx 0.00 : 4adb5f: 45 0f bf 4c 24 04 movswl 0x4(%r12),%r9d 0.00 : 4adb65: be 18 48 7b 00 mov $0x7b4818,%esi 0.00 : 4adb6a: 45 8b 44 24 08 mov 0x8(%r12),%r8d 0.00 : 4adb6f: bf 14 00 00 00 mov $0x14,%edi 0.00 : 4adb74: 48 8b 82 d0 00 00 00 mov 0xd0(%rdx),%rax 0.00 : 4adb7b: 42 8b 0c 30 mov (%rax,%r14,1),%ecx 0.00 : 4adb7f: 48 8b 42 30 mov 0x30(%rdx),%rax 0.00 : 4adb83: ba 01 00 00 00 mov $0x1,%edx 0.00 : 4adb88: 48 89 04 24 mov %rax,(%rsp) 0.00 : 4adb8c: 31 c0 xor %eax,%eax 0.00 : 4adb8e: e8 9d d6 2c 00 callq 77b230 0.00 : 4adb93: e8 38 b9 fb ff callq 4694d0 : break; : } : } : if (!used_all_subkeys) : { : switch (strat_total) 0.00 : 4adb98: 66 83 bd be ec ff ff cmpw $0x1,-0x1342(%rbp) 0.00 : 4adb9f: 01 0.00 : 4adba0: 0f 84 0a ff ff ff je 4adab0 <_bt_first+0x820> 0.00 : 4adba6: 66 83 bd be ec ff ff cmpw $0x5,-0x1342(%rbp) 0.00 : 4adbad: 05 0.00 : 4adbae: 0f 85 70 fa ff ff jne 4ad624 <_bt_first+0x394> 0.00 : 4adbb4: e9 b2 fe ff ff jmpq 4ada6b <_bt_first+0x7db> : : start = PageGetMaxOffsetNumber(page); : } : else : { : elog(ERROR, "invalid scan direction: %d", (int) dir); 0.00 : 4adbb9: ba e9 48 7b 00 mov $0x7b48e9,%edx 0.00 : 4adbbe: be 44 06 00 00 mov $0x644,%esi 0.00 : 4adbc3: bf 70 47 7b 00 mov $0x7b4770,%edi 0.00 : 4adbc8: e8 53 d8 2c 00 callq 77b420 0.00 : 4adbcd: 8b 95 9c ec ff ff mov -0x1364(%rbp),%edx 0.00 : 4adbd3: be 7c 47 7b 00 mov $0x7b477c,%esi 0.00 : 4adbd8: bf 14 00 00 00 mov $0x14,%edi 0.00 : 4adbdd: 31 c0 xor %eax,%eax 0.00 : 4adbdf: e8 4c d6 2c 00 callq 77b230 0.00 : 4adbe4: e8 e7 b8 fb ff callq 4694d0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/catalog/catalog.c:126 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000004e2db0 : : * : * Check IsCatalogRelation() for details. : */ : bool : IsCatalogClass(Oid relid, Form_pg_class reltuple) : { 0.00 : 4e2db0: 55 push %rbp 0.00 : 4e2db1: 48 89 e5 mov %rsp,%rbp 0.00 : 4e2db4: 53 push %rbx 0.00 : 4e2db5: 89 fb mov %edi,%ebx 0.00 : 4e2db7: 48 83 ec 08 sub $0x8,%rsp : Oid relnamespace = reltuple->relnamespace; 0.00 : 4e2dbb: 8b 7e 40 mov 0x40(%rsi),%edi : : /* : * Never consider relations outside pg_catalog/pg_toast to be catalog : * relations. : */ : if (!IsSystemNamespace(relnamespace) && !IsToastNamespace(relnamespace)) 0.00 : 4e2dbe: 83 ff 0b cmp $0xb,%edi 0.00 : 4e2dc1: 74 0b je 4e2dce 0.00 : 4e2dc3: e8 98 ff ff ff callq 4e2d60 0.00 : 4e2dc8: 31 d2 xor %edx,%edx 0.00 : 4e2dca: 84 c0 test %al,%al 0.00 : 4e2dcc: 74 09 je 4e2dd7 : * property (c.f. GetNewObjectId()) and it has the advantage that it works : * correctly even if a user decides to create a relation in the pg_catalog : * namespace. : * ---- : */ : return relid < FirstNormalObjectId; 0.00 : 4e2dce: 81 fb ff 3f 00 00 cmp $0x3fff,%ebx 0.00 : 4e2dd4: 0f 96 c2 setbe %dl : } 0.00 : 4e2dd7: 48 83 c4 08 add $0x8,%rsp 0.00 : 4e2ddb: 89 d0 mov %edx,%eax 0.00 : 4e2ddd: 5b pop %rbx /home/Computational/mark/src/postgres-andres/src/backend/catalog/catalog.c:126 100.00 : 4e2dde: c9 leaveq Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:537 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005ad8e0 : : * ---------------------------------------------------------------- : */ : static Datum : ExecEvalAggref(AggrefExprState *aggref, ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { 0.00 : 5ad8e0: 55 push %rbp : if (isDone) 0.00 : 5ad8e1: 48 85 c9 test %rcx,%rcx : * ---------------------------------------------------------------- : */ : static Datum : ExecEvalAggref(AggrefExprState *aggref, ExprContext *econtext, : bool *isNull, ExprDoneCond *isDone) : { 0.00 : 5ad8e4: 49 89 d0 mov %rdx,%r8 0.00 : 5ad8e7: 48 89 e5 mov %rsp,%rbp : if (isDone) 0.00 : 5ad8ea: 74 06 je 5ad8f2 : *isDone = ExprSingleResult; 0.00 : 5ad8ec: c7 01 00 00 00 00 movl $0x0,(%rcx) : : if (econtext->ecxt_aggvalues == NULL) /* safety check */ 0.00 : 5ad8f2: 48 83 7e 40 00 cmpq $0x0,0x40(%rsi) 0.00 : 5ad8f7: 74 1d je 5ad916 : elog(ERROR, "no aggregates in this expression context"); : : *isNull = econtext->ecxt_aggnulls[aggref->aggno]; /home/Computational/mark/src/postgres-andres/src/backend/executor/execQual.c:537 100.00 : 5ad8f9: 48 63 57 30 movslq 0x30(%rdi),%rdx 0.00 : 5ad8fd: 48 8b 46 48 mov 0x48(%rsi),%rax 0.00 : 5ad901: 0f b6 04 10 movzbl (%rax,%rdx,1),%eax 0.00 : 5ad905: 41 88 00 mov %al,(%r8) 0.00 : 5ad908: 48 63 57 30 movslq 0x30(%rdi),%rdx 0.00 : 5ad90c: 48 8b 46 40 mov 0x40(%rsi),%rax 0.00 : 5ad910: 48 8b 04 d0 mov (%rax,%rdx,8),%rax : return econtext->ecxt_aggvalues[aggref->aggno]; : } 0.00 : 5ad914: c9 leaveq 0.00 : 5ad915: c3 retq : { : if (isDone) : *isDone = ExprSingleResult; : : if (econtext->ecxt_aggvalues == NULL) /* safety check */ : elog(ERROR, "no aggregates in this expression context"); 0.00 : 5ad916: ba d3 af 88 00 mov $0x88afd3,%edx 0.00 : 5ad91b: be 17 02 00 00 mov $0x217,%esi 0.00 : 5ad920: bf fc a3 88 00 mov $0x88a3fc,%edi 0.00 : 5ad925: e8 f6 da 1c 00 callq 77b420 0.00 : 5ad92a: be 80 a5 88 00 mov $0x88a580,%esi 0.00 : 5ad92f: bf 14 00 00 00 mov $0x14,%edi 0.00 : 5ad934: 31 c0 xor %eax,%eax 0.00 : 5ad936: e8 f5 d8 1c 00 callq 77b230 0.00 : 5ad93b: e8 90 bb eb ff callq 4694d0 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:345 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000005b95d0 : : */ : static void : initialize_aggregates(AggState *aggstate, : AggStatePerAgg peragg, : AggStatePerGroup pergroup) : { 0.00 : 5b95d0: 55 push %rbp 0.00 : 5b95d1: 48 89 e5 mov %rsp,%rbp 0.00 : 5b95d4: 41 57 push %r15 0.00 : 5b95d6: 49 89 ff mov %rdi,%r15 0.00 : 5b95d9: 41 56 push %r14 0.00 : 5b95db: 41 55 push %r13 0.00 : 5b95dd: 41 54 push %r12 0.00 : 5b95df: 53 push %rbx 0.00 : 5b95e0: 48 83 ec 28 sub $0x28,%rsp 0.00 : 5b95e4: 48 89 75 d0 mov %rsi,-0x30(%rbp) 0.00 : 5b95e8: 48 89 55 c8 mov %rdx,-0x38(%rbp) : int aggno; : : for (aggno = 0; aggno < aggstate->numaggs; aggno++) 0.00 : 5b95ec: 44 8b 8f 98 00 00 00 mov 0x98(%rdi),%r9d 0.00 : 5b95f3: 45 85 c9 test %r9d,%r9d 0.00 : 5b95f6: 0f 8e 7c 01 00 00 jle 5b9778 0.00 : 5b95fc: 45 31 f6 xor %r14d,%r14d 0.00 : 5b95ff: eb 3e jmp 5b963f 0.00 : 5b9601: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : * : * Note that when the initial value is pass-by-ref, we must copy it : * (into the aggcontext) since we will pfree the transValue later. : */ : if (peraggstate->initValueIsNull) : pergroupstate->transValue = peraggstate->initValue; 0.00 : 5b9608: 49 8b 84 24 c0 00 00 mov 0xc0(%r12),%rax 0.00 : 5b960f: 00 0.00 : 5b9610: 49 89 45 00 mov %rax,0x0(%r13) : pergroupstate->transValue = datumCopy(peraggstate->initValue, : peraggstate->transtypeByVal, : peraggstate->transtypeLen); : MemoryContextSwitchTo(oldContext); : } : pergroupstate->transValueIsNull = peraggstate->initValueIsNull; 0.00 : 5b9614: 41 0f b6 84 24 c8 00 movzbl 0xc8(%r12),%eax 0.00 : 5b961b: 00 00 : AggStatePerAgg peragg, : AggStatePerGroup pergroup) : { : int aggno; : : for (aggno = 0; aggno < aggstate->numaggs; aggno++) 0.00 : 5b961d: 41 83 c6 01 add $0x1,%r14d : pergroupstate->transValue = datumCopy(peraggstate->initValue, : peraggstate->transtypeByVal, : peraggstate->transtypeLen); : MemoryContextSwitchTo(oldContext); : } : pergroupstate->transValueIsNull = peraggstate->initValueIsNull; 0.00 : 5b9621: 41 88 45 08 mov %al,0x8(%r13) : * pg_aggregate table then we will let the first non-NULL value : * returned from the outer procNode become the initial value. (This is : * useful for aggregates like max() and min().) The noTransValue flag : * signals that we still need to do this. : */ : pergroupstate->noTransValue = peraggstate->initValueIsNull; 0.00 : 5b9625: 41 0f b6 84 24 c8 00 movzbl 0xc8(%r12),%eax 0.00 : 5b962c: 00 00 0.00 : 5b962e: 41 88 45 09 mov %al,0x9(%r13) : AggStatePerAgg peragg, : AggStatePerGroup pergroup) : { : int aggno; : : for (aggno = 0; aggno < aggstate->numaggs; aggno++) /home/Computational/mark/src/postgres-andres/src/backend/executor/nodeAgg.c:345 100.00 : 5b9632: 45 39 b7 98 00 00 00 cmp %r14d,0x98(%r15) 0.00 : 5b9639: 0f 8e 39 01 00 00 jle 5b9778 : { : AggStatePerAgg peraggstate = &peragg[aggno]; 0.00 : 5b963f: 49 63 c6 movslq %r14d,%rax 0.00 : 5b9642: 4c 8b 65 d0 mov -0x30(%rbp),%r12 : AggStatePerGroup pergroupstate = &pergroup[aggno]; 0.00 : 5b9646: 4c 8b 6d c8 mov -0x38(%rbp),%r13 : { : int aggno; : : for (aggno = 0; aggno < aggstate->numaggs; aggno++) : { : AggStatePerAgg peraggstate = &peragg[aggno]; 0.00 : 5b964a: 48 69 d0 a8 04 00 00 imul $0x4a8,%rax,%rdx : AggStatePerGroup pergroupstate = &pergroup[aggno]; 0.00 : 5b9651: 48 c1 e0 04 shl $0x4,%rax 0.00 : 5b9655: 49 01 c5 add %rax,%r13 : { : int aggno; : : for (aggno = 0; aggno < aggstate->numaggs; aggno++) : { : AggStatePerAgg peraggstate = &peragg[aggno]; 0.00 : 5b9658: 49 01 d4 add %rdx,%r12 : AggStatePerGroup pergroupstate = &pergroup[aggno]; : : /* : * Start a fresh sort operation for each DISTINCT/ORDER BY aggregate. : */ : if (peraggstate->numSortCols > 0) 0.00 : 5b965b: 45 8b 84 24 8c 00 00 mov 0x8c(%r12),%r8d 0.00 : 5b9662: 00 0.00 : 5b9663: 45 85 c0 test %r8d,%r8d 0.00 : 5b9666: 7e 6c jle 5b96d4 : { : /* : * In case of rescan, maybe there could be an uncompleted sort : * operation? Clean it up if so. : */ : if (peraggstate->sortstate) 0.00 : 5b9668: 49 8b bc 24 f8 00 00 mov 0xf8(%r12),%rdi 0.00 : 5b966f: 00 0.00 : 5b9670: 48 85 ff test %rdi,%rdi 0.00 : 5b9673: 74 05 je 5b967a : tuplesort_end(peraggstate->sortstate); 0.00 : 5b9675: e8 66 5b 1e 00 callq 79f1e0 : /* : * We use a plain Datum sorter when there's a single input column; : * otherwise sort the full tuple. (See comments for : * process_ordered_aggregate_single.) : */ : peraggstate->sortstate = 0.00 : 5b967a: 41 83 7c 24 14 01 cmpl $0x1,0x14(%r12) 0.00 : 5b9680: 0f 84 aa 00 00 00 je 5b9730 0.00 : 5b9686: 4d 8b 8c 24 b0 00 00 mov 0xb0(%r12),%r9 0.00 : 5b968d: 00 0.00 : 5b968e: 4d 8b 84 24 a8 00 00 mov 0xa8(%r12),%r8 0.00 : 5b9695: 00 0.00 : 5b9696: 49 8b 8c 24 a0 00 00 mov 0xa0(%r12),%rcx 0.00 : 5b969d: 00 0.00 : 5b969e: 49 8b 94 24 98 00 00 mov 0x98(%r12),%rdx 0.00 : 5b96a5: 00 0.00 : 5b96a6: 41 8b b4 24 8c 00 00 mov 0x8c(%r12),%esi 0.00 : 5b96ad: 00 0.00 : 5b96ae: 49 8b bc 24 d8 00 00 mov 0xd8(%r12),%rdi 0.00 : 5b96b5: 00 0.00 : 5b96b6: 8b 05 5c f4 5a 00 mov 0x5af45c(%rip),%eax # b68b18 0.00 : 5b96bc: c7 44 24 08 00 00 00 movl $0x0,0x8(%rsp) 0.00 : 5b96c3: 00 0.00 : 5b96c4: 89 04 24 mov %eax,(%rsp) 0.00 : 5b96c7: e8 24 60 1e 00 callq 79f6f0 0.00 : 5b96cc: 49 89 84 24 f8 00 00 mov %rax,0xf8(%r12) 0.00 : 5b96d3: 00 : * (Re)set transValue to the initial value. : * : * Note that when the initial value is pass-by-ref, we must copy it : * (into the aggcontext) since we will pfree the transValue later. : */ : if (peraggstate->initValueIsNull) 0.00 : 5b96d4: 41 80 bc 24 c8 00 00 cmpb $0x0,0xc8(%r12) 0.00 : 5b96db: 00 00 0.00 : 5b96dd: 0f 85 25 ff ff ff jne 5b9608 : STATIC_IF_INLINE MemoryContext : MemoryContextSwitchTo(MemoryContext context) : { : MemoryContext old = CurrentMemoryContext; : : CurrentMemoryContext = context; 0.00 : 5b96e3: 49 8b 87 b8 00 00 00 mov 0xb8(%r15),%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 : 5b96ea: 48 8b 1d 6f 11 60 00 mov 0x60116f(%rip),%rbx # bba860 : : CurrentMemoryContext = context; 0.00 : 5b96f1: 48 89 05 68 11 60 00 mov %rax,0x601168(%rip) # bba860 : else : { : MemoryContext oldContext; : : oldContext = MemoryContextSwitchTo(aggstate->aggcontext); : pergroupstate->transValue = datumCopy(peraggstate->initValue, 0.00 : 5b96f8: 41 0f bf 94 24 ce 00 movswl 0xce(%r12),%edx 0.00 : 5b96ff: 00 00 0.00 : 5b9701: 41 0f be b4 24 d2 00 movsbl 0xd2(%r12),%esi 0.00 : 5b9708: 00 00 0.00 : 5b970a: 49 8b bc 24 c0 00 00 mov 0xc0(%r12),%rdi 0.00 : 5b9711: 00 0.00 : 5b9712: e8 59 68 11 00 callq 6cff70 0.00 : 5b9717: 49 89 45 00 mov %rax,0x0(%r13) 0.00 : 5b971b: 48 89 1d 3e 11 60 00 mov %rbx,0x60113e(%rip) # bba860 0.00 : 5b9722: e9 ed fe ff ff jmpq 5b9614 0.00 : 5b9727: 66 0f 1f 84 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 5b972e: 00 00 : /* : * We use a plain Datum sorter when there's a single input column; : * otherwise sort the full tuple. (See comments for : * process_ordered_aggregate_single.) : */ : peraggstate->sortstate = 0.00 : 5b9730: 49 8b 84 24 b0 00 00 mov 0xb0(%r12),%rax 0.00 : 5b9737: 00 0.00 : 5b9738: 49 8b 94 24 a8 00 00 mov 0xa8(%r12),%rdx 0.00 : 5b973f: 00 0.00 : 5b9740: 45 31 c9 xor %r9d,%r9d 0.00 : 5b9743: 49 8b b4 24 a0 00 00 mov 0xa0(%r12),%rsi 0.00 : 5b974a: 00 0.00 : 5b974b: 44 8b 05 c6 f3 5a 00 mov 0x5af3c6(%rip),%r8d # b68b18 0.00 : 5b9752: 0f be 08 movsbl (%rax),%ecx 0.00 : 5b9755: 49 8b 84 24 d8 00 00 mov 0xd8(%r12),%rax 0.00 : 5b975c: 00 0.00 : 5b975d: 8b 12 mov (%rdx),%edx 0.00 : 5b975f: 8b 36 mov (%rsi),%esi 0.00 : 5b9761: 48 8b 40 08 mov 0x8(%rax),%rax 0.00 : 5b9765: 48 8b 00 mov (%rax),%rax 0.00 : 5b9768: 8b 78 44 mov 0x44(%rax),%edi 0.00 : 5b976b: e8 30 5d 1e 00 callq 79f4a0 0.00 : 5b9770: e9 57 ff ff ff jmpq 5b96cc 0.00 : 5b9775: 0f 1f 00 nopl (%rax) : * useful for aggregates like max() and min().) The noTransValue flag : * signals that we still need to do this. : */ : pergroupstate->noTransValue = peraggstate->initValueIsNull; : } : } 0.00 : 5b9778: 48 83 c4 28 add $0x28,%rsp 0.00 : 5b977c: 5b pop %rbx 0.00 : 5b977d: 41 5c pop %r12 0.00 : 5b977f: 41 5d pop %r13 0.00 : 5b9781: 41 5e pop %r14 0.00 : 5b9783: 41 5f pop %r15 0.00 : 5b9785: 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:2825 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000674b60 : : * This function cannot be used on a buffer we do not have pinned, : * because it doesn't change the shared buffer state. : */ : void : IncrBufferRefCount(Buffer buffer) : { 0.00 : 674b60: 55 push %rbp 0.00 : 674b61: 48 89 e5 mov %rsp,%rbp 0.00 : 674b64: 53 push %rbx 0.00 : 674b65: 89 fb mov %edi,%ebx 0.00 : 674b67: 48 83 ec 08 sub $0x8,%rsp : Assert(BufferIsPinned(buffer)); : ResourceOwnerEnlargeBuffers(CurrentResourceOwner); 0.00 : 674b6b: 48 8b 3d 4e 5d 54 00 mov 0x545d4e(%rip),%rdi # bba8c0 0.00 : 674b72: e8 f9 62 12 00 callq 79ae70 : ResourceOwnerRememberBuffer(CurrentResourceOwner, buffer); 0.00 : 674b77: 48 8b 3d 42 5d 54 00 mov 0x545d42(%rip),%rdi # bba8c0 0.00 : 674b7e: 89 de mov %ebx,%esi 0.00 : 674b80: e8 1b 56 12 00 callq 79a1a0 : if (BufferIsLocal(buffer)) 0.00 : 674b85: 85 db test %ebx,%ebx 0.00 : 674b87: 78 1f js 674ba8 : LocalRefCount[-buffer - 1]++; : else : { : PrivateRefCountEntry *ref; : ref = GetPrivateRefCountEntry(buffer, false, true); 0.00 : 674b89: 89 df mov %ebx,%edi 0.00 : 674b8b: ba 01 00 00 00 mov $0x1,%edx 0.00 : 674b90: 31 f6 xor %esi,%esi 0.00 : 674b92: e8 89 f9 ff ff callq 674520 : Assert(ref != NULL); : ref->refcount++; 0.00 : 674b97: 83 40 04 01 addl $0x1,0x4(%rax) : } : } 0.00 : 674b9b: 48 83 c4 08 add $0x8,%rsp 0.00 : 674b9f: 5b pop %rbx 0.00 : 674ba0: c9 leaveq /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:2825 100.00 : 674ba1: c3 retq 0.00 : 674ba2: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : { : Assert(BufferIsPinned(buffer)); : ResourceOwnerEnlargeBuffers(CurrentResourceOwner); : ResourceOwnerRememberBuffer(CurrentResourceOwner, buffer); : if (BufferIsLocal(buffer)) : LocalRefCount[-buffer - 1]++; 0.00 : 674ba8: f7 d3 not %ebx 0.00 : 674baa: 48 63 c3 movslq %ebx,%rax 0.00 : 674bad: 48 c1 e0 02 shl $0x2,%rax 0.00 : 674bb1: 48 03 05 68 85 50 00 add 0x508568(%rip),%rax # b7d120 0.00 : 674bb8: 83 00 01 addl $0x1,(%rax) : PrivateRefCountEntry *ref; : ref = GetPrivateRefCountEntry(buffer, false, true); : Assert(ref != NULL); : ref->refcount++; : } : } 0.00 : 674bbb: 48 83 c4 08 add $0x8,%rsp 0.00 : 674bbf: 5b pop %rbx 0.00 : 674bc0: 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:1364 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); /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:1364 100.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) 0.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:573 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000675ca0 : : */ : static Buffer : ReadBuffer_common(SMgrRelation smgr, char relpersistence, ForkNumber forkNum, : BlockNumber blockNum, ReadBufferMode mode, : BufferAccessStrategy strategy, bool *hit) : { 0.00 : 675ca0: 55 push %rbp 0.00 : 675ca1: 48 89 e5 mov %rsp,%rbp 0.00 : 675ca4: 41 57 push %r15 0.00 : 675ca6: 4d 89 cf mov %r9,%r15 /home/Computational/mark/src/postgres-andres/src/backend/storage/buffer/bufmgr.c:573 100.00 : 675ca9: 41 56 push %r14 0.00 : 675cab: 41 55 push %r13 0.00 : 675cad: 41 54 push %r12 0.00 : 675caf: 53 push %rbx 0.00 : 675cb0: 48 83 ec 68 sub $0x68,%rsp 0.00 : 675cb4: 48 89 7d 80 mov %rdi,-0x80(%rbp) 0.00 : 675cb8: 89 95 78 ff ff ff mov %edx,-0x88(%rbp) 0.00 : 675cbe: 89 8d 74 ff ff ff mov %ecx,-0x8c(%rbp) 0.00 : 675cc4: 44 89 85 70 ff ff ff mov %r8d,-0x90(%rbp) 0.00 : 675ccb: 40 88 b5 7f ff ff ff mov %sil,-0x81(%rbp) : volatile BufferDesc *bufHdr; : Block bufBlock; : bool found; : bool isExtend; : bool isLocalBuf = SmgrIsTemp(smgr); 0.00 : 675cd2: 83 7f 0c ff cmpl $0xffffffff,0xc(%rdi) : : *hit = false; 0.00 : 675cd6: 48 8b 45 10 mov 0x10(%rbp),%rax : { : volatile BufferDesc *bufHdr; : Block bufBlock; : bool found; : bool isExtend; : bool isLocalBuf = SmgrIsTemp(smgr); 0.00 : 675cda: 0f 95 45 8f setne -0x71(%rbp) : : *hit = false; 0.00 : 675cde: c6 00 00 movb $0x0,(%rax) : : /* Make sure we will have room to remember the buffer pin */ : ResourceOwnerEnlargeBuffers(CurrentResourceOwner); 0.00 : 675ce1: 48 8b 3d d8 4b 54 00 mov 0x544bd8(%rip),%rdi # bba8c0 0.00 : 675ce8: e8 83 51 12 00 callq 79ae70 : : isExtend = (blockNum == P_NEW); 0.00 : 675ced: 83 bd 74 ff ff ff ff cmpl $0xffffffff,-0x8c(%rbp) : smgr->smgr_rnode.node.relNode, : smgr->smgr_rnode.backend, : isExtend); : : /* Substitute proper block number if caller asked for P_NEW */ : if (isExtend) 0.00 : 675cf4: 0f 94 45 8e sete -0x72(%rbp) 0.00 : 675cf8: 0f 84 2f 05 00 00 je 67622d : blockNum = smgrnblocks(smgr, forkNum); : : if (isLocalBuf) 0.00 : 675cfe: 80 7d 8f 00 cmpb $0x0,-0x71(%rbp) 0.00 : 675d02: 74 7b je 675d7f : { : bufHdr = LocalBufferAlloc(smgr, forkNum, blockNum, &found); 0.00 : 675d04: 8b 95 74 ff ff ff mov -0x8c(%rbp),%edx 0.00 : 675d0a: 8b b5 78 ff ff ff mov -0x88(%rbp),%esi 0.00 : 675d10: 48 8d 4d cf lea -0x31(%rbp),%rcx 0.00 : 675d14: 48 8b 7d 80 mov -0x80(%rbp),%rdi 0.00 : 675d18: e8 c3 20 00 00 callq 677de0 : if (found) 0.00 : 675d1d: 80 7d cf 00 cmpb $0x0,-0x31(%rbp) : if (isExtend) : blockNum = smgrnblocks(smgr, forkNum); : : if (isLocalBuf) : { : bufHdr = LocalBufferAlloc(smgr, forkNum, blockNum, &found); 0.00 : 675d21: 49 89 c6 mov %rax,%r14 : if (found) 0.00 : 675d24: 0f 85 1b 04 00 00 jne 676145 : pgBufferUsage.local_blks_hit++; : else : pgBufferUsage.local_blks_read++; 0.00 : 675d2a: 48 83 05 56 9a 54 00 addq $0x1,0x549a56(%rip) # bbf788 0.00 : 675d31: 01 : } : : /* At this point we do NOT hold any locks. */ : : /* if it was already in the buffer pool, we're done */ : if (found) 0.00 : 675d32: 80 7d cf 00 cmpb $0x0,-0x31(%rbp) 0.00 : 675d36: 0f 84 fa 00 00 00 je 675e36 : { : if (!isExtend) 0.00 : 675d3c: 80 7d 8e 00 cmpb $0x0,-0x72(%rbp) 0.00 : 675d40: 0f 85 01 05 00 00 jne 676247 : { : /* Just need to update stats before we exit */ : *hit = true; 0.00 : 675d46: 48 8b 45 10 mov 0x10(%rbp),%rax 0.00 : 675d4a: c6 00 01 movb $0x1,(%rax) : VacuumPageHit++; 0.00 : 675d4d: 83 05 80 43 54 00 01 addl $0x1,0x544380(%rip) # bba0d4 : : if (VacuumCostActive) 0.00 : 675d54: 80 3d 89 43 54 00 00 cmpb $0x0,0x544389(%rip) # bba0e4 0.00 : 675d5b: 74 0c je 675d69 : VacuumCostBalance += VacuumCostPageHit; 0.00 : 675d5d: 8b 05 c9 2d 4f 00 mov 0x4f2dc9(%rip),%eax # b68b2c 0.00 : 675d63: 01 05 77 43 54 00 add %eax,0x544377(%rip) # bba0e0 : smgr->smgr_rnode.node.relNode, : smgr->smgr_rnode.backend, : isExtend, : found); : : return BufferDescriptorGetBuffer(bufHdr); 0.00 : 675d69: 41 8b 46 24 mov 0x24(%r14),%eax : } 0.00 : 675d6d: 48 83 c4 68 add $0x68,%rsp 0.00 : 675d71: 5b pop %rbx 0.00 : 675d72: 41 5c pop %r12 0.00 : 675d74: 41 5d pop %r13 0.00 : 675d76: 41 5e pop %r14 : smgr->smgr_rnode.node.relNode, : smgr->smgr_rnode.backend, : isExtend, : found); : : return BufferDescriptorGetBuffer(bufHdr); 0.00 : 675d78: 83 c0 01 add $0x1,%eax : } 0.00 : 675d7b: 41 5f pop %r15 0.00 : 675d7d: c9 leaveq 0.00 : 675d7e: c3 retq : int buf_id; : volatile BufferDesc *buf; : bool valid; : : /* create a tag so we can lookup the buffer */ : INIT_BUFFERTAG(newTag, smgr->smgr_rnode.node, forkNum, blockNum); 0.00 : 675d7f: 48 8b 55 80 mov -0x80(%rbp),%rdx 0.00 : 675d83: 48 8b 02 mov (%rdx),%rax 0.00 : 675d86: 48 89 45 b0 mov %rax,-0x50(%rbp) 0.00 : 675d8a: 8b 42 08 mov 0x8(%rdx),%eax 0.00 : 675d8d: 8b 95 74 ff ff ff mov -0x8c(%rbp),%edx 0.00 : 675d93: 89 45 b8 mov %eax,-0x48(%rbp) 0.00 : 675d96: 8b 85 78 ff ff ff mov -0x88(%rbp),%eax 0.00 : 675d9c: 89 55 c0 mov %edx,-0x40(%rbp) 0.00 : 675d9f: 89 45 bc mov %eax,-0x44(%rbp) 0.00 : 675da2: eb 11 jmp 675db5 0.00 : 675da4: 0f 1f 40 00 nopl 0x0(%rax) : valid = PinBuffer(foundbuf, strategy); : : /* Check whether someone recycled the buffer before we pinned it. */ : if (!BUFFERTAGS_EQUAL(newTag, foundbuf->tag)) : { : UnpinBuffer(foundbuf, true); 0.00 : 675da8: be 01 00 00 00 mov $0x1,%esi 0.00 : 675dad: 48 89 df mov %rbx,%rdi 0.00 : 675db0: e8 7b ef ff ff callq 674d30 : /* create a tag so we can lookup the buffer */ : INIT_BUFFERTAG(newTag, smgr->smgr_rnode.node, forkNum, blockNum); : : /* see if the block is in the buffer pool already */ : start: : buf_id = BufTableLookup(&newTag); 0.00 : 675db5: 48 8d 7d b0 lea -0x50(%rbp),%rdi 0.00 : 675db9: e8 22 e0 ff ff callq 673de0 : if (buf_id >= 0) 0.00 : 675dbe: 85 c0 test %eax,%eax 0.00 : 675dc0: 0f 88 bb 01 00 00 js 675f81 : : /* : * Found it. Now, pin the buffer so no one can steal it from the : * buffer pool. : */ : foundbuf = &BufferDescriptors[buf_id]; 0.00 : 675dc6: 48 63 d8 movslq %eax,%rbx : : valid = PinBuffer(foundbuf, strategy); 0.00 : 675dc9: 4c 89 fe mov %r15,%rsi : : /* : * Found it. Now, pin the buffer so no one can steal it from the : * buffer pool. : */ : foundbuf = &BufferDescriptors[buf_id]; 0.00 : 675dcc: 48 c1 e3 06 shl $0x6,%rbx 0.00 : 675dd0: 48 03 1d 29 9d 54 00 add 0x549d29(%rip),%rbx # bbfb00 : : valid = PinBuffer(foundbuf, strategy); 0.00 : 675dd7: 48 89 df mov %rbx,%rdi 0.00 : 675dda: 49 89 dc mov %rbx,%r12 0.00 : 675ddd: e8 4e ee ff ff callq 674c30 0.00 : 675de2: 89 c2 mov %eax,%edx : : /* Check whether someone recycled the buffer before we pinned it. */ : if (!BUFFERTAGS_EQUAL(newTag, foundbuf->tag)) 0.00 : 675de4: 8b 45 b8 mov -0x48(%rbp),%eax 0.00 : 675de7: 3b 43 08 cmp 0x8(%rbx),%eax 0.00 : 675dea: 75 bc jne 675da8 0.00 : 675dec: 8b 45 b4 mov -0x4c(%rbp),%eax 0.00 : 675def: 3b 43 04 cmp 0x4(%rbx),%eax 0.00 : 675df2: 75 b4 jne 675da8 0.00 : 675df4: 8b 45 b0 mov -0x50(%rbp),%eax 0.00 : 675df7: 3b 03 cmp (%rbx),%eax 0.00 : 675df9: 75 ad jne 675da8 0.00 : 675dfb: 8b 45 c0 mov -0x40(%rbp),%eax 0.00 : 675dfe: 3b 43 10 cmp 0x10(%rbx),%eax 0.00 : 675e01: 75 a5 jne 675da8 0.00 : 675e03: 8b 45 bc mov -0x44(%rbp),%eax 0.00 : 675e06: 3b 43 0c cmp 0xc(%rbx),%eax 0.00 : 675e09: 75 9d jne 675da8 : } : : *foundPtr = TRUE; : : /* Check to see if the correct data has been loaded into the buffer. */ : if (!valid) 0.00 : 675e0b: 84 d2 test %dl,%dl : { : UnpinBuffer(foundbuf, true); : goto start; : } : : *foundPtr = TRUE; 0.00 : 675e0d: c6 45 cf 01 movb $0x1,-0x31(%rbp) : : /* Check to see if the correct data has been loaded into the buffer. */ : if (!valid) 0.00 : 675e11: 0f 84 33 02 00 00 je 67604a : * lookup the buffer. IO_IN_PROGRESS is set if the requested block is : * not currently in memory. : */ : bufHdr = BufferAlloc(smgr, relpersistence, forkNum, blockNum, : strategy, &found); : if (found) 0.00 : 675e17: 80 7d cf 00 cmpb $0x0,-0x31(%rbp) : pgBufferUsage.shared_blks_hit++; 0.00 : 675e1b: 4d 89 e6 mov %r12,%r14 : * lookup the buffer. IO_IN_PROGRESS is set if the requested block is : * not currently in memory. : */ : bufHdr = BufferAlloc(smgr, relpersistence, forkNum, blockNum, : strategy, &found); : if (found) 0.00 : 675e1e: 0f 84 9a 03 00 00 je 6761be : pgBufferUsage.shared_blks_hit++; 0.00 : 675e24: 48 83 05 34 99 54 00 addq $0x1,0x549934(%rip) # bbf760 0.00 : 675e2b: 01 : } : : /* At this point we do NOT hold any locks. */ : : /* if it was already in the buffer pool, we're done */ : if (found) 0.00 : 675e2c: 80 7d cf 00 cmpb $0x0,-0x31(%rbp) 0.00 : 675e30: 0f 85 06 ff ff ff jne 675d3c : * it's not been recycled) but come right back here to try smgrextend : * again. : */ : Assert(!(bufHdr->flags & BM_VALID)); /* spinlock not needed */ : : bufBlock = isLocalBuf ? LocalBufHdrGetBlock(bufHdr) : BufHdrGetBlock(bufHdr); 0.00 : 675e36: 80 7d 8f 00 cmpb $0x0,-0x71(%rbp) 0.00 : 675e3a: 0f 84 8b 03 00 00 je 6761cb 0.00 : 675e40: 41 8b 46 24 mov 0x24(%r14),%eax 0.00 : 675e44: ba fe ff ff ff mov $0xfffffffe,%edx 0.00 : 675e49: 29 c2 sub %eax,%edx : : if (isExtend) 0.00 : 675e4b: 80 7d 8e 00 cmpb $0x0,-0x72(%rbp) : * it's not been recycled) but come right back here to try smgrextend : * again. : */ : Assert(!(bufHdr->flags & BM_VALID)); /* spinlock not needed */ : : bufBlock = isLocalBuf ? LocalBufHdrGetBlock(bufHdr) : BufHdrGetBlock(bufHdr); 0.00 : 675e4f: 48 8b 05 c2 72 50 00 mov 0x5072c2(%rip),%rax # b7d118 0.00 : 675e56: 48 63 d2 movslq %edx,%rdx 0.00 : 675e59: 4c 8b 24 d0 mov (%rax,%rdx,8),%r12 : : if (isExtend) 0.00 : 675e5d: 0f 85 84 03 00 00 jne 6761e7 : { : /* : * Read in the page, unless the caller intends to overwrite it and : * just wants us to allocate a buffer. : */ : if (mode == RBM_ZERO) 0.00 : 675e63: 83 bd 70 ff ff ff 01 cmpl $0x1,-0x90(%rbp) 0.00 : 675e6a: 74 7e je 675eea : else : { : instr_time io_start, : io_time; : : if (track_io_timing) 0.00 : 675e6c: 80 3d ee 71 50 00 00 cmpb $0x0,0x5071ee(%rip) # b7d061 0.00 : 675e73: 0f 85 d1 04 00 00 jne 67634a : INSTR_TIME_SET_CURRENT(io_start); : : smgrread(smgr, forkNum, blockNum, (char *) bufBlock); 0.00 : 675e79: 8b 95 74 ff ff ff mov -0x8c(%rbp),%edx 0.00 : 675e7f: 8b b5 78 ff ff ff mov -0x88(%rbp),%esi 0.00 : 675e85: 4c 89 e1 mov %r12,%rcx 0.00 : 675e88: 48 8b 7d 80 mov -0x80(%rbp),%rdi 0.00 : 675e8c: e8 7f 35 02 00 callq 699410 : : if (track_io_timing) 0.00 : 675e91: 80 3d c9 71 50 00 00 cmpb $0x0,0x5071c9(%rip) # b7d061 0.00 : 675e98: 0f 85 bc 04 00 00 jne 67635a : pgstat_count_buffer_read_time(INSTR_TIME_GET_MICROSEC(io_time)); : INSTR_TIME_ADD(pgBufferUsage.blk_read_time, io_time); : } : : /* check for garbage data */ : if (!PageIsVerified((Page) bufBlock, blockNum)) 0.00 : 675e9e: 8b b5 74 ff ff ff mov -0x8c(%rbp),%esi 0.00 : 675ea4: 4c 89 e7 mov %r12,%rdi 0.00 : 675ea7: e8 24 f0 01 00 callq 694ed0 0.00 : 675eac: 84 c0 test %al,%al 0.00 : 675eae: 75 47 jne 675ef7 : { : if (mode == RBM_ZERO_ON_ERROR || zero_damaged_pages) 0.00 : 675eb0: 83 bd 70 ff ff ff 02 cmpl $0x2,-0x90(%rbp) 0.00 : 675eb7: 74 0d je 675ec6 0.00 : 675eb9: 80 3d a0 71 50 00 00 cmpb $0x0,0x5071a0(%rip) # b7d060 0.00 : 675ec0: 0f 84 51 05 00 00 je 676417 : { : ereport(WARNING, 0.00 : 675ec6: 45 31 c0 xor %r8d,%r8d 0.00 : 675ec9: b9 a0 a0 8a 00 mov $0x8aa0a0,%ecx 0.00 : 675ece: ba f0 02 00 00 mov $0x2f0,%edx 0.00 : 675ed3: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 675ed8: bf 13 00 00 00 mov $0x13,%edi 0.00 : 675edd: e8 de 4b 10 00 callq 77aac0 0.00 : 675ee2: 84 c0 test %al,%al 0.00 : 675ee4: 0f 85 11 04 00 00 jne 6762fb : (errcode(ERRCODE_DATA_CORRUPTED), : errmsg("invalid page in block %u of relation %s; zeroing out page", : blockNum, : relpath(smgr->smgr_rnode, forkNum)))); : MemSet((char *) bufBlock, 0, BLCKSZ); 0.00 : 675eea: b9 00 04 00 00 mov $0x400,%ecx 0.00 : 675eef: 31 c0 xor %eax,%eax 0.00 : 675ef1: 4c 89 e7 mov %r12,%rdi 0.00 : 675ef4: f3 48 ab rep stos %rax,%es:(%rdi) : relpath(smgr->smgr_rnode, forkNum)))); : } : } : } : : if (isLocalBuf) 0.00 : 675ef7: 80 7d 8f 00 cmpb $0x0,-0x71(%rbp) 0.00 : 675efb: 0f 84 18 03 00 00 je 676219 : { : /* Only need to adjust flags */ : bufHdr->flags |= BM_VALID; 0.00 : 675f01: 41 0f b7 46 14 movzwl 0x14(%r14),%eax 0.00 : 675f06: 83 c8 02 or $0x2,%eax 0.00 : 675f09: 66 41 89 46 14 mov %ax,0x14(%r14) : { : /* Set BM_VALID, terminate IO, and wake up any waiters */ : TerminateBufferIO(bufHdr, false, BM_VALID); : } : : VacuumPageMiss++; 0.00 : 675f0e: 83 05 c3 41 54 00 01 addl $0x1,0x5441c3(%rip) # bba0d8 : if (VacuumCostActive) 0.00 : 675f15: 80 3d c8 41 54 00 00 cmpb $0x0,0x5441c8(%rip) # bba0e4 0.00 : 675f1c: 0f 84 47 fe ff ff je 675d69 : VacuumCostBalance += VacuumCostPageMiss; 0.00 : 675f22: 8b 05 08 2c 4f 00 mov 0x4f2c08(%rip),%eax # b68b30 0.00 : 675f28: 01 05 b2 41 54 00 add %eax,0x5441b2(%rip) # bba0e0 0.00 : 675f2e: e9 36 fe ff ff jmpq 675d69 0.00 : 675f33: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) : } : : /* : * Need to lock the buffer header too in order to change its tag. : */ : LockBufHdr(buf); 0.00 : 675f38: 49 8d 5e 20 lea 0x20(%r14),%rbx : static __inline__ int : tas(volatile slock_t *lock) : { : register slock_t _res = 1; : : __asm__ __volatile__( 0.00 : 675f3c: b8 01 00 00 00 mov $0x1,%eax 0.00 : 675f41: f0 86 03 lock xchg %al,(%rbx) 0.00 : 675f44: 84 c0 test %al,%al 0.00 : 675f46: 0f 85 a4 01 00 00 jne 6760f0 : * Somebody could have pinned or re-dirtied the buffer while we were : * doing the I/O and making the new hashtable entry. If so, we can't : * recycle this buffer; we must undo everything we've done and start : * over with a new victim buffer. : */ : oldFlags = buf->flags; 0.00 : 675f4c: 41 0f b7 56 14 movzwl 0x14(%r14),%edx : if (buf->refcount == 1 && !(oldFlags & BM_DIRTY)) 0.00 : 675f51: 41 8b 46 18 mov 0x18(%r14),%eax 0.00 : 675f55: 83 e8 01 sub $0x1,%eax 0.00 : 675f58: 75 0c jne 675f66 0.00 : 675f5a: 0f b7 d2 movzwl %dx,%edx 0.00 : 675f5d: f6 c2 01 test $0x1,%dl 0.00 : 675f60: 0f 84 ec 01 00 00 je 676152 : break; : : UnlockBufHdr(buf); : BufTableDelete(&newTag); 0.00 : 675f66: 48 8d 7d b0 lea -0x50(%rbp),%rdi : */ : oldFlags = buf->flags; : if (buf->refcount == 1 && !(oldFlags & BM_DIRTY)) : break; : : UnlockBufHdr(buf); 0.00 : 675f6a: 41 c6 46 20 00 movb $0x0,0x20(%r14) : BufTableDelete(&newTag); 0.00 : 675f6f: e8 dc dd ff ff callq 673d50 : UnpinBuffer(buf, true); 0.00 : 675f74: be 01 00 00 00 mov $0x1,%esi 0.00 : 675f79: 4c 89 f7 mov %r14,%rdi 0.00 : 675f7c: e8 af ed ff ff callq 674d30 : { : /* : * Select a victim buffer. The buffer is returned with its header : * spinlock still held! : */ : buf = StrategyGetBuffer(strategy); 0.00 : 675f81: 4c 89 ff mov %r15,%rdi 0.00 : 675f84: e8 d7 15 00 00 callq 677560 : : Assert(buf->refcount == 0); : : /* Must copy buffer flags while we still hold the spinlock */ : oldFlags = buf->flags; 0.00 : 675f89: 0f b7 58 14 movzwl 0x14(%rax),%ebx : : /* Pin the buffer and then release the buffer spinlock */ : PinBuffer_Locked(buf); 0.00 : 675f8d: 48 89 c7 mov %rax,%rdi : { : /* : * Select a victim buffer. The buffer is returned with its header : * spinlock still held! : */ : buf = StrategyGetBuffer(strategy); 0.00 : 675f90: 49 89 c6 mov %rax,%r14 : : /* Must copy buffer flags while we still hold the spinlock */ : oldFlags = buf->flags; : : /* Pin the buffer and then release the buffer spinlock */ : PinBuffer_Locked(buf); 0.00 : 675f93: e8 38 ec ff ff callq 674bd0 : * condition here, in that someone might dirty it after we released it : * above, or even while we are writing it out (since our share-lock : * won't prevent hint-bit updates). We will recheck the dirty bit : * after re-locking the buffer header. : */ : if (oldFlags & BM_DIRTY) 0.00 : 675f98: 0f b7 db movzwl %bx,%ebx 0.00 : 675f9b: f6 c3 01 test $0x1,%bl 0.00 : 675f9e: 0f 85 cc 00 00 00 jne 676070 : : /* : * To change the association of a valid buffer, we'll need to have : * exclusive lock on both the old and new mapping partitions. : */ : if (oldFlags & BM_TAG_VALID) 0.00 : 675fa4: 83 e3 04 and $0x4,%ebx 0.00 : 675fa7: 74 2c je 675fd5 : { : /* Save old tag. */ : oldTag = buf->tag; 0.00 : 675fa9: 49 8b 06 mov (%r14),%rax 0.00 : 675fac: 48 89 45 90 mov %rax,-0x70(%rbp) 0.00 : 675fb0: 49 8b 46 08 mov 0x8(%r14),%rax 0.00 : 675fb4: 48 89 45 98 mov %rax,-0x68(%rbp) 0.00 : 675fb8: 41 8b 46 10 mov 0x10(%r14),%eax 0.00 : 675fbc: 89 45 a0 mov %eax,-0x60(%rbp) 0.00 : 675fbf: eb 14 jmp 675fd5 0.00 : 675fc1: 0f 1f 80 00 00 00 00 nopl 0x0(%rax) : */ : foundbuf = &BufferDescriptors[buf_id]; : valid = PinBuffer(foundbuf, strategy); : if (!BUFFERTAGS_EQUAL(newTag, foundbuf->tag)) : { : UnpinBuffer(foundbuf, true); 0.00 : 675fc8: be 01 00 00 00 mov $0x1,%esi 0.00 : 675fcd: 48 89 df mov %rbx,%rdi 0.00 : 675fd0: e8 5b ed ff ff callq 674d30 : * allocated another buffer for the same block we want to read in. : * Note that we have not yet removed the hashtable entry for the old : * tag. : */ : enter: : buf_id = BufTableInsert(&newTag, buf->buf_id); 0.00 : 675fd5: 41 8b 76 24 mov 0x24(%r14),%esi 0.00 : 675fd9: 48 8d 7d b0 lea -0x50(%rbp),%rdi 0.00 : 675fdd: e8 be dd ff ff callq 673da0 : : if (buf_id >= 0) 0.00 : 675fe2: 85 c0 test %eax,%eax 0.00 : 675fe4: 0f 88 4e ff ff ff js 675f38 : * did what we were about to do. We can handle this as if we had : * found the buffer in the pool in the first place, but we must : * recheck the buffer tag after pinning it, because it could still : * get renamed under us. : */ : foundbuf = &BufferDescriptors[buf_id]; 0.00 : 675fea: 48 63 d8 movslq %eax,%rbx : valid = PinBuffer(foundbuf, strategy); 0.00 : 675fed: 4c 89 fe mov %r15,%rsi : * did what we were about to do. We can handle this as if we had : * found the buffer in the pool in the first place, but we must : * recheck the buffer tag after pinning it, because it could still : * get renamed under us. : */ : foundbuf = &BufferDescriptors[buf_id]; 0.00 : 675ff0: 48 c1 e3 06 shl $0x6,%rbx 0.00 : 675ff4: 48 03 1d 05 9b 54 00 add 0x549b05(%rip),%rbx # bbfb00 : valid = PinBuffer(foundbuf, strategy); 0.00 : 675ffb: 48 89 df mov %rbx,%rdi 0.00 : 675ffe: 49 89 dc mov %rbx,%r12 0.00 : 676001: e8 2a ec ff ff callq 674c30 0.00 : 676006: 41 89 c5 mov %eax,%r13d : if (!BUFFERTAGS_EQUAL(newTag, foundbuf->tag)) 0.00 : 676009: 8b 45 b8 mov -0x48(%rbp),%eax 0.00 : 67600c: 3b 43 08 cmp 0x8(%rbx),%eax 0.00 : 67600f: 75 b7 jne 675fc8 0.00 : 676011: 8b 45 b4 mov -0x4c(%rbp),%eax 0.00 : 676014: 3b 43 04 cmp 0x4(%rbx),%eax 0.00 : 676017: 75 af jne 675fc8 0.00 : 676019: 8b 45 b0 mov -0x50(%rbp),%eax 0.00 : 67601c: 3b 03 cmp (%rbx),%eax 0.00 : 67601e: 75 a8 jne 675fc8 0.00 : 676020: 8b 45 c0 mov -0x40(%rbp),%eax 0.00 : 676023: 3b 43 10 cmp 0x10(%rbx),%eax 0.00 : 676026: 75 a0 jne 675fc8 0.00 : 676028: 8b 45 bc mov -0x44(%rbp),%eax 0.00 : 67602b: 3b 43 0c cmp 0xc(%rbx),%eax 0.00 : 67602e: 75 98 jne 675fc8 : : /* : * Collision confirmed. Give up the buffer we were planning to : * use. : */ : UnpinBuffer(buf, true); 0.00 : 676030: be 01 00 00 00 mov $0x1,%esi 0.00 : 676035: 4c 89 f7 mov %r14,%rdi 0.00 : 676038: e8 f3 ec ff ff callq 674d30 : : *foundPtr = TRUE; : : if (!valid) 0.00 : 67603d: 45 84 ed test %r13b,%r13b : * Collision confirmed. Give up the buffer we were planning to : * use. : */ : UnpinBuffer(buf, true); : : *foundPtr = TRUE; 0.00 : 676040: c6 45 cf 01 movb $0x1,-0x31(%rbp) : : if (!valid) 0.00 : 676044: 0f 85 cd fd ff ff jne 675e17 : * in the page, or (b) a previous read attempt failed. We : * have to wait for any active read attempt to finish, and : * then set up our own read attempt if the page is still not : * BM_VALID. StartBufferIO does it all. : */ : if (StartBufferIO(foundbuf, true)) 0.00 : 67604a: be 01 00 00 00 mov $0x1,%esi 0.00 : 67604f: 4c 89 e7 mov %r12,%rdi 0.00 : 676052: e8 e9 e3 ff ff callq 674440 0.00 : 676057: 84 c0 test %al,%al 0.00 : 676059: 0f 84 b8 fd ff ff je 675e17 : { : /* : * If we get here, previous attempts to read the buffer : * must have failed ... but we shall bravely try again. : */ : *foundPtr = FALSE; 0.00 : 67605f: c6 45 cf 00 movb $0x0,-0x31(%rbp) 0.00 : 676063: e9 af fd ff ff jmpq 675e17 0.00 : 676068: 0f 1f 84 00 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 67606f: 00 : * (This has been observed to happen when two backends are both : * trying to split btree index pages, and the second one just : * happens to be trying to split the page the first one got from : * StrategyGetBuffer.) : */ : if (LWLockConditionalAcquire(buf->content_lock, LW_SHARED)) 0.00 : 676070: 49 8b 7e 38 mov 0x38(%r14),%rdi 0.00 : 676074: be 01 00 00 00 mov $0x1,%esi 0.00 : 676079: e8 22 8f 01 00 callq 68efa0 0.00 : 67607e: 84 c0 test %al,%al 0.00 : 676080: 0f 84 ee fe ff ff je 675f74 : * would require a WAL flush, let the strategy decide whether : * to go ahead and write/reuse the buffer or to choose another : * victim. We need lock to inspect the page LSN, so this : * can't be done inside StrategyGetBuffer. : */ : if (strategy != NULL) 0.00 : 676086: 4d 85 ff test %r15,%r15 0.00 : 676089: 74 4c je 6760d7 : { : XLogRecPtr lsn; : : /* Read the LSN while holding buffer header lock */ : LockBufHdr(buf); 0.00 : 67608b: 49 8d 7e 20 lea 0x20(%r14),%rdi 0.00 : 67608f: b8 01 00 00 00 mov $0x1,%eax 0.00 : 676094: f0 86 07 lock xchg %al,(%rdi) 0.00 : 676097: 84 c0 test %al,%al 0.00 : 676099: 0f 85 92 00 00 00 jne 676131 : lsn = BufferGetLSN(buf); 0.00 : 67609f: 41 8b 46 24 mov 0x24(%r14),%eax 0.00 : 6760a3: 41 8b 56 24 mov 0x24(%r14),%edx 0.00 : 6760a7: 48 8b 0d 4a 9a 54 00 mov 0x549a4a(%rip),%rcx # bbfaf8 0.00 : 6760ae: 48 98 cltq 0.00 : 6760b0: 48 63 d2 movslq %edx,%rdx 0.00 : 6760b3: 48 c1 e0 0d shl $0xd,%rax 0.00 : 6760b7: 48 c1 e2 0d shl $0xd,%rdx 0.00 : 6760bb: 8b 3c 01 mov (%rcx,%rax,1),%edi 0.00 : 6760be: 8b 44 11 04 mov 0x4(%rcx,%rdx,1),%eax 0.00 : 6760c2: 48 c1 e7 20 shl $0x20,%rdi 0.00 : 6760c6: 48 09 c7 or %rax,%rdi : UnlockBufHdr(buf); 0.00 : 6760c9: 41 c6 46 20 00 movb $0x0,0x20(%r14) : : if (XLogNeedsFlush(lsn) && 0.00 : 6760ce: e8 dd dc e5 ff callq 4d3db0 0.00 : 6760d3: 84 c0 test %al,%al 0.00 : 6760d5: 75 30 jne 676107 : TRACE_POSTGRESQL_BUFFER_WRITE_DIRTY_START(forkNum, blockNum, : smgr->smgr_rnode.node.spcNode, : smgr->smgr_rnode.node.dbNode, : smgr->smgr_rnode.node.relNode); : : FlushBuffer(buf, NULL); 0.00 : 6760d7: 4c 89 f7 mov %r14,%rdi 0.00 : 6760da: 31 f6 xor %esi,%esi 0.00 : 6760dc: e8 6f ee ff ff callq 674f50 : LWLockRelease(buf->content_lock); 0.00 : 6760e1: 49 8b 7e 38 mov 0x38(%r14),%rdi 0.00 : 6760e5: e8 b6 92 01 00 callq 68f3a0 0.00 : 6760ea: e9 b5 fe ff ff jmpq 675fa4 0.00 : 6760ef: 90 nop : } : : /* : * Need to lock the buffer header too in order to change its tag. : */ : LockBufHdr(buf); 0.00 : 6760f0: ba 0f 04 00 00 mov $0x40f,%edx 0.00 : 6760f5: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 6760fa: 48 89 df mov %rbx,%rdi 0.00 : 6760fd: e8 3e 9f 01 00 callq 690040 0.00 : 676102: e9 45 fe ff ff jmpq 675f4c : /* Read the LSN while holding buffer header lock */ : LockBufHdr(buf); : lsn = BufferGetLSN(buf); : UnlockBufHdr(buf); : : if (XLogNeedsFlush(lsn) && 0.00 : 676107: 4c 89 f6 mov %r14,%rsi 0.00 : 67610a: 4c 89 ff mov %r15,%rdi 0.00 : 67610d: e8 0e 11 00 00 callq 677220 0.00 : 676112: 84 c0 test %al,%al 0.00 : 676114: 74 c1 je 6760d7 : StrategyRejectBuffer(strategy, buf)) : { : /* Drop lock/pin and loop around for another buffer */ : LWLockRelease(buf->content_lock); 0.00 : 676116: 49 8b 7e 38 mov 0x38(%r14),%rdi 0.00 : 67611a: e8 81 92 01 00 callq 68f3a0 : UnpinBuffer(buf, true); 0.00 : 67611f: be 01 00 00 00 mov $0x1,%esi 0.00 : 676124: 4c 89 f7 mov %r14,%rdi 0.00 : 676127: e8 04 ec ff ff callq 674d30 0.00 : 67612c: e9 50 fe ff ff jmpq 675f81 : if (strategy != NULL) : { : XLogRecPtr lsn; : : /* Read the LSN while holding buffer header lock */ : LockBufHdr(buf); 0.00 : 676131: ba a0 03 00 00 mov $0x3a0,%edx 0.00 : 676136: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 67613b: e8 00 9f 01 00 callq 690040 0.00 : 676140: e9 5a ff ff ff jmpq 67609f : : if (isLocalBuf) : { : bufHdr = LocalBufferAlloc(smgr, forkNum, blockNum, &found); : if (found) : pgBufferUsage.local_blks_hit++; 0.00 : 676145: 48 83 05 33 96 54 00 addq $0x1,0x549633(%rip) # bbf780 0.00 : 67614c: 01 0.00 : 67614d: e9 e0 fb ff ff jmpq 675d32 : * Clearing BM_VALID here is necessary, clearing the dirtybits is just : * paranoia. We also reset the usage_count since any recency of use of : * the old content is no longer relevant. (The usage_count starts out at : * 1 so that the buffer can survive one clock-sweep pass.) : */ : buf->tag = newTag; 0.00 : 676152: 48 8b 45 b0 mov -0x50(%rbp),%rax 0.00 : 676156: 49 89 06 mov %rax,(%r14) 0.00 : 676159: 48 8b 45 b8 mov -0x48(%rbp),%rax 0.00 : 67615d: 49 89 46 08 mov %rax,0x8(%r14) 0.00 : 676161: 8b 45 c0 mov -0x40(%rbp),%eax 0.00 : 676164: 41 89 46 10 mov %eax,0x10(%r14) : buf->flags &= ~(BM_VALID | BM_DIRTY | BM_JUST_DIRTIED | BM_CHECKPOINT_NEEDED | BM_IO_ERROR | BM_PERMANENT); 0.00 : 676168: 41 0f b7 46 14 movzwl 0x14(%r14),%eax 0.00 : 67616d: 66 25 4c fe and $0xfe4c,%ax 0.00 : 676171: 66 41 89 46 14 mov %ax,0x14(%r14) : if (relpersistence == RELPERSISTENCE_PERMANENT) 0.00 : 676176: 80 bd 7f ff ff ff 70 cmpb $0x70,-0x81(%rbp) 0.00 : 67617d: 0f 84 73 02 00 00 je 6763f6 : buf->flags |= BM_TAG_VALID | BM_PERMANENT; : else : buf->flags |= BM_TAG_VALID; 0.00 : 676183: 41 0f b7 46 14 movzwl 0x14(%r14),%eax 0.00 : 676188: 83 c8 04 or $0x4,%eax 0.00 : 67618b: 66 41 89 46 14 mov %ax,0x14(%r14) : buf->usage_count = 1; 0.00 : 676190: 66 41 c7 46 16 01 00 movw $0x1,0x16(%r14) : : UnlockBufHdr(buf); : : if (oldFlags & BM_TAG_VALID) 0.00 : 676197: 83 e2 04 and $0x4,%edx : buf->flags |= BM_TAG_VALID | BM_PERMANENT; : else : buf->flags |= BM_TAG_VALID; : buf->usage_count = 1; : : UnlockBufHdr(buf); 0.00 : 67619a: 41 c6 46 20 00 movb $0x0,0x20(%r14) : : if (oldFlags & BM_TAG_VALID) 0.00 : 67619f: 0f 85 64 02 00 00 jne 676409 : /* : * Buffer contents are currently invalid. Try to get the io_in_progress : * lock. If StartBufferIO returns false, then someone else managed to : * read it before we did, so there's nothing left for BufferAlloc() to do. : */ : if (StartBufferIO(buf, true)) 0.00 : 6761a5: be 01 00 00 00 mov $0x1,%esi 0.00 : 6761aa: 4c 89 f7 mov %r14,%rdi 0.00 : 6761ad: e8 8e e2 ff ff callq 674440 0.00 : 6761b2: 84 c0 test %al,%al 0.00 : 6761b4: 0f 84 d5 00 00 00 je 67628f : *foundPtr = FALSE; 0.00 : 6761ba: c6 45 cf 00 movb $0x0,-0x31(%rbp) : bufHdr = BufferAlloc(smgr, relpersistence, forkNum, blockNum, : strategy, &found); : if (found) : pgBufferUsage.shared_blks_hit++; : else : pgBufferUsage.shared_blks_read++; 0.00 : 6761be: 48 83 05 a2 95 54 00 addq $0x1,0x5495a2(%rip) # bbf768 0.00 : 6761c5: 01 0.00 : 6761c6: e9 67 fb ff ff jmpq 675d32 : * it's not been recycled) but come right back here to try smgrextend : * again. : */ : Assert(!(bufHdr->flags & BM_VALID)); /* spinlock not needed */ : : bufBlock = isLocalBuf ? LocalBufHdrGetBlock(bufHdr) : BufHdrGetBlock(bufHdr); 0.00 : 6761cb: 41 8b 46 24 mov 0x24(%r14),%eax 0.00 : 6761cf: 4c 63 e0 movslq %eax,%r12 0.00 : 6761d2: 49 c1 e4 0d shl $0xd,%r12 0.00 : 6761d6: 4c 03 25 1b 99 54 00 add 0x54991b(%rip),%r12 # bbfaf8 : : if (isExtend) 0.00 : 6761dd: 80 7d 8e 00 cmpb $0x0,-0x72(%rbp) 0.00 : 6761e1: 0f 84 7c fc ff ff je 675e63 : { : /* new buffers are zero-filled */ : MemSet((char *) bufBlock, 0, BLCKSZ); 0.00 : 6761e7: 31 c0 xor %eax,%eax 0.00 : 6761e9: b9 00 04 00 00 mov $0x400,%ecx 0.00 : 6761ee: 4c 89 e7 mov %r12,%rdi 0.00 : 6761f1: f3 48 ab rep stos %rax,%es:(%rdi) : /* don't set checksum for all-zero page */ : smgrextend(smgr, forkNum, blockNum, (char *) bufBlock, false); 0.00 : 6761f4: 45 31 c0 xor %r8d,%r8d 0.00 : 6761f7: 4c 89 e1 mov %r12,%rcx 0.00 : 6761fa: 8b 95 74 ff ff ff mov -0x8c(%rbp),%edx 0.00 : 676200: 8b b5 78 ff ff ff mov -0x88(%rbp),%esi 0.00 : 676206: 48 8b 7d 80 mov -0x80(%rbp),%rdi 0.00 : 67620a: e8 c1 31 02 00 callq 6993d0 : relpath(smgr->smgr_rnode, forkNum)))); : } : } : } : : if (isLocalBuf) 0.00 : 67620f: 80 7d 8f 00 cmpb $0x0,-0x71(%rbp) 0.00 : 676213: 0f 85 e8 fc ff ff jne 675f01 : bufHdr->flags |= BM_VALID; : } : else : { : /* Set BM_VALID, terminate IO, and wake up any waiters */ : TerminateBufferIO(bufHdr, false, BM_VALID); 0.00 : 676219: ba 02 00 00 00 mov $0x2,%edx 0.00 : 67621e: 31 f6 xor %esi,%esi 0.00 : 676220: 4c 89 f7 mov %r14,%rdi 0.00 : 676223: e8 a8 df ff ff callq 6741d0 0.00 : 676228: e9 e1 fc ff ff jmpq 675f0e : smgr->smgr_rnode.backend, : isExtend); : : /* Substitute proper block number if caller asked for P_NEW */ : if (isExtend) : blockNum = smgrnblocks(smgr, forkNum); 0.00 : 67622d: 8b b5 78 ff ff ff mov -0x88(%rbp),%esi 0.00 : 676233: 48 8b 7d 80 mov -0x80(%rbp),%rdi 0.00 : 676237: e8 14 32 02 00 callq 699450 0.00 : 67623c: 89 85 74 ff ff ff mov %eax,-0x8c(%rbp) 0.00 : 676242: e9 b7 fa ff ff jmpq 675cfe : * lseek(SEEK_END) result that doesn't account for a recent write. In : * that situation, the pre-existing buffer would contain valid data : * that we don't want to overwrite. Since the legitimate case should : * always have left a zero-filled buffer, complain if not PageIsNew. : */ : bufBlock = isLocalBuf ? LocalBufHdrGetBlock(bufHdr) : BufHdrGetBlock(bufHdr); 0.00 : 676247: 80 7d 8f 00 cmpb $0x0,-0x71(%rbp) 0.00 : 67624b: 0f 85 8c 00 00 00 jne 6762dd 0.00 : 676251: 41 8b 46 24 mov 0x24(%r14),%eax 0.00 : 676255: 48 98 cltq 0.00 : 676257: 48 c1 e0 0d shl $0xd,%rax 0.00 : 67625b: 48 03 05 96 98 54 00 add 0x549896(%rip),%rax # bbfaf8 : if (!PageIsNew((Page) bufBlock)) 0.00 : 676262: 66 83 78 0e 00 cmpw $0x0,0xe(%rax) 0.00 : 676267: 0f 85 19 02 00 00 jne 676486 : * We *must* do smgrextend before succeeding, else the page will not : * be reserved by the kernel, and the next P_NEW call will decide to : * return the same page. Clear the BM_VALID bit, do the StartBufferIO : * call that BufferAlloc didn't, and proceed. : */ : if (isLocalBuf) 0.00 : 67626d: 80 7d 8f 00 cmpb $0x0,-0x71(%rbp) 0.00 : 676271: 49 8d 5e 20 lea 0x20(%r14),%rbx 0.00 : 676275: 41 bc 01 00 00 00 mov $0x1,%r12d 0.00 : 67627b: 74 54 je 6762d1 : { : /* Only need to adjust flags */ : Assert(bufHdr->flags & BM_VALID); : bufHdr->flags &= ~BM_VALID; 0.00 : 67627d: 41 0f b7 46 14 movzwl 0x14(%r14),%eax 0.00 : 676282: 83 e0 fd and $0xfffffffd,%eax 0.00 : 676285: 66 41 89 46 14 mov %ax,0x14(%r14) 0.00 : 67628a: e9 b1 fb ff ff jmpq 675e40 : * read it before we did, so there's nothing left for BufferAlloc() to do. : */ : if (StartBufferIO(buf, true)) : *foundPtr = FALSE; : else : *foundPtr = TRUE; 0.00 : 67628f: c6 45 cf 01 movb $0x1,-0x31(%rbp) 0.00 : 676293: e9 8c fb ff ff jmpq 675e24 : * BM_VALID between our clearing it and StartBufferIO inspecting : * it. : */ : do : { : LockBufHdr(bufHdr); 0.00 : 676298: ba ae 02 00 00 mov $0x2ae,%edx 0.00 : 67629d: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 6762a2: 48 89 df mov %rbx,%rdi 0.00 : 6762a5: e8 96 9d 01 00 callq 690040 : Assert(bufHdr->flags & BM_VALID); : bufHdr->flags &= ~BM_VALID; 0.00 : 6762aa: 41 0f b7 46 14 movzwl 0x14(%r14),%eax 0.00 : 6762af: 83 e0 fd and $0xfffffffd,%eax 0.00 : 6762b2: 66 41 89 46 14 mov %ax,0x14(%r14) : UnlockBufHdr(bufHdr); : } while (!StartBufferIO(bufHdr, true)); 0.00 : 6762b7: be 01 00 00 00 mov $0x1,%esi : do : { : LockBufHdr(bufHdr); : Assert(bufHdr->flags & BM_VALID); : bufHdr->flags &= ~BM_VALID; : UnlockBufHdr(bufHdr); 0.00 : 6762bc: 41 c6 46 20 00 movb $0x0,0x20(%r14) : } while (!StartBufferIO(bufHdr, true)); 0.00 : 6762c1: 4c 89 f7 mov %r14,%rdi 0.00 : 6762c4: e8 77 e1 ff ff callq 674440 0.00 : 6762c9: 84 c0 test %al,%al 0.00 : 6762cb: 0f 85 fa fe ff ff jne 6761cb 0.00 : 6762d1: 44 89 e0 mov %r12d,%eax 0.00 : 6762d4: f0 86 03 lock xchg %al,(%rbx) : * BM_VALID between our clearing it and StartBufferIO inspecting : * it. : */ : do : { : LockBufHdr(bufHdr); 0.00 : 6762d7: 84 c0 test %al,%al 0.00 : 6762d9: 74 cf je 6762aa 0.00 : 6762db: eb bb jmp 676298 : * lseek(SEEK_END) result that doesn't account for a recent write. In : * that situation, the pre-existing buffer would contain valid data : * that we don't want to overwrite. Since the legitimate case should : * always have left a zero-filled buffer, complain if not PageIsNew. : */ : bufBlock = isLocalBuf ? LocalBufHdrGetBlock(bufHdr) : BufHdrGetBlock(bufHdr); 0.00 : 6762dd: 41 8b 46 24 mov 0x24(%r14),%eax 0.00 : 6762e1: ba fe ff ff ff mov $0xfffffffe,%edx 0.00 : 6762e6: 29 c2 sub %eax,%edx 0.00 : 6762e8: 48 8b 05 29 6e 50 00 mov 0x506e29(%rip),%rax # b7d118 0.00 : 6762ef: 48 63 d2 movslq %edx,%rdx 0.00 : 6762f2: 48 8b 04 d0 mov (%rax,%rdx,8),%rax 0.00 : 6762f6: e9 67 ff ff ff jmpq 676262 : /* check for garbage data */ : if (!PageIsVerified((Page) bufBlock, blockNum)) : { : if (mode == RBM_ZERO_ON_ERROR || zero_damaged_pages) : { : ereport(WARNING, 0.00 : 6762fb: 48 8b 55 80 mov -0x80(%rbp),%rdx 0.00 : 6762ff: 44 8b 85 78 ff ff ff mov -0x88(%rbp),%r8d 0.00 : 676306: 48 89 d0 mov %rdx,%rax 0.00 : 676309: 8b 4a 0c mov 0xc(%rdx),%ecx 0.00 : 67630c: 8b 52 08 mov 0x8(%rdx),%edx 0.00 : 67630f: 8b 78 04 mov 0x4(%rax),%edi 0.00 : 676312: 8b 30 mov (%rax),%esi 0.00 : 676314: e8 b7 82 13 00 callq 7ae5d0 0.00 : 676319: 8b b5 74 ff ff ff mov -0x8c(%rbp),%esi 0.00 : 67631f: 48 89 c2 mov %rax,%rdx 0.00 : 676322: bf c8 9e 8a 00 mov $0x8a9ec8,%edi 0.00 : 676327: 31 c0 xor %eax,%eax 0.00 : 676329: e8 72 65 10 00 callq 77c8a0 0.00 : 67632e: bf 28 0a 00 01 mov $0x1000a28,%edi 0.00 : 676333: 89 c3 mov %eax,%ebx 0.00 : 676335: e8 16 6a 10 00 callq 77cd50 0.00 : 67633a: 89 de mov %ebx,%esi 0.00 : 67633c: 89 c7 mov %eax,%edi 0.00 : 67633e: 31 c0 xor %eax,%eax 0.00 : 676340: e8 9b 42 10 00 callq 77a5e0 0.00 : 676345: e9 a0 fb ff ff jmpq 675eea : { : instr_time io_start, : io_time; : : if (track_io_timing) : INSTR_TIME_SET_CURRENT(io_start); 0.00 : 67634a: 48 8d 7d 90 lea -0x70(%rbp),%rdi 0.00 : 67634e: 31 f6 xor %esi,%esi 0.00 : 676350: e8 6b 32 df ff callq 4695c0 0.00 : 676355: e9 1f fb ff ff jmpq 675e79 : : smgrread(smgr, forkNum, blockNum, (char *) bufBlock); : : if (track_io_timing) : { : INSTR_TIME_SET_CURRENT(io_time); 0.00 : 67635a: 48 8d 7d b0 lea -0x50(%rbp),%rdi 0.00 : 67635e: 31 f6 xor %esi,%esi 0.00 : 676360: e8 5b 32 df ff callq 4695c0 : INSTR_TIME_SUBTRACT(io_time, io_start); 0.00 : 676365: 48 8b 55 b8 mov -0x48(%rbp),%rdx 0.00 : 676369: 48 2b 55 98 sub -0x68(%rbp),%rdx 0.00 : 67636d: 48 8b 45 b0 mov -0x50(%rbp),%rax 0.00 : 676371: 48 2b 45 90 sub -0x70(%rbp),%rax 0.00 : 676375: 48 85 d2 test %rdx,%rdx 0.00 : 676378: 48 89 55 b8 mov %rdx,-0x48(%rbp) 0.00 : 67637c: 48 89 c1 mov %rax,%rcx 0.00 : 67637f: 48 89 45 b0 mov %rax,-0x50(%rbp) 0.00 : 676383: 79 18 jns 67639d : */ : static Buffer : ReadBuffer_common(SMgrRelation smgr, char relpersistence, ForkNumber forkNum, : BlockNumber blockNum, ReadBufferMode mode, : BufferAccessStrategy strategy, bool *hit) : { 0.00 : 676385: 48 83 e8 01 sub $0x1,%rax : smgrread(smgr, forkNum, blockNum, (char *) bufBlock); : : if (track_io_timing) : { : INSTR_TIME_SET_CURRENT(io_time); : INSTR_TIME_SUBTRACT(io_time, io_start); 0.00 : 676389: 48 81 c2 40 42 0f 00 add $0xf4240,%rdx 0.00 : 676390: 78 f3 js 676385 0.00 : 676392: 48 89 45 b0 mov %rax,-0x50(%rbp) 0.00 : 676396: 48 89 55 b8 mov %rdx,-0x48(%rbp) 0.00 : 67639a: 48 89 c1 mov %rax,%rcx : pgstat_count_buffer_read_time(INSTR_TIME_GET_MICROSEC(io_time)); 0.00 : 67639d: 48 69 c1 40 42 0f 00 imul $0xf4240,%rcx,%rax : INSTR_TIME_ADD(pgBufferUsage.blk_read_time, io_time); 0.00 : 6763a4: 48 01 0d 05 94 54 00 add %rcx,0x549405(%rip) # bbf7b0 : : if (track_io_timing) : { : INSTR_TIME_SET_CURRENT(io_time); : INSTR_TIME_SUBTRACT(io_time, io_start); : pgstat_count_buffer_read_time(INSTR_TIME_GET_MICROSEC(io_time)); 0.00 : 6763ab: 48 8d 04 02 lea (%rdx,%rax,1),%rax 0.00 : 6763af: 48 01 05 0a 58 50 00 add %rax,0x50580a(%rip) # b7bbc0 : INSTR_TIME_ADD(pgBufferUsage.blk_read_time, io_time); 0.00 : 6763b6: 48 8b 05 fb 93 54 00 mov 0x5493fb(%rip),%rax # bbf7b8 0.00 : 6763bd: 48 03 45 b8 add -0x48(%rbp),%rax 0.00 : 6763c1: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 6763c7: 48 89 05 ea 93 54 00 mov %rax,0x5493ea(%rip) # bbf7b8 0.00 : 6763ce: 0f 8e ca fa ff ff jle 675e9e 0.00 : 6763d4: 48 2d 40 42 0f 00 sub $0xf4240,%rax 0.00 : 6763da: 48 83 05 ce 93 54 00 addq $0x1,0x5493ce(%rip) # bbf7b0 0.00 : 6763e1: 01 0.00 : 6763e2: 48 3d 3f 42 0f 00 cmp $0xf423f,%rax 0.00 : 6763e8: 48 89 05 c9 93 54 00 mov %rax,0x5493c9(%rip) # bbf7b8 0.00 : 6763ef: 7f e3 jg 6763d4 0.00 : 6763f1: e9 a8 fa ff ff jmpq 675e9e : * 1 so that the buffer can survive one clock-sweep pass.) : */ : buf->tag = newTag; : buf->flags &= ~(BM_VALID | BM_DIRTY | BM_JUST_DIRTIED | BM_CHECKPOINT_NEEDED | BM_IO_ERROR | BM_PERMANENT); : if (relpersistence == RELPERSISTENCE_PERMANENT) : buf->flags |= BM_TAG_VALID | BM_PERMANENT; 0.00 : 6763f6: 41 0f b7 46 14 movzwl 0x14(%r14),%eax 0.00 : 6763fb: 66 0d 04 01 or $0x104,%ax 0.00 : 6763ff: 66 41 89 46 14 mov %ax,0x14(%r14) 0.00 : 676404: e9 87 fd ff ff jmpq 676190 : buf->usage_count = 1; : : UnlockBufHdr(buf); : : if (oldFlags & BM_TAG_VALID) : BufTableDelete(&oldTag); 0.00 : 676409: 48 8d 7d 90 lea -0x70(%rbp),%rdi 0.00 : 67640d: e8 3e d9 ff ff callq 673d50 0.00 : 676412: e9 8e fd ff ff jmpq 6761a5 : blockNum, : relpath(smgr->smgr_rnode, forkNum)))); : MemSet((char *) bufBlock, 0, BLCKSZ); : } : else : ereport(ERROR, 0.00 : 676417: 45 31 c0 xor %r8d,%r8d 0.00 : 67641a: b9 a0 a0 8a 00 mov $0x8aa0a0,%ecx 0.00 : 67641f: ba f8 02 00 00 mov $0x2f8,%edx 0.00 : 676424: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 676429: bf 14 00 00 00 mov $0x14,%edi 0.00 : 67642e: e8 8d 46 10 00 callq 77aac0 0.00 : 676433: 84 c0 test %al,%al 0.00 : 676435: 74 4a je 676481 0.00 : 676437: 48 8b 55 80 mov -0x80(%rbp),%rdx 0.00 : 67643b: 44 8b 85 78 ff ff ff mov -0x88(%rbp),%r8d 0.00 : 676442: 48 89 d0 mov %rdx,%rax 0.00 : 676445: 8b 4a 0c mov 0xc(%rdx),%ecx 0.00 : 676448: 8b 52 08 mov 0x8(%rdx),%edx 0.00 : 67644b: 8b 78 04 mov 0x4(%rax),%edi 0.00 : 67644e: 8b 30 mov (%rax),%esi 0.00 : 676450: e8 7b 81 13 00 callq 7ae5d0 0.00 : 676455: 8b b5 74 ff ff ff mov -0x8c(%rbp),%esi 0.00 : 67645b: 48 89 c2 mov %rax,%rdx 0.00 : 67645e: bf 48 28 88 00 mov $0x882848,%edi 0.00 : 676463: 31 c0 xor %eax,%eax 0.00 : 676465: e8 36 64 10 00 callq 77c8a0 0.00 : 67646a: bf 28 0a 00 01 mov $0x1000a28,%edi 0.00 : 67646f: 89 c3 mov %eax,%ebx 0.00 : 676471: e8 da 68 10 00 callq 77cd50 0.00 : 676476: 89 de mov %ebx,%esi 0.00 : 676478: 89 c7 mov %eax,%edi 0.00 : 67647a: 31 c0 xor %eax,%eax 0.00 : 67647c: e8 5f 41 10 00 callq 77a5e0 0.00 : 676481: e8 4a 30 df ff callq 4694d0 : * that we don't want to overwrite. Since the legitimate case should : * always have left a zero-filled buffer, complain if not PageIsNew. : */ : bufBlock = isLocalBuf ? LocalBufHdrGetBlock(bufHdr) : BufHdrGetBlock(bufHdr); : if (!PageIsNew((Page) bufBlock)) : ereport(ERROR, 0.00 : 676486: 45 31 c0 xor %r8d,%r8d 0.00 : 676489: b9 a0 a0 8a 00 mov $0x8aa0a0,%ecx 0.00 : 67648e: ba 97 02 00 00 mov $0x297,%edx 0.00 : 676493: be 53 9d 8a 00 mov $0x8a9d53,%esi 0.00 : 676498: bf 14 00 00 00 mov $0x14,%edi 0.00 : 67649d: e8 1e 46 10 00 callq 77aac0 0.00 : 6764a2: 84 c0 test %al,%al 0.00 : 6764a4: 74 db je 676481 0.00 : 6764a6: bf 40 9e 8a 00 mov $0x8a9e40,%edi 0.00 : 6764ab: 31 c0 xor %eax,%eax 0.00 : 6764ad: e8 ee 57 10 00 callq 77bca0 0.00 : 6764b2: 48 8b 55 80 mov -0x80(%rbp),%rdx 0.00 : 6764b6: 89 c3 mov %eax,%ebx 0.00 : 6764b8: 44 8b 85 78 ff ff ff mov -0x88(%rbp),%r8d 0.00 : 6764bf: 48 89 d0 mov %rdx,%rax 0.00 : 6764c2: 8b 4a 0c mov 0xc(%rdx),%ecx 0.00 : 6764c5: 8b 52 08 mov 0x8(%rdx),%edx 0.00 : 6764c8: 8b 78 04 mov 0x4(%rax),%edi 0.00 : 6764cb: 8b 30 mov (%rax),%esi 0.00 : 6764cd: e8 fe 80 13 00 callq 7ae5d0 0.00 : 6764d2: 8b b5 74 ff ff ff mov -0x8c(%rbp),%esi 0.00 : 6764d8: 48 89 c2 mov %rax,%rdx 0.00 : 6764db: bf 90 9e 8a 00 mov $0x8a9e90,%edi 0.00 : 6764e0: 31 c0 xor %eax,%eax 0.00 : 6764e2: e8 b9 63 10 00 callq 77c8a0 0.00 : 6764e7: 89 de mov %ebx,%esi 0.00 : 6764e9: 89 c7 mov %eax,%edi 0.00 : 6764eb: 31 c0 xor %eax,%eax 0.00 : 6764ed: e8 ee 40 10 00 callq 77a5e0 0.00 : 6764f2: eb 8d jmp 676481 Sorted summary for file /home/Computational/mark/andres/bin/postgres ---------------------------------------------- 100.00 /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1423 Percent | Source code & Disassembly of /home/Computational/mark/andres/bin/postgres ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000007a5600 : : * by this function. This is OK for current uses, because we actually only : * apply this for known-committed XIDs. : */ : static bool : XidInMVCCSnapshot(TransactionId xid, Snapshot snapshot) : { 0.00 : 7a5600: 55 push %rbp /home/Computational/mark/src/postgres-andres/src/backend/utils/time/tqual.c:1423 100.00 : 7a5601: 48 89 e5 mov %rsp,%rbp 0.00 : 7a5604: 41 54 push %r12 0.00 : 7a5606: 49 89 f4 mov %rsi,%r12 0.00 : 7a5609: 53 push %rbx : * a parent with XID < xmin, while one with XID >= xmax must belong to a : * parent that was not yet committed at the time of this snapshot. : */ : : /* Any xid < xmin is not in-progress */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) 0.00 : 7a560a: 8b 76 08 mov 0x8(%rsi),%esi : * by this function. This is OK for current uses, because we actually only : * apply this for known-committed XIDs. : */ : static bool : XidInMVCCSnapshot(TransactionId xid, Snapshot snapshot) : { 0.00 : 7a560d: 89 fb mov %edi,%ebx : * a parent with XID < xmin, while one with XID >= xmax must belong to a : * parent that was not yet committed at the time of this snapshot. : */ : : /* Any xid < xmin is not in-progress */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) 0.00 : 7a560f: e8 cc a9 d1 ff callq 4bffe0 0.00 : 7a5614: 84 c0 test %al,%al 0.00 : 7a5616: 74 08 je 7a5620 : return true; : } : } : : return false; : } 0.00 : 7a5618: 5b pop %rbx : /* : * We now have either a top-level xid higher than xmin or an : * indeterminate xid. We don't know whether it's top level or subxact : * but it doesn't matter. If it's present, the xid is visible. : */ : for (j = 0; j < snapshot->subxcnt; j++) 0.00 : 7a5619: 31 c0 xor %eax,%eax : return true; : } : } : : return false; : } 0.00 : 7a561b: 41 5c pop %r12 0.00 : 7a561d: c9 leaveq 0.00 : 7a561e: c3 retq 0.00 : 7a561f: 90 nop : : /* Any xid < xmin is not in-progress */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) : return false; : /* Any xid >= xmax is in-progress */ : if (TransactionIdFollowsOrEquals(xid, snapshot->xmax)) 0.00 : 7a5620: 41 8b 74 24 0c mov 0xc(%r12),%esi 0.00 : 7a5625: 89 df mov %ebx,%edi 0.00 : 7a5627: e8 44 aa d1 ff callq 4c0070 0.00 : 7a562c: 84 c0 test %al,%al 0.00 : 7a562e: 0f 85 7c 00 00 00 jne 7a56b0 : : /* : * Snapshot information is stored slightly differently in snapshots taken : * during recovery. : */ : if (!snapshot->takenDuringRecovery) 0.00 : 7a5634: 41 80 7c 24 29 00 cmpb $0x0,0x29(%r12) 0.00 : 7a563a: 0f 85 80 00 00 00 jne 7a56c0 : * check things is just to compare the given XID against both subxact : * XIDs and top-level XIDs. If the snapshot overflowed, we have to : * use pg_subtrans to convert a subxact XID to its parent XID, but : * then we need only look at top-level XIDs not subxacts. : */ : if (!snapshot->suboverflowed) 0.00 : 7a5640: 41 80 7c 24 28 00 cmpb $0x0,0x28(%r12) 0.00 : 7a5646: 0f 85 b4 00 00 00 jne 7a5700 : { : /* full data, so search subxip */ : int32 j; : : for (j = 0; j < snapshot->subxcnt; j++) 0.00 : 7a564c: 41 8b 74 24 1c mov 0x1c(%r12),%esi 0.00 : 7a5651: 85 f6 test %esi,%esi 0.00 : 7a5653: 7e 25 jle 7a567a : { : if (TransactionIdEquals(xid, snapshot->subxip[j])) 0.00 : 7a5655: 49 8b 44 24 20 mov 0x20(%r12),%rax 0.00 : 7a565a: 31 d2 xor %edx,%edx 0.00 : 7a565c: 39 18 cmp %ebx,(%rax) 0.00 : 7a565e: 48 89 c1 mov %rax,%rcx 0.00 : 7a5661: 75 10 jne 7a5673 0.00 : 7a5663: eb 4b jmp 7a56b0 0.00 : 7a5665: 0f 1f 00 nopl (%rax) 0.00 : 7a5668: 8b 41 04 mov 0x4(%rcx),%eax 0.00 : 7a566b: 48 83 c1 04 add $0x4,%rcx 0.00 : 7a566f: 39 d8 cmp %ebx,%eax 0.00 : 7a5671: 74 3d je 7a56b0 : if (!snapshot->suboverflowed) : { : /* full data, so search subxip */ : int32 j; : : for (j = 0; j < snapshot->subxcnt; j++) 0.00 : 7a5673: 83 c2 01 add $0x1,%edx 0.00 : 7a5676: 39 f2 cmp %esi,%edx 0.00 : 7a5678: 7c ee jl 7a5668 : */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) : return false; : } : : for (i = 0; i < snapshot->xcnt; i++) 0.00 : 7a567a: 41 8b 74 24 18 mov 0x18(%r12),%esi 0.00 : 7a567f: 85 f6 test %esi,%esi 0.00 : 7a5681: 74 95 je 7a5618 : { : if (TransactionIdEquals(xid, snapshot->xip[i])) 0.00 : 7a5683: 49 8b 44 24 10 mov 0x10(%r12),%rax 0.00 : 7a5688: 31 d2 xor %edx,%edx 0.00 : 7a568a: 39 18 cmp %ebx,(%rax) 0.00 : 7a568c: 48 89 c1 mov %rax,%rcx 0.00 : 7a568f: 75 12 jne 7a56a3 0.00 : 7a5691: eb 1d jmp 7a56b0 0.00 : 7a5693: 0f 1f 44 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 7a5698: 8b 41 04 mov 0x4(%rcx),%eax 0.00 : 7a569b: 48 83 c1 04 add $0x4,%rcx 0.00 : 7a569f: 39 d8 cmp %ebx,%eax 0.00 : 7a56a1: 74 0d je 7a56b0 : */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) : return false; : } : : for (i = 0; i < snapshot->xcnt; i++) 0.00 : 7a56a3: 83 c2 01 add $0x1,%edx 0.00 : 7a56a6: 39 f2 cmp %esi,%edx 0.00 : 7a56a8: 72 ee jb 7a5698 0.00 : 7a56aa: e9 69 ff ff ff jmpq 7a5618 0.00 : 7a56af: 90 nop : return true; : } : } : : return false; : } 0.00 : 7a56b0: 5b pop %rbx : /* : * We now have either a top-level xid higher than xmin or an : * indeterminate xid. We don't know whether it's top level or subxact : * but it doesn't matter. If it's present, the xid is visible. : */ : for (j = 0; j < snapshot->subxcnt; j++) 0.00 : 7a56b1: b8 01 00 00 00 mov $0x1,%eax : return true; : } : } : : return false; : } 0.00 : 7a56b6: 41 5c pop %r12 0.00 : 7a56b8: c9 leaveq 0.00 : 7a56b9: c3 retq 0.00 : 7a56ba: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * far the bigger array, and we mostly don't know which xids are : * top-level and which are subxacts. The xip array is empty. : * : * We start by searching subtrans, if we overflowed. : */ : if (snapshot->suboverflowed) 0.00 : 7a56c0: 41 80 7c 24 28 00 cmpb $0x0,0x28(%r12) 0.00 : 7a56c6: 75 60 jne 7a5728 : /* : * We now have either a top-level xid higher than xmin or an : * indeterminate xid. We don't know whether it's top level or subxact : * but it doesn't matter. If it's present, the xid is visible. : */ : for (j = 0; j < snapshot->subxcnt; j++) 0.00 : 7a56c8: 41 8b 74 24 1c mov 0x1c(%r12),%esi 0.00 : 7a56cd: 85 f6 test %esi,%esi 0.00 : 7a56cf: 0f 8e 43 ff ff ff jle 7a5618 : { : if (TransactionIdEquals(xid, snapshot->subxip[j])) 0.00 : 7a56d5: 49 8b 44 24 20 mov 0x20(%r12),%rax 0.00 : 7a56da: 31 d2 xor %edx,%edx 0.00 : 7a56dc: 39 18 cmp %ebx,(%rax) 0.00 : 7a56de: 48 89 c1 mov %rax,%rcx 0.00 : 7a56e1: 75 10 jne 7a56f3 0.00 : 7a56e3: eb cb jmp 7a56b0 0.00 : 7a56e5: 0f 1f 00 nopl (%rax) 0.00 : 7a56e8: 8b 41 04 mov 0x4(%rcx),%eax 0.00 : 7a56eb: 48 83 c1 04 add $0x4,%rcx 0.00 : 7a56ef: 39 d8 cmp %ebx,%eax 0.00 : 7a56f1: 74 bd je 7a56b0 : /* : * We now have either a top-level xid higher than xmin or an : * indeterminate xid. We don't know whether it's top level or subxact : * but it doesn't matter. If it's present, the xid is visible. : */ : for (j = 0; j < snapshot->subxcnt; j++) 0.00 : 7a56f3: 83 c2 01 add $0x1,%edx 0.00 : 7a56f6: 39 f2 cmp %esi,%edx 0.00 : 7a56f8: 7c ee jl 7a56e8 0.00 : 7a56fa: e9 19 ff ff ff jmpq 7a5618 0.00 : 7a56ff: 90 nop : /* not there, fall through to search xip[] */ : } : else : { : /* overflowed, so convert xid to top-level */ : xid = SubTransGetTopmostTransaction(xid); 0.00 : 7a5700: 89 df mov %ebx,%edi 0.00 : 7a5702: e8 e9 11 d2 ff callq 4c68f0 : /* : * If xid was indeed a subxact, we might now have an xid < xmin, : * so recheck to avoid an array scan. No point in rechecking : * xmax. : */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) 0.00 : 7a5707: 41 8b 74 24 08 mov 0x8(%r12),%esi 0.00 : 7a570c: 89 c7 mov %eax,%edi : /* not there, fall through to search xip[] */ : } : else : { : /* overflowed, so convert xid to top-level */ : xid = SubTransGetTopmostTransaction(xid); 0.00 : 7a570e: 89 c3 mov %eax,%ebx : /* : * If xid was indeed a subxact, we might now have an xid < xmin, : * so recheck to avoid an array scan. No point in rechecking : * xmax. : */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) 0.00 : 7a5710: e8 cb a8 d1 ff callq 4bffe0 0.00 : 7a5715: 84 c0 test %al,%al 0.00 : 7a5717: 0f 84 5d ff ff ff je 7a567a 0.00 : 7a571d: e9 f6 fe ff ff jmpq 7a5618 0.00 : 7a5722: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) : * We start by searching subtrans, if we overflowed. : */ : if (snapshot->suboverflowed) : { : /* overflowed, so convert xid to top-level */ : xid = SubTransGetTopmostTransaction(xid); 0.00 : 7a5728: 89 df mov %ebx,%edi 0.00 : 7a572a: 66 0f 1f 44 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 7a5730: e8 bb 11 d2 ff callq 4c68f0 : /* : * If xid was indeed a subxact, we might now have an xid < xmin, : * so recheck to avoid an array scan. No point in rechecking : * xmax. : */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) 0.00 : 7a5735: 41 8b 74 24 08 mov 0x8(%r12),%esi 0.00 : 7a573a: 89 c7 mov %eax,%edi : * We start by searching subtrans, if we overflowed. : */ : if (snapshot->suboverflowed) : { : /* overflowed, so convert xid to top-level */ : xid = SubTransGetTopmostTransaction(xid); 0.00 : 7a573c: 89 c3 mov %eax,%ebx : /* : * If xid was indeed a subxact, we might now have an xid < xmin, : * so recheck to avoid an array scan. No point in rechecking : * xmax. : */ : if (TransactionIdPrecedes(xid, snapshot->xmin)) 0.00 : 7a573e: e8 9d a8 d1 ff callq 4bffe0 0.00 : 7a5743: 84 c0 test %al,%al 0.00 : 7a5745: 74 81 je 7a56c8 0.00 : 7a5747: e9 cc fe ff ff jmpq 7a5618 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: : : 0000000000084750 : 100.00 : 84750: 48 83 fa 20 cmp $0x20,%rdx 0.00 : 84754: 48 89 f8 mov %rdi,%rax 0.00 : 84757: 73 77 jae 847d0 0.00 : 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) 0.00 : 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) 0.00 : 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 0.00 : 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 ---------------------------------------------- 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 ---------------------------------------------- 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/nf_conntrack.ko ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/net/netfilter/nf_conntrack.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000000022b0 : 0.00 : 22b0: 48 81 ec b8 00 00 00 sub $0xb8,%rsp 0.00 : 22e7: 4c 89 add %al,(%rax) 0.00 : 22e9: a4 24 mov %esi,%edx 0.00 : 22eb: 98 00 00 00 4c 89 ac mov %r15,0xb0(%rsp) 0.00 : 22f2: 24 0.00 : 22f3: a0 00 00 00 45 mov %rdi,0x20(%rsp) 0.00 : 22f8: 31 ed 89 54 24 1c 48 mov 0x88(%rcx),%rdi 0.00 : 22ff: 89 9c 24 test %rdi,%rdi 0.00 : 2302: 88 00 je 231f 0.00 : 2304: 00 00 49 89 mov 0x78(%rdi),%rax 0.00 : 2308: cc 48 89 mov %rdi,%r13 0.00 : 230b: ac 24 90 test $0x8,%ah 0.00 : 230e: 00 00 00 4c 89 b4 je 2440 0.00 : 2314: 24 a8 00 00 00 89 f2 movq $0x0,0x88(%rcx) 0.00 : 231b: 4c 89 bc 24 0.00 : 231f: b0 00 00 00 movzbl %dl,%r15d 0.00 : 2323: 48 89 7c 24 20 48 8b mov $0x0,%r14 0.00 : 232a: b9 88 00 00 00 cmp $0x26,%r15w 0.00 : 232f: 48 85 ff 74 1b 48 jbe 2410 0.00 : 2335: 8b 47 78 49 89 fd f6 mov 0xc4(%r12),%esi 0.00 : 233c: c4 0.00 : 233d: 08 0f 84 2c 01 lea 0x7f(%rsp),%rcx 0.00 : 2342: 00 00 48 c7 81 lea 0x74(%rsp),%rdx 0.00 : 2347: 88 00 00 00 00 00 00 add 0xd8(%r12),%rsi 0.00 : 234e: 00 0.00 : 234f: 44 0f b6 mov %r12,%rdi 0.00 : 2352: fa 49 c7 c6 00 00 00 sub 0xe0(%r12),%esi 0.00 : 2359: 00 0.00 : 235a: 66 41 83 ff callq *0x28(%r14) 0.00 : 235e: 26 0f test %eax,%eax 0.00 : 2360: 86 db mov %eax,%ebx 0.00 : 2362: 00 00 00 41 8b b4 jle 2468 0.00 : 2368: 24 c4 00 00 00 movzbl 0x7f(%rsp),%esi 0.00 : 236d: 48 8d 4c mov %r15d,%edi 0.00 : 2370: 24 7f 48 8d 54 callq 2375 0.00 : 2375: 24 74 49 03 b4 mov %rax,0x28(%rsp) 0.00 : 237a: 24 d8 00 00 mov 0x30(%rax),%rax 0.00 : 237e: 00 4c 89 test %rax,%rax 0.00 : 2381: e7 41 2b b4 24 e0 je 24b8 0.00 : 2387: 00 00 00 41 mov 0x1c(%rsp),%edx 0.00 : 238b: ff 56 28 85 mov 0x74(%rsp),%ecx 0.00 : 238f: c0 89 c3 mov %r15d,%r9d 0.00 : 2392: 0f 8e 00 01 00 lea 0x78(%rsp),%r8 0.00 : 2397: 00 0f b6 mov %r13,%rsi 0.00 : 239a: 74 24 7f 44 89 mov 0x20(%rsp),%rdi 0.00 : 239f: ff e8 00 mov %edx,(%rsp) 0.00 : 23a2: 00 00 00 mov %r12,%rdx 0.00 : 23a5: 48 89 callq *%rax 0.00 : 23a7: 44 24 test %eax,%eax 0.00 : 23a9: 28 48 mov %eax,%ebp 0.00 : 23ab: 8b 40 30 48 85 c0 jle 2590 0.00 : 23b1: 0f 84 31 01 00 00 8b cmpq $0x0,0x88(%r12) 0.00 : 23b8: 54 24 0.00 : 23ba: 1c 8b mov %eax,%ebx 0.00 : 23bc: 4c 24 74 45 89 f9 je 24b8 0.00 : 23c2: 4c 8d 44 test %r13,%r13 0.00 : 23c5: 24 78 je 23d4 0.00 : 23c7: 4c 89 ee cmp $0x4,%ebp 0.00 : 23ca: 48 8b jne 2428 0.00 : 23cc: 7c 24 20 89 14 24 4c mov %r13,0x88(%r12) 0.00 : 23d3: 89 0.00 : 23d4: e2 ff mov %ebx,%eax 0.00 : 23d6: d0 85 c0 89 c5 0f 8e mov 0x90(%rsp),%rbp 0.00 : 23dd: df 0.00 : 23de: 01 00 00 49 83 bc 24 mov 0x88(%rsp),%rbx 0.00 : 23e5: 88 0.00 : 23e6: 00 00 00 00 89 c3 0f mov 0x98(%rsp),%r12 0.00 : 23ed: 84 0.00 : 23ee: f6 00 00 00 4d 85 ed mov 0xa0(%rsp),%r13 0.00 : 23f5: 74 0.00 : 23f6: 0d 83 fd 04 75 5c 4d mov 0xa8(%rsp),%r14 0.00 : 23fd: 89 0.00 : 23fe: ac 24 88 00 00 00 89 mov 0xb0(%rsp),%r15 0.00 : 2405: d8 0.00 : 2406: 48 8b ac 24 90 00 00 add $0xb8,%rsp 0.00 : 240d: 00 retq 0.00 : 240e: 48 8b xchg %ax,%ax 100.00 : 2410: 9c 24 88 00 movzwl %r15w,%eax 0.00 : 2414: 00 00 4c 8b a4 24 98 mov 0x0(,%rax,8),%r14 0.00 : 241b: 00 0.00 : 241c: 00 00 4c 8b ac jmpq 2335 0.00 : 2421: 24 a0 00 00 00 4c 8b nopl 0x0(%rax) 0.00 : 2428: b4 24 a8 00 00 lock decl 0x0(%r13) 0.00 : 242d: 00 4c 8b sete %al 0.00 : 2430: bc 24 test %al,%al 0.00 : 2432: b0 00 je 23d4 0.00 : 2434: 00 00 48 mov %r13,%rdi 0.00 : 2437: 81 c4 b8 00 00 callq 243c 0.00 : 243c: 00 c3 jmp 23d4 0.00 : 243e: 66 90 xchg %ax,%ax 0.00 : 2440: 41 0f b7 c7 4c callq 2445 0.00 : 2445: 8b 34 c5 00 00 mov 0x20(%rsp),%rdx 0.00 : 244a: 00 00 e9 14 ff mov $0x1,%ebx 0.00 : 244f: ff ff 0f 1f 80 00 00 mov 0x730(%rdx),%rax 0.00 : 2456: 00 00 f0 41 incl %gs:0x10(%rax) 0.00 : 245a: ff 4d 00 0f 94 callq 245f 0.00 : 245f: c0 84 c0 74 a0 jmpq 23d4 0.00 : 2464: 4c 89 ef e8 nopl 0x0(%rax) 0.00 : 2468: 00 00 00 00 eb 96 66 cmpb $0x0,0x0(%rip) # 246f 0.00 : 246f: 90 e8 00 00 00 00 jne 28f7 0.00 : 2475: 48 8b 54 24 20 callq 247a 0.00 : 247a: bb 01 00 00 00 mov 0x20(%rsp),%rdx 0.00 : 247f: 48 8b mov %ebx,%ebp 0.00 : 2481: 82 30 neg %ebp 0.00 : 2483: 07 00 mov %ebp,%ebx 0.00 : 2485: 00 65 ff 40 10 e8 00 mov 0x730(%rdx),%rax 0.00 : 248c: 00 00 00 e9 incl %gs:0x2c(%rax) 0.00 : 2490: 70 ff ff ff 0f callq 2495 0.00 : 2495: 1f 40 00 80 3d callq 249a 0.00 : 249a: 00 00 00 00 00 mov 0x20(%rsp),%rdx 0.00 : 249f: 0f 85 82 04 00 00 e8 mov 0x730(%rdx),%rax 0.00 : 24a6: 00 00 00 00 incl %gs:0xc(%rax) 0.00 : 24aa: 48 8b 54 24 20 callq 24af 0.00 : 24af: 89 dd f7 dd 89 jmpq 23c2 0.00 : 24b4: eb 48 8b 82 nopl 0x0(%rax) 0.00 : 24b8: 30 07 00 00 mov 0x74(%rsp),%eax 0.00 : 24bc: 65 ff 40 test %r13,%r13 0.00 : 24bf: 2c e8 00 00 00 movzbl 0x7f(%rsp),%ecx 0.00 : 24c4: 00 e8 00 00 mov %eax,0x3c(%rsp) 0.00 : 24c8: 00 00 48 8b 54 24 je 2580 0.00 : 24ce: 20 48 8b 82 30 07 00 mov 0xe0(%r13),%rdx 0.00 : 24d5: 00 65 ff test %rdx,%rdx 0.00 : 24d8: 40 0c e8 00 00 00 je 2580 0.00 : 24de: 00 e9 0e ff movzbl 0x14(%rdx),%eax 0.00 : 24e2: ff ff test %al,%al 0.00 : 24e4: 0f 1f 40 00 8b 44 je 2580 0.00 : 24ea: 24 74 4d movzbl %al,%eax 0.00 : 24ed: 85 ed 0f add %rdx,%rax 0.00 : 24f0: b6 4c 24 7f 89 44 je 2580 0.00 : 24f6: 24 3c 0f movzwl (%rax),%ebx 0.00 : 24f9: 84 b2 00 00 00 mov 0x28(%rsp),%rdx 0.00 : 24fe: 49 8b 95 e0 00 00 00 mov 0xc4(%r12),%esi 0.00 : 2505: 48 0.00 : 2506: 85 d2 0f 84 a2 lea 0x40(%rsp),%rbp 0.00 : 250b: 00 00 00 0f b6 42 14 add 0xd8(%r12),%rsi 0.00 : 2512: 84 0.00 : 2513: c0 0f 84 96 movzbl %cl,%r8d 0.00 : 2517: 00 00 00 mov %r12,%rdi 0.00 : 251a: 0f b6 c0 48 01 d0 0f sub 0xe0(%r12),%esi 0.00 : 2521: 84 0.00 : 2522: 8a 00 00 mov %rbp,%r9 0.00 : 2525: 00 0f b7 mov %r15d,%ecx 0.00 : 2528: 18 48 8b 54 24 mov %rdx,0x8(%rsp) 0.00 : 252d: 28 41 8b b4 mov 0x3c(%rsp),%edx 0.00 : 2531: 24 c4 00 00 mov %r14,(%rsp) 0.00 : 2535: 00 48 8d 6c 24 callq 253a 0.00 : 253a: 40 49 test %al,%al 0.00 : 253c: 03 b4 24 d8 00 00 jne 25d0 0.00 : 2542: 00 44 0f b6 c1 4c 89 cmpb $0x0,0x0(%rip) # 2549 0.00 : 2549: e7 41 2b b4 24 e0 jne 2758 0.00 : 254f: 00 00 00 49 89 callq 2554 0.00 : 2554: e9 44 89 f9 48 mov 0x20(%rsp),%rdx 0.00 : 2559: 89 54 24 08 8b mov $0x1,%ebp 0.00 : 255e: 54 24 3c 4c 89 mov $0x1,%ebx 0.00 : 2563: 34 24 e8 00 00 00 00 mov 0x730(%rdx),%rax 0.00 : 256a: 84 c0 0f 85 incl %gs:0xc(%rax) 0.00 : 256e: 8e 00 00 00 80 callq 2573 0.00 : 2573: 3d 00 00 00 00 jmpq 23c2 0.00 : 2578: 00 0f 85 09 02 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 257f: e8 0.00 : 2580: 00 00 xor %ebx,%ebx 0.00 : 2582: 00 00 48 8b 54 jmpq 24f9 0.00 : 2587: 24 20 bd 01 00 00 00 nopw 0x0(%rax,%rax,1) 0.00 : 258e: bb 01 0.00 : 2590: 00 00 00 48 8b callq 2595 0.00 : 2595: 82 30 07 00 00 mov 0x20(%rsp),%rbx 0.00 : 259a: 65 ff neg %ebp 0.00 : 259c: 40 0c e8 00 00 00 00 mov 0x730(%rbx),%rax 0.00 : 25a3: e9 4a fe ff incl %gs:0x2c(%rax) 0.00 : 25a7: ff 0f 1f 84 00 callq 25ac 0.00 : 25ac: 00 00 00 00 31 callq 25b1 0.00 : 25b1: db e9 72 ff ff ff 66 mov 0x730(%rbx),%rax 0.00 : 25b8: 0f 1f mov %ebp,%ebx 0.00 : 25ba: 84 00 00 00 incl %gs:0xc(%rax) 0.00 : 25be: 00 00 e8 00 00 callq 25c3 0.00 : 25c3: 00 00 48 8b 5c jmpq 23c2 0.00 : 25c8: 24 20 f7 dd 48 8b 83 nopl 0x0(%rax,%rax,1) 0.00 : 25cf: 30 0.00 : 25d0: 07 00 00 movzwl %bx,%ebx 0.00 : 25d3: 65 ff 40 mov %rbp,%rdi 0.00 : 25d6: 2c e8 mov %ebx,%esi 0.00 : 25d8: 00 00 00 00 e8 callq 0 0.00 : 25dd: 00 00 00 00 48 mov 0x20(%rsp),%rdi 0.00 : 25e2: 8b 83 mov %ebx,%esi 0.00 : 25e4: 30 07 mov %eax,%ecx 0.00 : 25e6: 00 00 89 mov %rbp,%rdx 0.00 : 25e9: eb 65 ff 40 mov %eax,0x38(%rsp) 0.00 : 25ed: 0c e8 00 00 00 callq 2120 0.00 : 25f2: 00 e9 fa test %rax,%rax 0.00 : 25f5: fd ff ff mov %rax,%rsi 0.00 : 25f8: 0f 1f 84 00 00 00 je 285b 0.00 : 25fe: 00 00 0f b7 movzbl 0x37(%rsi),%ecx 0.00 : 2602: db 48 89 mov %rsi,%r14 0.00 : 2605: ef 89 de movzbl %cl,%edx 0.00 : 2608: e8 23 da ff ff 48 8b lea 0x0(,%rdx,8),%rax 0.00 : 260f: 7c 0.00 : 2610: 24 20 89 sub %rdx,%rax 0.00 : 2613: de 89 c1 48 89 ea 89 lea 0x8(,%rax,8),%rax 0.00 : 261a: 44 0.00 : 261b: 24 38 e8 sub %rax,%r14 0.00 : 261e: 2e fb ff sub $0x1,%cl 0.00 : 2621: ff 48 je 26a0 0.00 : 2623: 85 c0 48 89 mov 0x78(%r14),%rax 0.00 : 2627: c6 0f test $0x2,%al 0.00 : 2629: 84 5d 02 00 00 0f je 2770 0.00 : 262f: b6 4e 37 49 89 f6 0f cmpb $0x0,0x0(%rip) # 2636 0.00 : 2636: b6 d1 48 8d 04 d5 jne 2822 0.00 : 263c: 00 00 00 00 48 29 d0 movl $0x0,0x78(%rsp) 0.00 : 2643: 48 0.00 : 2644: 8d 04 c5 08 00 00 00 movl $0x0,0x34(%rsp) 0.00 : 264b: 49 0.00 : 264c: 29 c6 80 e9 01 74 movzbl 0x7c(%r12),%eax 0.00 : 2652: 7d 49 8b 46 mov 0x78(%rsp),%edx 0.00 : 2656: 78 a8 02 0f 84 41 01 mov %r14,0x88(%r12) 0.00 : 265d: 00 0.00 : 265e: 00 80 3d shl $0x5,%edx 0.00 : 2661: 00 00 00 and $0x1f,%eax 0.00 : 2664: 00 00 or %edx,%eax 0.00 : 2666: 0f 85 e6 01 00 mov %al,0x7c(%r12) 0.00 : 266b: 00 c7 44 test %r14,%r14 0.00 : 266e: 24 78 00 00 00 00 je 254f 0.00 : 2674: c7 44 24 34 00 00 00 cmp $0xfffffffffffff000,%r14 0.00 : 267b: 00 41 jbe 26b8 0.00 : 267d: 0f b6 44 24 7c callq 2682 0.00 : 2682: 8b 54 24 78 4d mov 0x20(%rsp),%rbx 0.00 : 2687: 89 b4 xor %ebp,%ebp 0.00 : 2689: 24 88 00 00 00 c1 e2 mov 0x730(%rbx),%rax 0.00 : 2690: 05 83 xor %ebx,%ebx 0.00 : 2692: e0 1f 09 d0 incl %gs:0x24(%rax) 0.00 : 2696: 41 88 44 24 7c callq 269b 0.00 : 269b: 4d 85 f6 0f 84 jmpq 23c2 0.00 : 26a0: db fe ff ff 49 81 fe movl $0x3,0x78(%rsp) 0.00 : 26a7: 00 0.00 : 26a8: f0 ff ff 76 3b e8 00 movl $0x1,0x34(%rsp) 0.00 : 26af: 00 0.00 : 26b0: 00 00 jmp 264c 0.00 : 26b2: 48 8b 5c 24 20 31 nopw 0x0(%rax,%rax,1) 0.00 : 26b8: ed 48 8b 83 30 mov 0x28(%rsp),%rbx 0.00 : 26bd: 07 00 00 31 mov 0x78(%rsp),%ecx 0.00 : 26c1: db 65 ff mov %r15d,%r8d 0.00 : 26c4: 40 24 e8 00 mov 0x74(%rsp),%edx 0.00 : 26c8: 00 00 00 e9 22 mov 0x1c(%rsp),%r9d 0.00 : 26cd: fd ff ff mov %r12,%rsi 0.00 : 26d0: c7 44 24 mov %r14,%rdi 0.00 : 26d3: 78 03 00 callq *0x18(%rbx) 0.00 : 26d6: 00 00 test %eax,%eax 0.00 : 26d8: c7 44 mov %eax,%ebp 0.00 : 26da: 24 34 01 00 00 00 jle 27a0 0.00 : 26e0: eb 9a mov %eax,%ebx 0.00 : 26e2: 66 0f 1f 44 mov 0x34(%rsp),%eax 0.00 : 26e6: 00 00 test %eax,%eax 0.00 : 26e8: 48 8b 5c 24 28 8b je 23c2 0.00 : 26ee: 4c 24 78 45 lea 0x78(%r14),%rax 0.00 : 26f2: 89 f8 8b 54 24 lock btsl $0x1,(%rax) 0.00 : 26f7: 74 44 sbb %edx,%edx 0.00 : 26f9: 8b 4c test %edx,%edx 0.00 : 26fb: 24 1c mov %ebp,%ebx 0.00 : 26fd: 4c 89 e6 4c 89 f7 jne 23c2 0.00 : 2703: ff 53 18 85 c0 89 c5 mov 0xe8(%r14),%rax 0.00 : 270a: 0f 8e mov %ebp,%ebx 0.00 : 270c: c0 00 00 00 89 c3 8b cmpq $0x0,0x738(%rax) 0.00 : 2713: 44 0.00 : 2714: 24 34 85 c0 0f 84 je 23c2 0.00 : 271a: d4 fc ff ff 49 8d 46 mov 0xe0(%r14),%rdx 0.00 : 2721: 78 f0 mov %ebp,%ebx 0.00 : 2723: 0f ba 28 test %rdx,%rdx 0.00 : 2726: 01 19 d2 85 d2 89 je 23c2 0.00 : 272c: eb 0f 85 bf movzbl 0x13(%rdx),%eax 0.00 : 2730: fc ff mov %ebp,%ebx 0.00 : 2732: ff 49 test %al,%al 0.00 : 2734: 8b 86 e8 00 00 00 je 23c2 0.00 : 273a: 89 eb 48 movzbl %al,%eax 0.00 : 273d: 83 b8 mov %ebp,%ebx 0.00 : 273f: 38 07 00 add %rdx,%rax 0.00 : 2742: 00 00 0f 84 a8 fc je 23c2 0.00 : 2748: ff ff 49 8b lock orb $0x8,(%rax) 0.00 : 274c: 96 e0 mov %ebp,%ebx 0.00 : 274e: 00 00 00 89 eb jmpq 23c2 0.00 : 2753: 48 85 d2 0f 84 nopl 0x0(%rax,%rax,1) 0.00 : 2758: 96 fc ff ff 0f b6 42 mov $0x0,%rsi 0.00 : 275f: 13 89 eb 84 c0 0f 84 mov $0x0,%rdi 0.00 : 2766: 88 fc ff ff 0f callq 276b 0.00 : 276b: b6 c0 89 eb 48 jmpq 254f 0.00 : 2770: 01 d0 0f 84 mov 0x78(%r14),%rax 0.00 : 2774: 7a fc test $0x1,%al 0.00 : 2776: ff ff f0 80 08 08 je 2800 0.00 : 277c: 89 eb e9 6f fc ff ff cmpb $0x0,0x0(%rip) # 2783 0.00 : 2783: 0f 1f 44 00 00 48 jne 28da 0.00 : 2789: c7 c6 00 00 00 00 48 movl $0x1,0x78(%rsp) 0.00 : 2790: c7 0.00 : 2791: c7 00 00 00 00 e8 00 movl $0x0,0x34(%rsp) 0.00 : 2798: 00 0.00 : 2799: 00 00 e9 df fd jmpq 264c 0.00 : 279e: ff ff xchg %ax,%ax 0.00 : 27a0: 49 8b 46 78 a8 01 0f cmpb $0x0,0x0(%rip) # 27a7 0.00 : 27a7: 84 84 00 00 00 80 jne 2911 0.00 : 27ad: 3d 00 00 00 00 00 0f mov 0x88(%r12),%rdi 0.00 : 27b4: 85 0.00 : 27b5: 51 01 00 test %rdi,%rdi 0.00 : 27b8: 00 c7 je 27c8 0.00 : 27ba: 44 24 78 lock decl (%rdi) 0.00 : 27bd: 01 00 00 sete %al 0.00 : 27c0: 00 c7 test %al,%al 0.00 : 27c2: 44 24 34 00 00 00 jne 28ad 0.00 : 27c8: 00 e9 ae fe ff ff 66 movq $0x0,0x88(%r12) 0.00 : 27cf: 90 80 3d 00 00 0.00 : 27d4: 00 00 00 0f 85 callq 27d9 0.00 : 27d9: 64 01 00 00 49 mov 0x20(%rsp),%rdx 0.00 : 27de: 8b bc 24 88 00 00 00 mov 0x730(%rdx),%rax 0.00 : 27e5: 48 85 ff 74 incl %gs:0xc(%rax) 0.00 : 27e9: 0e f0 ff 0f 0f callq 27ee 0.00 : 27ee: 94 c0 test %ebp,%ebp 0.00 : 27f0: 84 c0 je 283f 0.00 : 27f2: 0f 85 neg %ebp 0.00 : 27f4: e5 00 mov %ebp,%ebx 0.00 : 27f6: 00 00 49 c7 84 jmpq 23c2 0.00 : 27fb: 24 88 00 00 00 nopl 0x0(%rax,%rax,1) 0.00 : 2800: 00 00 00 00 e8 00 00 cmpb $0x0,0x0(%rip) # 2807 0.00 : 2807: 00 00 48 8b 54 24 jne 28bd 0.00 : 280d: 20 48 8b 82 30 07 00 movl $0x2,0x78(%rsp) 0.00 : 2814: 00 0.00 : 2815: 65 ff 40 0c e8 00 00 movl $0x0,0x34(%rsp) 0.00 : 281c: 00 0.00 : 281d: 00 85 ed 74 4d jmpq 264c 0.00 : 2822: f7 dd 89 mov %r14,%rdx 0.00 : 2825: eb e9 c7 fb ff ff 0f mov $0x0,%rsi 0.00 : 282c: 1f 44 00 00 80 3d 00 mov $0x0,%rdi 0.00 : 2833: 00 00 xor %eax,%eax 0.00 : 2835: 00 00 0f 85 b0 callq 283a 0.00 : 283a: 00 00 00 c7 44 jmpq 263c 0.00 : 283f: 24 78 02 00 00 callq 2844 0.00 : 2844: 00 c7 44 24 34 mov 0x20(%rsp),%rbx 0.00 : 2849: 00 00 00 00 e9 2a fe mov 0x730(%rbx),%rax 0.00 : 2850: ff ff 4c 89 incl %gs:0x24(%rax) 0.00 : 2854: f2 48 c7 c6 00 callq 2859 0.00 : 2859: 00 00 jmp 27f2 0.00 : 285b: 00 48 c7 c7 mov 0x38(%rsp),%ebx 0.00 : 285f: 00 00 00 00 mov 0x3c(%rsp),%eax 0.00 : 2863: 31 c0 e8 mov %r13,%rsi 0.00 : 2866: 00 00 00 00 e9 mov 0x28(%rsp),%r8 0.00 : 286b: fd fd ff ff e8 mov 0x20(%rsp),%rdi 0.00 : 2870: 00 00 00 mov %r12,%r9 0.00 : 2873: 00 48 8b mov %r14,%rcx 0.00 : 2876: 5c 24 20 mov %rbp,%rdx 0.00 : 2879: 48 8b 83 30 mov %ebx,0x8(%rsp) 0.00 : 287d: 07 00 00 mov %eax,(%rsp) 0.00 : 2880: 65 ff 40 24 e8 callq 1a90 0.00 : 2885: 00 00 00 test %rax,%rax 0.00 : 2888: 00 eb 97 mov %rax,%rsi 0.00 : 288b: 8b 5c 24 38 8b 44 je 254f 0.00 : 2891: 24 3c 4c 89 ee 4c cmp $0xfffffffffffff000,%rax 0.00 : 2897: 8b 44 24 mov %rax,%r14 0.00 : 289a: 28 48 8b 7c 24 20 4d movl $0x0,0x34(%rsp) 0.00 : 28a1: 89 0.00 : 28a2: e1 4c 89 f1 48 89 ja 266b 0.00 : 28a8: ea 89 5c 24 08 jmpq 25fe 0.00 : 28ad: 89 04 24 e8 0b callq 28b2 0.00 : 28b2: f2 ff ff 48 85 c0 nopw 0x0(%rax,%rax,1) 0.00 : 28b8: 48 89 c6 0f 84 jmpq 27c8 0.00 : 28bd: be fc ff mov %r14,%rdx 0.00 : 28c0: ff 48 3d 00 f0 ff ff mov $0x0,%rsi 0.00 : 28c7: 49 89 c6 c7 44 24 34 mov $0x0,%rdi 0.00 : 28ce: 00 00 xor %eax,%eax 0.00 : 28d0: 00 00 0f 87 c3 callq 28d5 0.00 : 28d5: fd ff ff e9 51 jmpq 280d 0.00 : 28da: fd ff ff mov %r14,%rdx 0.00 : 28dd: e8 00 00 00 00 66 0f mov $0x0,%rsi 0.00 : 28e4: 1f 44 00 00 e9 0b ff mov $0x0,%rdi 0.00 : 28eb: ff ff xor %eax,%eax 0.00 : 28ed: 4c 89 f2 48 c7 callq 28f2 0.00 : 28f2: c6 00 00 00 00 jmpq 2789 0.00 : 28f7: 48 c7 c7 00 00 00 00 mov $0x0,%rsi 0.00 : 28fe: 31 c0 e8 00 00 00 00 mov $0x0,%rdi 0.00 : 2905: e9 33 xor %eax,%eax 0.00 : 2907: ff ff ff 4c 89 callq 290c 0.00 : 290c: f2 48 c7 c6 00 jmpq 2475 0.00 : 2911: 00 00 00 48 c7 c7 00 mov $0x0,%rsi 0.00 : 2918: 00 00 00 31 c0 e8 00 mov $0x0,%rdi 0.00 : 291f: 00 00 xor %eax,%eax 0.00 : 2921: 00 e9 92 fe ff callq 2926 0.00 : 2926: ff 48 c7 c6 00 jmpq 27ad : 292b: 00 00 00 48 c7 nopl 0x0(%rax,%rax,1) : 2930: c7 00 00 00 sub $0x18,%rsp : 2934: 00 31 c0 e8 mov %rbx,(%rsp) : 2938: 00 00 00 movzwl %si,%ebx : 293b: 00 e9 64 fb ff mov %r12,0x8(%rsp) : 2940: ff 48 c7 c6 00 mov %r13,0x10(%rsp) : 2945: 00 00 00 mov %rdx,%r12 : 2948: 48 c7 c7 mov %rdi,%r13 : 294b: 00 00 mov %ebx,%esi : 294d: 00 00 31 mov %rdx,%rdi : 2950: c0 e8 00 00 00 callq 0 : 2955: 00 e9 82 mov %r12,%rdx : 2958: fe ff mov %ebx,%esi 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/ipv4/netfilter/ip_tables.ko ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/net/ipv4/netfilter/ip_tables.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 00000000000025c0 : 0.00 : 25c0: 41 57 push %r15 0.00 : 25f2: 48 c7 c0 00 00 00 00 mov 0xd8(%rdi),%r13 0.00 : 25f9: 41 56 41 55 41 mov 0x70(%rsp),%rcx 0.00 : 25fe: 54 49 89 fc 55 mov 0x70(%rsp),%rsi 0.00 : 2603: 53 4c 89 add %rdx,%r13 0.00 : 2606: c3 48 81 ec 08 01 cmpq $0x0,0x70(%rsp) 0.00 : 260c: 00 00 48 89 cmove %rax,%rcx 0.00 : 2610: 4c 24 68 48 89 54 cmpq $0x0,0x68(%rsp) 0.00 : 2616: 24 70 89 74 24 78 cmovne 0x68(%rsp),%rax 0.00 : 261c: 8b 97 c4 00 00 00 4c mov %rcx,0x80(%rsp) 0.00 : 2623: 8b 0.00 : 2624: af d8 00 00 00 48 8b mov %rax,0x88(%rsp) 0.00 : 262b: 4c 0.00 : 262c: 24 70 48 8b 74 movzwl 0x6(%r13),%eax 0.00 : 2631: 24 70 49 01 rol $0x8,%ax 0.00 : 2635: d5 48 83 7c 24 and $0x1fff,%eax 0.00 : 263a: 70 00 48 0f 44 c8 48 mov %eax,0xf0(%rsp) 0.00 : 2641: 83 7c 24 68 00 48 0f mov 0xd8(%rdi),%rax 0.00 : 2648: 45 44 24 68 48 mov 0x68(%rsp),%rdi 0.00 : 264d: 89 8c 24 80 movzbl (%rax,%rdx,1),%eax 0.00 : 2651: 00 00 00 48 89 84 24 movb $0x0,0xfd(%rsp) 0.00 : 2658: 88 0.00 : 2659: 00 00 00 41 0f b7 45 mov %rsi,0xe0(%rsp) 0.00 : 2660: 06 0.00 : 2661: 66 c1 c0 08 25 ff 1f mov %rdi,0xe8(%rsp) 0.00 : 2668: 00 0.00 : 2669: 00 89 84 24 f0 00 00 movb $0x2,0xfc(%rsp) 0.00 : 2670: 00 0.00 : 2671: 48 8b 87 and $0xf,%eax 0.00 : 2674: d8 00 00 shl $0x2,%eax 0.00 : 2677: 00 48 8b 7c 24 68 0f mov %eax,0xf4(%rsp) 0.00 : 267e: b6 04 10 c6 mov 0x78(%rsp),%eax 0.00 : 2682: 84 24 fd 00 00 00 00 mov %eax,0xf8(%rsp) 0.00 : 2689: 48 89 b4 24 e0 callq 268e 0.00 : 268e: 00 00 00 48 89 bc 24 mov %gs:0x0,%eax 0.00 : 2695: e8 0.00 : 2696: 00 00 00 add $0x1,%eax 0.00 : 2699: c6 84 24 and $0x1,%eax 0.00 : 269c: fc 00 00 00 02 83 e0 mov %eax,0xb4(%rsp) 0.00 : 26a3: 0f c1 e0 02 89 84 24 add %eax,%gs:0x0 0.00 : 26aa: f4 0.00 : 26ab: 00 00 00 8b mov 0x18(%rbx),%rdx 0.00 : 26af: 44 24 78 89 add $0x30,%rbx 0.00 : 26b3: 84 24 f8 00 00 00 e8 mov %rdx,0xa8(%rsp) 0.00 : 26ba: 00 0.00 : 26bb: 00 00 00 65 8b 04 25 mov 0xa8(%rsp),%rcx 0.00 : 26c2: 00 0.00 : 26c3: 00 00 00 83 c0 01 83 mov %gs:0x0,%edx 0.00 : 26ca: e0 0.00 : 26cb: 01 89 mov %edx,%edx 0.00 : 26cd: 84 24 b4 00 00 00 65 mov 0xa8(%rsp),%rsi 0.00 : 26d4: 01 0.00 : 26d5: 04 25 00 00 00 mov 0x48(%rcx,%rdx,8),%rcx 0.00 : 26da: 00 48 8b 53 18 48 83 mov %rcx,0x90(%rsp) 0.00 : 26e1: c3 0.00 : 26e2: 30 48 89 94 mov 0x40(%rsi),%rax 0.00 : 26e6: 24 a8 00 00 mov (%rax,%rdx,8),%rax 0.00 : 26ea: 00 48 8b 8c 24 a8 00 mov %rax,0x98(%rsp) 0.00 : 26f1: 00 0.00 : 26f2: 00 65 8b 14 mov 0x38(%rsi),%r15 0.00 : 26f6: 25 00 00 00 00 89 d2 add 0x0(,%rdx,8),%r15 0.00 : 26fd: 48 0.00 : 26fe: 8b b4 24 a8 mov 0x78(%rsp),%eax 0.00 : 2702: 00 00 00 48 8b 4c d1 cmpb $0x0,0x0(%rip) # 2709 0.00 : 2709: 48 48 89 mov (%r15),%edi 100.00 : 270c: 8c 24 90 00 00 mov %rax,0x50(%rsp) 0.00 : 2711: 00 48 8b 46 40 48 8b mov %edi,0xa4(%rsp) 0.00 : 2718: 04 d0 48 89 mov 0xc(%rsi,%rax,4),%ebp 0.00 : 271c: 84 24 98 00 00 mov %rbx,0x58(%rsp) 0.00 : 2721: 00 4c 8b 7e 38 4c jne 2bd3 0.00 : 2727: 03 3c d5 00 00 mov 0x50(%rsp),%rdx 0.00 : 272c: 00 00 mov %ebp,%eax 0.00 : 272e: 8b 44 24 78 80 3d 00 mov 0x90(%rsp),%rbp 0.00 : 2735: 00 0.00 : 2736: 00 00 00 41 8b 3f 48 lea 0xd0(%rsp),%r14 0.00 : 273d: 89 0.00 : 273e: 44 24 50 89 bc 24 a4 movl $0x0,0x7c(%rsp) 0.00 : 2745: 00 0.00 : 2746: 00 00 8b 6c add $0x8,%rdx 0.00 : 274a: 86 0c 48 add %rax,%rbp 0.00 : 274d: 89 5c 24 58 0f mov %rdx,0x48(%rsp) 0.00 : 2752: 85 ac 04 00 00 48 nopw 0x0(%rax,%rax,1) 0.00 : 2758: 8b 54 24 50 movzbl 0x53(%rbp),%ecx 0.00 : 275c: 89 e8 48 mov 0x8(%rbp),%eax 0.00 : 275f: 8b ac 24 90 and 0xc(%r13),%eax 0.00 : 2763: 00 00 00 4c 8d b4 24 mov 0xf0(%rsp),%esi 0.00 : 276a: d0 00 00 cmp 0x0(%rbp),%eax 0.00 : 276d: 00 c7 mov %ecx,%eax 0.00 : 276f: 44 24 7c setne %dl 0.00 : 2772: 00 00 00 shr $0x3,%eax 0.00 : 2775: 00 48 83 and $0x1,%eax 0.00 : 2778: c2 08 cmp %al,%dl 0.00 : 277a: 48 01 jne 27f8 0.00 : 277c: c5 48 89 mov 0xc(%rbp),%eax 0.00 : 277f: 54 24 48 66 and 0x10(%r13),%eax 0.00 : 2783: 0f 1f 44 cmp 0x4(%rbp),%eax 0.00 : 2786: 00 00 mov %ecx,%eax 0.00 : 2788: 0f b6 4d setne %dl 0.00 : 278b: 53 8b 45 shr $0x4,%eax 0.00 : 278e: 08 41 23 and $0x1,%eax 0.00 : 2791: 45 0c cmp %al,%dl 0.00 : 2793: 8b b4 jne 27f8 0.00 : 2795: 24 f0 00 00 00 3b 45 mov 0x80(%rsp),%rbx 0.00 : 279c: 00 0.00 : 279d: 89 c8 0f 95 mov 0x8(%rbx),%rdx 0.00 : 27a1: c2 c1 e8 mov (%rbx),%rax 0.00 : 27a4: 03 83 e0 01 xor 0x18(%rbp),%rdx 0.00 : 27a8: 38 c2 75 7c xor 0x10(%rbp),%rax 0.00 : 27ac: 8b 45 0c 41 and 0x38(%rbp),%rdx 0.00 : 27b0: 23 45 10 3b and 0x30(%rbp),%rax 0.00 : 27b4: 45 04 89 or %rax,%rdx 0.00 : 27b7: c8 0f mov %ecx,%eax 0.00 : 27b9: 95 c2 c1 setne %dl 0.00 : 27bc: e8 04 83 and $0x1,%eax 0.00 : 27bf: e0 01 cmp %al,%dl 0.00 : 27c1: 38 c2 jne 27f8 0.00 : 27c3: 75 63 48 8b 9c 24 80 mov 0x88(%rsp),%rdi 0.00 : 27ca: 00 0.00 : 27cb: 00 00 48 8b mov 0x8(%rdi),%rdx 0.00 : 27cf: 53 08 48 mov (%rdi),%rax 0.00 : 27d2: 8b 03 48 33 xor 0x28(%rbp),%rdx 0.00 : 27d6: 55 18 48 33 xor 0x20(%rbp),%rax 0.00 : 27da: 45 10 48 23 and 0x48(%rbp),%rdx 0.00 : 27de: 55 38 48 23 and 0x40(%rbp),%rax 0.00 : 27e2: 45 30 48 or %rax,%rdx 0.00 : 27e5: 09 c2 mov %ecx,%eax 0.00 : 27e7: 89 c8 0f setne %dl 0.00 : 27ea: 95 c2 shr %eax 0.00 : 27ec: 83 e0 01 and $0x1,%eax 0.00 : 27ef: 38 c2 cmp %al,%dl 0.00 : 27f1: 75 35 je 2860 0.00 : 27f3: 48 8b bc 24 88 nopl 0x0(%rax,%rax,1) 0.00 : 27f8: 00 00 00 48 movzwl 0x5a(%rbp),%eax 0.00 : 27fc: 8b 57 08 add %rax,%rbp 0.00 : 27ff: 48 8b 07 48 33 55 28 cmpb $0x0,0xfd(%rsp) 0.00 : 2806: 48 0.00 : 2807: 33 45 20 48 23 55 je 2758 0.00 : 280d: 48 48 23 45 40 48 09 cmpb $0x0,0x0(%rip) # 2814 0.00 : 2814: c2 89 c8 0f 95 c2 jne 2bff 0.00 : 281a: d1 e8 83 e0 01 38 c2 mov 0xa4(%rsp),%eax 0.00 : 2821: 74 6d 0f mov %eax,(%r15) 0.00 : 2824: 1f 44 00 00 0f b7 45 mov 0xb4(%rsp),%edx 0.00 : 282b: 5a 48 01 c5 80 bc 24 add %edx,%gs:0x0 0.00 : 2832: fd 0.00 : 2833: 00 00 00 00 0f callq 2838 0.00 : 2838: 84 4b ff ff ff 80 3d cmpb $0x0,0xfd(%rsp) 0.00 : 283f: 00 0.00 : 2840: 00 00 00 00 0f mov $0x0,%eax 0.00 : 2845: 85 e5 03 00 00 cmove 0x7c(%rsp),%eax 0.00 : 284a: 8b 84 24 a4 mov %eax,0x7c(%rsp) 0.00 : 284e: 00 00 00 41 89 07 8b add $0x108,%rsp 0.00 : 2855: 94 pop %rbx 0.00 : 2856: 24 pop %rbp 0.00 : 2857: b4 00 pop %r12 0.00 : 2859: 00 00 pop %r13 0.00 : 285b: 65 01 pop %r14 0.00 : 285d: 14 25 pop %r15 0.00 : 285f: 00 retq 0.00 : 2860: 00 00 00 e8 movzwl 0x50(%rbp),%edx 0.00 : 2864: 00 00 00 test %dx,%dx 0.00 : 2867: 00 80 je 2884 0.00 : 2869: bc 24 fd 00 00 movzbl 0x9(%r13),%eax 0.00 : 286e: 00 00 b8 cmp %ax,%dx 0.00 : 2871: 00 00 mov %ecx,%eax 0.00 : 2873: 00 00 0f setne %dl 0.00 : 2876: 44 44 24 shr $0x6,%eax 0.00 : 2879: 7c 89 44 and $0x1,%eax 0.00 : 287c: 24 7c cmp %al,%dl 0.00 : 287e: 48 81 c4 08 01 00 jne 27f8 0.00 : 2884: 00 5b test %esi,%esi 0.00 : 2886: 5d 41 5c sete %al 0.00 : 2889: 41 5d 41 and 0x52(%rbp),%al 0.00 : 288c: 5e 41 5f shr $0x5,%ecx 0.00 : 288f: c3 0f mov %ecx,%edx 0.00 : 2891: b7 55 50 and $0x1,%edx 0.00 : 2894: 66 85 cmp %dl,%al 0.00 : 2896: d2 74 1b 41 0f b6 jne 27f8 0.00 : 289c: 45 09 66 39 movzwl 0x58(%rbp),%eax 0.00 : 28a0: c2 89 c8 0f lea 0x70(%rbp),%rbx 0.00 : 28a4: 95 c2 c1 e8 06 lea 0x0(%rbp,%rax,1),%rax 0.00 : 28a9: 83 e0 01 cmp %rax,%rbx 0.00 : 28ac: 38 c2 jb 28c4 0.00 : 28ae: 0f 85 jmp 28f0 0.00 : 28b0: 74 ff ff movzwl (%rbx),%eax 0.00 : 28b3: ff 85 f6 add %rax,%rbx 0.00 : 28b6: 0f 94 c0 22 movzwl 0x58(%rbp),%eax 0.00 : 28ba: 45 52 c1 e9 05 lea 0x0(%rbp,%rax,1),%rax 0.00 : 28bf: 89 ca 83 cmp %rax,%rbx 0.00 : 28c2: e2 01 jae 28f0 0.00 : 28c4: 38 d0 0f 85 mov 0x8(%rbx),%rax 0.00 : 28c8: 5c ff ff ff lea 0x20(%rbx),%rdx 0.00 : 28cc: 0f b7 45 mov %r14,%rsi 0.00 : 28cf: 58 48 8d mov %r12,%rdi 0.00 : 28d2: 5d 70 48 8d 44 05 00 mov %rdx,0xd8(%rsp) 0.00 : 28d9: 48 0.00 : 28da: 39 c3 72 16 eb 40 0f mov %rax,0xd0(%rsp) 0.00 : 28e1: b7 0.00 : 28e2: 03 48 01 callq *0x30(%rax) 0.00 : 28e5: c3 0f test %al,%al 0.00 : 28e7: b7 45 jne 28b0 0.00 : 28e9: 58 48 8d 44 05 jmpq 27f8 0.00 : 28ee: 00 48 xchg %ax,%ax 0.00 : 28f0: 39 c3 73 2c 48 mov 0x68(%r12),%eax 0.00 : 28f5: 8b 43 08 48 8d addq $0x1,0x60(%rbp) 0.00 : 28fa: 53 20 4c 89 add %rax,0x68(%rbp) 0.00 : 28fe: f6 4c 89 e7 movzwl 0x58(%rbp),%eax 0.00 : 2902: 48 89 94 24 d8 00 cmpb $0x0,0x7d(%r12) 0.00 : 2908: 00 00 48 89 84 mov %ax,0x36(%rsp) 0.00 : 290d: 24 d0 00 movzwl %ax,%eax 0.00 : 2910: 00 00 ff 50 30 lea 0x0(%rbp,%rax,1),%rbx 0.00 : 2915: 84 c0 75 c7 e9 0a js 2a90 0.00 : 291b: ff ff ff 66 mov 0x8(%rbx),%rax 0.00 : 291f: 90 41 8b 44 24 cmpq $0x0,0x30(%rax) 0.00 : 2924: 68 48 je 2980 0.00 : 2926: 83 45 60 01 48 01 45 mov %rax,0xd0(%rsp) 0.00 : 292d: 68 0.00 : 292e: 0f b7 45 58 lea 0x20(%rbx),%rax 0.00 : 2932: 41 80 7c mov %r14,%rsi 0.00 : 2935: 24 7d 00 mov %r12,%rdi 0.00 : 2938: 66 89 44 24 36 0f b7 mov %rax,0xd8(%rsp) 0.00 : 293f: c0 0.00 : 2940: 48 8d 5c 05 mov 0x8(%rbx),%rax 0.00 : 2944: 00 0f 88 callq *0x30(%rax) 0.00 : 2947: 75 01 00 00 mov %eax,0x7c(%rsp) 0.00 : 294b: 48 8b 43 08 48 cmpl $0xffffffff,0x7c(%rsp) 0.00 : 2950: 83 78 30 00 74 5a 48 mov 0xd8(%r12),%rcx 0.00 : 2957: 89 0.00 : 2958: 84 24 d0 00 00 00 48 mov 0xc4(%r12),%eax 0.00 : 295f: 8d 0.00 : 2960: 43 20 4c 89 f6 4c jne 280d 0.00 : 2966: 89 e7 mov %eax,%edx 0.00 : 2968: 48 89 84 24 movzwl 0x5a(%rbp),%eax 0.00 : 296c: d8 00 00 00 lea (%rcx,%rdx,1),%r13 0.00 : 2970: 48 8b 43 add %rax,%rbp 0.00 : 2973: 08 ff 50 30 89 jmpq 27ff 0.00 : 2978: 44 24 7c 83 7c 24 7c nopl 0x0(%rax,%rax,1) 0.00 : 297f: ff 0.00 : 2980: 49 8b 8c mov 0x20(%rbx),%ebx 0.00 : 2983: 24 d8 test %ebx,%ebx 0.00 : 2985: 00 00 js 29ed 0.00 : 2987: 00 41 8b 84 movzwl 0x5a(%rbp),%eax 0.00 : 298b: 24 c4 00 movslq %ebx,%rdx 0.00 : 298e: 00 00 0f 85 a7 fe ff add 0x90(%rsp),%rdx 0.00 : 2995: ff 0.00 : 2996: 89 c2 0f b7 45 lea 0x0(%rbp,%rax,1),%rax 0.00 : 299b: 5a 4c 8d cmp %rax,%rdx 0.00 : 299e: 2c 11 je 29db 0.00 : 29a0: 48 01 c5 e9 testb $0x2,0x52(%rbp) 0.00 : 29a4: 87 fe jne 29db 0.00 : 29a6: ff ff 0f 1f 84 00 00 mov 0xa8(%rsp),%rsi 0.00 : 29ad: 00 0.00 : 29ae: 00 00 8b mov (%r15),%ecx 0.00 : 29b1: 5b 20 85 cmp 0x34(%rsi),%ecx 0.00 : 29b4: db 78 66 0f b7 45 jae 2c93 0.00 : 29ba: 5a 48 63 d3 48 03 94 mov 0x98(%rsp),%rdi 0.00 : 29c1: 24 0.00 : 29c2: 90 00 mov %ecx,%eax 0.00 : 29c4: 00 00 48 8d mov %rbp,(%rdi,%rax,8) 0.00 : 29c8: 44 05 00 lea 0x1(%rcx),%eax 0.00 : 29cb: 48 39 c2 mov %eax,(%r15) 0.00 : 29ce: 74 3b f6 45 52 02 75 cmpb $0x0,0x0(%rip) # 29d5 0.00 : 29d5: 35 48 8b b4 24 a8 jne 2ca0 0.00 : 29db: 00 00 00 41 8b 0f 3b mov 0x90(%rsp),%rbp 0.00 : 29e2: 4e 0.00 : 29e3: 34 0f mov %ebx,%eax 0.00 : 29e5: 83 d9 02 add %rax,%rbp 0.00 : 29e8: 00 00 48 8b bc jmpq 27ff 0.00 : 29ed: 24 98 00 cmp $0xfffffffb,%ebx 0.00 : 29f0: 00 00 89 c8 48 89 jne 2c88 0.00 : 29f6: 2c c7 8d mov (%r15),%eax 0.00 : 29f9: 41 01 41 89 07 80 3d cmp %eax,0xa4(%rsp) 0.00 : 2a00: 00 00 jb 2a50 0.00 : 2a02: 00 00 00 0f 85 mov 0x48(%rsp),%rdx 0.00 : 2a07: c5 02 00 00 48 8b ac mov 0xa8(%rsp),%rcx 0.00 : 2a0e: 24 0.00 : 2a0f: 90 00 00 00 89 d8 48 mov 0x90(%rsp),%rbp 0.00 : 2a16: 01 0.00 : 2a17: c5 e9 12 mov (%rcx,%rdx,4),%eax 0.00 : 2a1a: fe ff ff add %rax,%rbp 0.00 : 2a1d: 83 fb fb 0f 85 92 02 cmpb $0x0,0x0(%rip) # 2a24 0.00 : 2a24: 00 00 41 8b 07 39 je 27ff 0.00 : 2a2a: 84 24 a4 mov %rbp,%rdx 0.00 : 2a2d: 00 00 00 72 4e 48 8b mov $0x0,%rsi 0.00 : 2a34: 54 24 48 48 8b 8c 24 mov $0x0,%rdi 0.00 : 2a3b: a8 00 xor %eax,%eax 0.00 : 2a3d: 00 00 48 8b ac callq 2a42 0.00 : 2a42: 24 90 00 00 00 jmpq 27ff 0.00 : 2a47: 8b 04 91 48 01 c5 80 nopw 0x0(%rax,%rax,1) 0.00 : 2a4e: 3d 00 0.00 : 2a50: 00 00 00 lea -0x1(%rax),%ecx 0.00 : 2a53: 00 0f 84 mov %ecx,(%r15) 0.00 : 2a56: d5 fd ff ff 48 89 ea cmpb $0x0,0x0(%rip) # 2a5d 0.00 : 2a5d: 48 c7 mov %ecx,%eax 0.00 : 2a5f: c6 00 00 00 00 48 c7 mov 0x98(%rsp),%rbx 0.00 : 2a66: c7 0.00 : 2a67: 00 00 00 00 mov (%rbx,%rax,8),%rbp 0.00 : 2a6b: 31 c0 e8 00 00 00 je 27f8 0.00 : 2a71: 00 e9 b8 mov %rbp,%rdx 0.00 : 2a74: fd ff ff 66 0f 1f 84 mov $0x0,%rsi 0.00 : 2a7b: 00 00 00 00 00 8d 48 mov $0x0,%rdi 0.00 : 2a82: ff 41 xor %eax,%eax 0.00 : 2a84: 89 0f 80 3d 00 callq 2a89 0.00 : 2a89: 00 00 00 00 89 jmpq 27f8 0.00 : 2a8e: c8 48 xchg %ax,%ax 0.00 : 2a90: 8b 9c 24 98 00 00 00 mov 0xa8(%rsp),%rsi 0.00 : 2a97: 48 0.00 : 2a98: 8b 2c c3 0f 84 mov 0x50(%rsp),%rcx 0.00 : 2a9d: 87 fd ff xor %r9d,%r9d 0.00 : 2aa0: ff 48 89 ea 48 mov 0x50(%rsp),%rdi 0.00 : 2aa5: c7 c6 00 00 00 00 48 mov %gs:0x0,%eax 0.00 : 2aac: c7 0.00 : 2aad: c7 00 00 00 mov 0xc(%rsi,%rcx,4),%edx 0.00 : 2ab1: 00 31 cltq 0.00 : 2ab3: c0 e8 00 00 00 00 e9 mov 0x0(,%rdi,8),%rdi 0.00 : 2aba: 6a 0.00 : 2abb: fd ff mov %edx,%ecx 0.00 : 2abd: ff 66 90 48 8b add 0x48(%rsi,%rax,8),%rcx 0.00 : 2ac2: b4 24 a8 00 00 00 48 movq $0x0,0xb8(%rsp) 0.00 : 2ac9: 8b 4c 24 50 45 0.00 : 2ace: 31 c9 48 8b 7c 24 50 mov %rdi,0xc0(%rsp) 0.00 : 2ad5: 65 0.00 : 2ad6: 8b 04 mov (%rsi),%eax 0.00 : 2ad8: 25 00 sub %edx,%eax 0.00 : 2ada: 00 00 00 8b lea (%rcx,%rax,1),%rax 0.00 : 2ade: 54 8e 0c cmp %rax,%rcx 0.00 : 2ae1: 48 98 48 8b 3c fd 00 mov %rax,0xc8(%rsp) 0.00 : 2ae8: 00 0.00 : 2ae9: 00 00 jae 2b53 0.00 : 2aeb: 89 d1 48 03 4c c6 48 mov 0xc0(%rsp),%r11 0.00 : 2af2: 48 0.00 : 2af3: c7 84 24 b8 00 mov %rcx,0x38(%rsp) 0.00 : 2af8: 00 00 00 xor %r9d,%r9d 0.00 : 2afb: 00 00 00 48 89 mov 0x38(%rsp),%rdx 0.00 : 2b00: bc 24 c0 00 00 00 8b mov $0x0,%rdi 0.00 : 2b07: 06 29 d0 48 8d mov $0x6,%ecx 0.00 : 2b0c: 04 01 48 39 movzwl 0x58(%rdx),%eax 0.00 : 2b10: c1 48 89 mov %rdx,%r8 0.00 : 2b13: 84 24 c8 add %rax,%r8 0.00 : 2b16: 00 00 00 73 mov 0x8(%r8),%r10 0.00 : 2b1a: 68 4c 8b 9c lea 0x10(%r10),%rsi 0.00 : 2b1e: 24 c0 repz cmpsb %es:(%rdi),%ds:(%rsi) 0.00 : 2b20: 00 00 00 48 89 4c jne 2bad 0.00 : 2b26: 24 38 45 31 lea 0x20(%r8),%r11 0.00 : 2b2a: c9 48 8b xor %r9d,%r9d 0.00 : 2b2d: 54 24 38 48 c7 mov 0x38(%rsp),%rdx 0.00 : 2b32: c7 00 00 00 00 b9 06 mov 0xc8(%rsp),%rcx 0.00 : 2b39: 00 0.00 : 2b3a: 00 00 0f b7 movzwl 0x5a(%rdx),%eax 0.00 : 2b3e: 42 58 49 add %rax,%rdx 0.00 : 2b41: 89 d0 49 cmp %rcx,%rdx 0.00 : 2b44: 01 c0 4d 8b 50 mov %rdx,0x38(%rsp) 0.00 : 2b49: 08 49 jb 2afb 0.00 : 2b4b: 8d 72 10 f3 a6 0f 85 mov %r11,0xc0(%rsp) 0.00 : 2b52: 87 0.00 : 2b53: 00 00 00 4d 8d 58 20 mov 0xb8(%rsp),%rsi 0.00 : 2b5a: 45 0.00 : 2b5b: 31 c9 48 8b 54 24 38 mov 0xc0(%rsp),%rdi 0.00 : 2b62: 48 0.00 : 2b63: 8b 8c 24 mov %r12,%rdx 0.00 : 2b66: c8 00 00 00 0f mov 0x58(%rsp),%rax 0.00 : 2b6b: b7 42 5a 48 01 mov 0x68(%rsp),%r8 0.00 : 2b70: c2 48 39 ca 48 mov 0x70(%rsp),%rcx 0.00 : 2b75: 89 54 24 38 72 mov %r9d,0x20(%rsp) 0.00 : 2b7a: b0 4c 89 9c 24 c0 00 mov $0x0,%r9 0.00 : 2b81: 00 00 48 8b b4 mov %rsi,0x18(%rsp) 0.00 : 2b86: 24 b8 00 00 mov 0x78(%rsp),%esi 0.00 : 2b8a: 00 48 8b bc 24 mov %rdi,0x10(%rsp) 0.00 : 2b8f: c0 00 00 00 4c mov %rax,0x8(%rsp) 0.00 : 2b94: 89 e2 48 8b 44 mov $0x2,%edi 0.00 : 2b99: 24 58 xor %eax,%eax 0.00 : 2b9b: 4c 8b 44 24 68 48 8b movq $0x0,(%rsp) 0.00 : 2ba2: 4c 0.00 : 2ba3: 24 70 44 89 4c callq 2ba8 0.00 : 2ba8: 24 20 49 c7 c1 jmpq 291b 0.00 : 2bad: 00 00 00 00 48 cmp 0x38(%rsp),%rbp 0.00 : 2bb2: 89 74 je 2bbd 0.00 : 2bb4: 24 18 8b 74 add $0x1,%r9d 0.00 : 2bb8: 24 78 48 89 7c jmpq 2b2d 0.00 : 2bbd: 24 10 48 89 44 24 cmpw $0x70,0x36(%rsp) 0.00 : 2bc3: 08 bf je 2c2b 0.00 : 2bc5: 02 00 00 00 31 c0 48 mov %r11,0xc0(%rsp) 0.00 : 2bcc: c7 0.00 : 2bcd: 04 24 00 00 add $0x1,%r9d 0.00 : 2bd1: 00 00 jmp 2b53 0.00 : 2bd3: e8 00 00 00 00 mov 0x20(%rsi,%rax,4),%r9d 0.00 : 2bd8: e9 6e fd mov %edi,%r8d 0.00 : 2bdb: ff ff 48 mov %rbx,%rdx 0.00 : 2bde: 3b 6c 24 38 74 09 41 mov $0x0,%rsi 0.00 : 2be5: 83 c1 01 e9 70 ff ff mov $0x0,%rdi 0.00 : 2bec: ff 66 xor %eax,%eax 0.00 : 2bee: 83 7c 24 add %rcx,%r9 0.00 : 2bf1: 36 70 74 66 mov 0x78(%rsp),%ecx 0.00 : 2bf5: 4c 89 9c 24 c0 callq 2bfa 0.00 : 2bfa: 00 00 00 41 83 jmpq 2727 0.00 : 2bff: c1 01 eb 80 44 8b 4c mov 0xa4(%rsp),%r8d 0.00 : 2c06: 86 0.00 : 2c07: 20 41 89 mov (%r15),%ecx 0.00 : 2c0a: f8 48 89 da 48 c7 c6 mov $0x0,%rdx 0.00 : 2c11: 00 00 00 00 48 c7 c7 mov $0x0,%rsi 0.00 : 2c18: 00 00 00 00 31 c0 49 mov $0x0,%rdi 0.00 : 2c1f: 01 c9 xor %eax,%eax 0.00 : 2c21: 8b 4c 24 78 e8 callq 2c26 0.00 : 2c26: 00 00 00 00 e9 jmpq 281a 0.00 : 2c2b: 28 fb ff ff 44 cmpb $0x0,0x10(%r10) 0.00 : 2c30: 8b 84 jne 2bc5 0.00 : 2c32: 24 a4 00 00 mov 0x20(%r8),%r8d 0.00 : 2c36: 00 41 8b test %r8d,%r8d 0.00 : 2c39: 0f 48 jns 2bc5 0.00 : 2c3b: c7 c2 00 00 00 mov $0x54,%ecx 0.00 : 2c40: 00 48 c7 mov %rbp,%rsi 0.00 : 2c43: c6 00 00 00 00 48 c7 mov $0x0,%rdi 0.00 : 2c4a: c7 00 repz cmpsb %es:(%rdi),%ds:(%rsi) 0.00 : 2c4c: 00 00 00 31 c0 e8 jne 2bc5 0.00 : 2c52: 00 00 00 00 e9 ef fb cmp %r11,0xc0(%rsp) 0.00 : 2c59: ff 0.00 : 2c5a: ff 41 80 7a 10 00 75 movq $0x0,0xb8(%rsp) 0.00 : 2c61: 93 45 8b 40 20 0.00 : 2c66: 45 85 c0 79 8a b9 je 2bcd 0.00 : 2c6c: 54 00 00 00 48 89 ee movq $0x0,0xb8(%rsp) 0.00 : 2c73: 48 c7 c7 00 00 0.00 : 2c78: 00 00 f3 a6 0f 85 73 mov %r11,0xc0(%rsp) 0.00 : 2c7f: ff 0.00 : 2c80: ff ff 4c 39 9c jmpq 2bcd 0.00 : 2c85: 24 c0 00 nopl (%rax) 0.00 : 2c88: 00 00 not %ebx 0.00 : 2c8a: 48 c7 84 24 mov %ebx,0x7c(%rsp) 0.00 : 2c8e: b8 00 00 00 00 jmpq 280d 0.00 : 2c93: 00 00 00 0f 84 61 ff movl $0x0,0x7c(%rsp) 0.00 : 2c9a: ff 0.00 : 2c9b: ff 48 c7 84 24 jmpq 280d 0.00 : 2ca0: b8 00 00 mov %rbp,%rdx 0.00 : 2ca3: 00 00 00 00 00 4c 89 mov $0x0,%rsi 0.00 : 2caa: 9c 24 c0 00 00 00 e9 mov $0x0,%rdi 0.00 : 2cb1: 48 ff xor %eax,%eax 0.00 : 2cb3: ff ff 0f 1f 00 callq 2cb8 0.00 : 2cb8: f7 d3 89 5c 24 jmpq 29db : 2cbd: 7c e9 7a nopl (%rax) : 2cc0: fb ff push %r15 : 2cc2: ff c7 44 24 7c mov $0x80d0,%esi : 2cc7: 00 00 push %r14 : 2cc9: 00 00 e9 mov %rdi,%r14 : 2ccc: 6d fb push %r13 : 2cce: ff ff push %r12 : 2cd0: 48 89 ea xor %r12d,%r12d : 2cd3: 48 push %rbp : 2cd4: c7 push %rbx : 2cd5: c6 00 00 00 sub $0x8,%rsp : 2cd9: 00 48 c7 mov 0x10(%rdi),%ebp : 2cdc: c7 00 mov %ebp,%edi : 2cde: 00 00 00 31 c0 callq 2ce3 : 2ce3: e8 00 00 mov %eax,%r15d : 2ce6: 00 00 mov %eax,%eax : 2ce8: e9 1e fd ff lea (%rax,%rax,8),%rdx 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/fs/jbd/jbd.ko ---------------------------------------------- 100.00 ??:0 Percent | Source code & Disassembly of /lib/modules/3.0.101-0.15-default/kernel/fs/jbd/jbd.ko ------------------------------------------------ : : : : Disassembly of section .text: : : 0000000000000160 <__journal_file_buffer>: 0.00 : 160: 41 56 push %r14 0.00 : 192: 41 89 d6 sar $0x10,%eax 0.00 : 195: 41 55 41 cmp %dx,%ax 0.00 : 198: 54 49 jne 19e <__journal_temp_unlink_buffer+0x12e> 0.00 : 19a: 89 f4 ud2 0.00 : 19c: 55 48 jmp 19c <__journal_temp_unlink_buffer+0x12c> 0.00 : 19e: 89 fd 53 mov 0xc(%rdi),%edx 0.00 : 1a1: 48 83 ec cmp $0x8,%edx 0.00 : 1a4: 20 4c 8b 2f 49 8b ja 316 <__journal_file_buffer+0x186> 0.00 : 1aa: 45 00 a9 00 mov 0x28(%rdi),%rax 0.00 : 1ae: 00 10 00 cmp %rsi,%rax 0.00 : 1b1: 0f 84 8b 01 00 00 jne 305 <__journal_file_buffer+0x175> 0.00 : 1b7: 48 8b 06 test %rax,%rax 0.00 : 1ba: 8b 90 je 1c6 <__journal_temp_unlink_buffer+0x156> 0.00 : 1bc: 4c 01 00 cmp %r14d,%edx 0.00 : 1bf: 00 nop 0.00 : 1c0: 89 d0 c1 f8 10 66 je 286 <__journal_file_buffer+0xf6> 0.00 : 1c6: 39 d0 75 04 cmp $0x2,%r14d 0.00 : 1ca: 0f 0b je 205 <__journal_temp_unlink_buffer+0x195> 0.00 : 1cc: eb fe 8b 57 cmp $0x7,%r14d 0.00 : 1d0: 0c 83 je 205 <__journal_temp_unlink_buffer+0x195> 0.00 : 1d2: fa 08 0f 87 cmp $0x5,%r14d 0.00 : 1d6: 6c 01 je 205 <__journal_temp_unlink_buffer+0x195> 100.00 : 1d8: 00 00 xor %ebx,%ebx 0.00 : 1da: 48 8b 47 28 cmp $0x3,%r14d 0.00 : 1de: 48 39 xchg %ax,%ax 0.00 : 1e0: f0 0f je 205 <__journal_temp_unlink_buffer+0x195> 0.00 : 1e2: 85 4e 01 test %rax,%rax 0.00 : 1e5: 00 00 je 1ef <__journal_temp_unlink_buffer+0x17f> 0.00 : 1e7: 48 85 c0 mov %rbp,%rdi 0.00 : 1ea: 74 0a 44 39 f2 callq 40 0.00 : 1ef: 90 0f xor %eax,%eax 0.00 : 1f1: 84 c0 00 00 cmp $0x8,%r14d 0.00 : 1f5: 00 41 83 fe mov %r12,0x28(%rbp) 0.00 : 1f9: 02 74 ja 258 <__journal_file_buffer+0xc8> 0.00 : 1fb: 39 41 83 mov %r14d,%eax 0.00 : 1fe: fe 07 74 33 41 83 fe jmpq *0x0(,%rax,8) 0.00 : 205: 05 74 2d 31 mov 0x0(%r13),%rax 0.00 : 209: db 41 test $0x2,%al 0.00 : 20b: 83 fe je 231 <__journal_file_buffer+0xa1> 0.00 : 20d: 03 66 90 74 mov 0x18(%r13),%rbx 0.00 : 211: 23 48 85 c0 mov 0x30(%r13),%rdi 0.00 : 215: 74 08 48 mov %rsp,%rsi 0.00 : 218: 89 ef e8 51 fe callq 21d <__journal_file_buffer+0x8d> 0.00 : 21d: ff ff 31 mov %rbx,%rdx 0.00 : 220: c0 41 83 mov %rax,%rsi 0.00 : 223: fe 08 4c 89 65 28 77 mov $0x0,%rdi 0.00 : 22a: 5d 44 xor %eax,%eax 0.00 : 22c: 89 f0 ff 24 c5 callq 231 <__journal_file_buffer+0xa1> 0.00 : 231: 00 00 00 00 49 8b 45 lock btrl $0x1,0x0(%r13) 0.00 : 238: 00 a8 sbb %eax,%eax 0.00 : 23a: 02 74 test %eax,%eax 0.00 : 23c: 24 49 jne 2a7 <__journal_file_buffer+0x117> 0.00 : 23e: 8b 5d 18 49 8b 7d 30 lock btrl $0x13,0x0(%r13) 0.00 : 245: 48 89 sbb %eax,%eax 0.00 : 247: e6 e8 test %eax,%eax 0.00 : 249: 00 00 jne 2a7 <__journal_file_buffer+0x117> 0.00 : 24b: 00 00 48 89 mov 0x28(%rbp),%rax 0.00 : 24f: da 48 xor %ebx,%ebx 0.00 : 251: 89 c6 jmp 1e2 <__journal_temp_unlink_buffer+0x172> 0.00 : 253: 48 c7 c7 00 00 lea 0x20(%r12),%rax 0.00 : 258: 00 00 31 mov (%rax),%rdx 0.00 : 25b: c0 e8 00 test %rdx,%rdx 0.00 : 25e: 00 00 je 293 <__journal_file_buffer+0x103> 0.00 : 260: 00 f0 41 0f mov 0x40(%rdx),%rax 0.00 : 264: ba 75 00 01 mov %rdx,0x38(%rbp) 0.00 : 268: 19 c0 85 c0 mov %rax,0x40(%rbp) 0.00 : 26c: 75 69 f0 41 mov %rbp,0x40(%rdx) 0.00 : 270: 0f ba 75 00 mov %rbp,0x38(%rax) 0.00 : 274: 13 19 test %ebx,%ebx 0.00 : 276: c0 85 c0 75 mov %r14d,0xc(%rbp) 0.00 : 27a: 5c 48 je 286 <__journal_file_buffer+0xf6> 0.00 : 27c: 8b 45 28 31 lea 0x2(%r13),%rax 0.00 : 280: db eb 8f 49 8d 44 lock orb $0x8,0x2(%r13) 0.00 : 286: 24 20 48 8b add $0x20,%rsp 0.00 : 28a: 10 pop %rbx 0.00 : 28b: 48 pop %rbp 0.00 : 28c: 85 d2 pop %r12 0.00 : 28e: 74 33 pop %r13 0.00 : 290: 48 8b pop %r14 0.00 : 292: 42 retq 0.00 : 293: 40 48 89 55 mov %rbp,0x40(%rbp) 0.00 : 297: 38 48 89 45 mov %rbp,0x38(%rbp) 0.00 : 29b: 40 48 89 mov %rbp,(%rax) 0.00 : 29e: 6a 40 jmp 274 <__journal_file_buffer+0xe4> 0.00 : 2a0: 48 89 68 38 85 lea 0x18(%r12),%rax 0.00 : 2a5: db 44 jmp 258 <__journal_file_buffer+0xc8> 0.00 : 2a7: 89 75 0c 74 mov 0x28(%rbp),%rax 0.00 : 2ab: 0a 49 8d 45 02 mov $0x1,%ebx 0.00 : 2b0: f0 41 80 4d 02 jmpq 1e2 <__journal_temp_unlink_buffer+0x172> 0.00 : 2b5: 08 48 83 c4 20 lea 0x60(%r12),%rax 0.00 : 2ba: 5b 5d jmp 258 <__journal_file_buffer+0xc8> 0.00 : 2bc: 41 5c 41 5d 41 lea 0x58(%r12),%rax 0.00 : 2c1: 5e c3 jmp 258 <__journal_file_buffer+0xc8> 0.00 : 2c3: 48 89 6d 40 48 lea 0x50(%r12),%rax 0.00 : 2c8: 89 6d jmp 258 <__journal_file_buffer+0xc8> 0.00 : 2ca: 38 48 89 28 eb lea 0x38(%r12),%rax 0.00 : 2cf: d4 nop 0.00 : 2d0: 49 8d jmp 258 <__journal_file_buffer+0xc8> 0.00 : 2d2: 44 24 18 eb b1 48 addl $0x1,0x14(%r12) 0.00 : 2d8: 8b 45 28 bb 01 lea 0x28(%r12),%rax 0.00 : 2dd: 00 00 00 nopl (%rax) 0.00 : 2e0: e9 2d ff ff ff jmpq 258 <__journal_file_buffer+0xc8> 0.00 : 2e5: 49 8d 44 24 60 cmpq $0x0,0x20(%rbp) 0.00 : 2ea: eb 9c jne 301 <__journal_file_buffer+0x171> 0.00 : 2ec: 49 8d 44 24 58 cmpq $0x0,0x18(%rbp) 0.00 : 2f1: eb 95 je 286 <__journal_file_buffer+0xf6> 0.00 : 2f3: 49 8d ud2 0.00 : 2f5: 44 24 jmp 2f5 <__journal_file_buffer+0x165> 0.00 : 2f7: 50 eb 8e 49 8d lea 0x30(%r12),%rax 0.00 : 2fc: 44 24 38 90 eb jmpq 258 <__journal_file_buffer+0xc8> 0.00 : 301: 86 41 ud2 0.00 : 303: 83 44 jmp 303 <__journal_file_buffer+0x173> 0.00 : 305: 24 14 01 test %rax,%rax 0.00 : 308: 49 8d 44 24 28 0f je 1c6 <__journal_temp_unlink_buffer+0x156> 0.00 : 30e: 1f 00 ud2 0.00 : 310: e9 73 jmp 310 <__journal_file_buffer+0x180> 0.00 : 312: ff ff ud2 0.00 : 314: ff 48 jmp 314 <__journal_file_buffer+0x184> 0.00 : 316: 83 7d ud2 0.00 : 318: 20 00 jmp 318 <__journal_file_buffer+0x188> : 31a: 75 15 48 83 7d 18 nopw 0x0(%rax,%rax,1) : 320: 00 74 push %r12 : 322: 93 push %rbp : 323: 0f push %rbx : 324: 0b eb fe mov (%rdi),%rbp : 327: 49 8d 44 mov %rdi,%rbx : 32a: 24 30 e9 57 mov 0x0(%rbp),%rax : 32e: ff ff ff 0f 0b test $0x100000,%eax : 333: eb fe 48 85 c0 0f je 3ce <__journal_refile_buffer+0x7e> : 339: 84 b8 fe ff mov 0x28(%rdi),%rax : 33d: ff 0f 0b test %rax,%rax : 340: eb fe je 360 <__journal_refile_buffer+0x10> : 342: 0f 0b eb mov (%rax),%rax : 345: fe 0f 0b eb fe 66 mov 0x14c(%rax),%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 ------------------------------------------------ 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 ------------------------------------------------