set $n = ((apr_array_header_t *)$arg0)->nelts
set $i = 0
while $i < $n
- printf "[%u] '%s'='%s'\n", $i, $t[$i].key, $t[$i].val
+ if $t[$i].val == (void *)0L
+ printf "[%u] '%s'=>NULL\n", $i, $t[$i].key
+ else
+ printf "[%u] '%s'='%s' [%p]\n", $i, $t[$i].key, $t[$i].val, $t[$i].val
+ end
set $i = $i + 1
end
end
Print the key/value pairs in a table.
end
+define dump_skiplist
+ set $sl = (apr_skiplist *)$arg0
+ set $m = $sl->bottom
+ printf "skiplist@%p: size=%lu: height=%d\n", $sl, $sl->size, $sl->height
+ while ($m)
+ printf "(%p,%.12lx)", $m, $m->data
+ set $u = $m->up
+ while ($u)
+ printf " (%p,%.12lx)", $u, $u->data
+ set $u = $u->up
+ end
+ printf "\n"
+ set $m = $m->next
+ end
+end
+document dump_skiplist
+ Print the nodes/values in a skiplist
+end
-define rh
- run -f /home/dgaudet/ap2/conf/mpm.conf
+define dump_string_hash
+ set $h = $arg0->array
+ set $n = $arg0->max
+ set $i = 0
+ while $i < $n
+ set $ent = $h[$i]
+ while $ent != (void *)0L
+ printf "'%s' => '%p'\n", $ent->key, $ent->val
+ set $ent = $ent->next
+ end
+ set $i = $i + 1
+ end
+end
+document dump_string_hash
+ Print the entries in a hash table indexed by strings
+end
+
+define dump_string_shash
+ set $h = $arg0->array
+ set $n = $arg0->max
+ set $i = 0
+ while $i < $n
+ set $ent = $h[$i]
+ while $ent != (void *)0L
+ printf "'%s' => '%s'\n", $ent->key, $ent->val
+ set $ent = $ent->next
+ end
+ set $i = $i + 1
+ end
+end
+document dump_string_shash
+ Print the entries in a hash table indexed by strings with string values
end
define ro
define dump_bucket_ex
# arg0 == bucket
# arg1 == suppress header?
- set $bucket = (apr_bucket *)$arg0
+ set $bucket = (struct apr_bucket *)$arg0
set $sh = $arg1
set $refcount = -1
# buckets that contain data not in memory (ie not printable)
print_bkt_datacol "contents" "[**unprintable**%c" ']' $sh
+ printf " "
if $bucket->type == &apr_bucket_type_file
set $refcount = ((apr_bucket_refcount *)$bucket->data)->refcount
print_bkt_datacol "rc" "%d" $refcount $sh
set $bb = (apr_bucket_brigade *)$arg0
set $bucket = $bb->list.next
set $sentinel = ((char *)((&($bb->list)) \
- - ((size_t) &((apr_bucket *)0)->link)))
+ - ((size_t) &((struct apr_bucket *)0)->link)))
printf "dump of brigade 0x%lx\n", (unsigned long)$bb
printf " | type (address) | length | "
Print filter chain info
end
+define dump_filter_chain
+ set $r = $arg0
+ set $f = $r->output_filters
+ while $f
+ if $f == $r->output_filters
+ printf "r->output_filters =>\n"
+ end
+ if $f == $r->proto_output_filters
+ printf "r->proto_output_filters =>\n"
+ end
+ if $f == $r->connection->output_filters
+ printf "r->connection->output_filters =>\n"
+ end
+
+ printf " %s(0x%lx): type=%d, ctx=0x%lx, r=%s(0x%lx), c=0x%lx\n", \
+ $f->frec->name, (unsigned long)$f, $f->frec->ftype, (unsigned long)$f->ctx, \
+ $f->r == $r ? "r" : ($f->r == 0L ? "null" : \
+ ($f->r == $r->main ? "r->main" : \
+ ($r->main && $f->r == $r->main->main ? "r->main->main" : "????"))), \
+ $f->r, $f->c
+
+ set $f = $f->next
+ end
+end
+document dump_filter_chain
+ Print filter chain info given a request_rec pointer
+end
+
define dump_process_rec
set $p = $arg0
printf "process_rec=0x%lx:\n", (unsigned long)$p
Print process_rec info
end
+define dump_server_addr_recs
+ set $sa_ = $arg0
+ set $san_ = 0
+ while $sa_
+ ### need to call apr_sockaddr_info_getbuf to print ->host_addr properly
+ ### which is a PITA since we need a buffer :(
+ printf " addr#%d: vhost=%s -> :%d\n", $san_++, $sa_->virthost, $sa_->host_port
+ set $sa_ = $sa_->next
+ end
+end
+document dump_server_addr_recs
+ Print server_addr_rec info
+end
+
+
define dump_server_rec
set $s = $arg0
- printf "name=%s:%d\n", \
- $s->server_hostname, $s->port
+ printf "name=%s:%d (0x%lx)\n", \
+ $s->server_hostname, $s->port, $s
+ dump_server_addr_recs $s->addrs
dump_process_rec($s->process)
end
document dump_server_rec
document dump_servers
Print server_rec list info
end
+
+define dump_request_tree
+ set $r = $arg0
+ set $i
+ while $r
+ printf "r=(0x%lx): uri=%s, handler=%s, r->main=0x%lx\n", \
+ $r, $r->unparsed_uri, $r->handler ? $r->handler : "(none)", $r->main
+ set $r = $r->main
+ end
+end
+
+define dump_allocator
+ printf "Allocator current_free_index = %d, max_free_index = %d\n", \
+ ($arg0)->current_free_index, ($arg0)->max_free_index
+ printf "Allocator free list:\n"
+ set $i = 0
+ set $max =(sizeof $arg0->free)/(sizeof $arg0->free[0])
+ set $kb = 0
+ while $i < $max
+ set $node = $arg0->free[$i]
+ if $node != 0
+ printf " #%2d: ", $i
+ while $node != 0
+ printf "%d, ", ($node->index + 1) << 12
+ set $kb = $kb + (($node->index + 1) << 2)
+ set $node = $node->next
+ end
+ printf "ends.\n"
+ end
+ set $i = $i + 1
+ end
+ printf "Sum of free blocks: %dkiB\n", $kb
+end
+document dump_allocator
+ Print status of an allocator and its freelists.
+end
+
+define dump_one_pool
+ set $p = $arg0
+ set $size = 0
+ set $free = 0
+ set $nodes = 0
+ set $node = $arg0->active
+ set $done = 0
+ while $done == 0
+ set $size = $size + (($node->index + 1) << 12)
+ set $free = $free + ($node->endp - $node->first_avail)
+ set $nodes = $nodes + 1
+ set $node = $node->next
+ if $node == $arg0->active
+ set $done = 1
+ end
+ end
+ printf "Pool '"
+ if $p->tag
+ printf "%s", $p->tag
+ else
+ printf "no tag"
+ end
+ printf "' [%p]: %d/%d free (%d blocks)\n", $p, $free, $size, $nodes
+end
+
+define dump_all_pools
+ set $root = $arg0
+ while $root->parent
+ set $root = $root->parent
+ end
+ dump_pool_and_children $root
+end
+document dump_all_pools
+ Dump the whole pool hierarchy starting from apr_global_pool. Requires an arbitrary pool as starting parameter.
+end
+
+python
+
+from __future__ import print_function
+
+class DumpPoolAndChilds (gdb.Command):
+ """Dump the whole pool hierarchy starting from the given pool."""
+
+ def __init__ (self):
+ super (DumpPoolAndChilds, self).__init__ ("dump_pool_and_children", gdb.COMMAND_USER)
+
+ def _allocator_free_blocks(self, alloc):
+ salloc = "%s" % (alloc)
+ if self.total_free_blocks.get(salloc) != None:
+ return self.total_free_blocks[salloc]
+ i = 0
+ dalloc = alloc.dereference()
+ max =(dalloc['free'].type.sizeof)/(dalloc['free'][0].type.sizeof)
+ kb = 0
+ while i < max:
+ node = dalloc['free'][i]
+ if node != 0:
+ while node != 0:
+ noded = node.dereference()
+ kb = kb + ((int(noded['index']) + 1) << 2)
+ node = noded['next']
+ i = i + 1
+ self.total_free_blocks[salloc] = kb
+ return kb
+
+
+ def _dump_one_pool(self, arg):
+ size = 0
+ free = 0
+ nodes = 0
+ darg = arg.dereference()
+ active = darg['active']
+ node = active
+ done = 0
+ while done == 0:
+ noded = node.dereference()
+ size = size + ((int(noded['index']) + 1) << 12)
+ free = free + (noded['endp'] - noded['first_avail'])
+ nodes = nodes + 1
+ node = noded['next']
+ if node == active:
+ done = 1
+ if darg['tag'] != 0:
+ tag = darg['tag'].string()
+ else:
+ tag = "No tag"
+ print("Pool '%s' [%s]: %d/%d free (%d blocks) allocator: %s free blocks in allocator: %i kiB" % (tag, arg, free, size, nodes, darg['allocator'], self._allocator_free_blocks(darg['allocator'])))
+ self.free = self.free + free
+ self.size = self.size + size
+ self.nodes = self.nodes + nodes
+
+ def _dump(self, arg, depth):
+ pool = arg
+ print("%*c" % (depth * 4 + 1, " "), end="")
+ self._dump_one_pool(pool)
+ if pool['child'] != 0:
+ self._dump(pool['child'], depth + 1)
+ s = pool['sibling']
+ if s != 0:
+ self._dump(s, depth)
+
+ def invoke (self, arg, from_tty):
+ pool = gdb.parse_and_eval(arg)
+ self.free = 0
+ self.size = 0
+ self.nodes = 0
+ self.total_free_blocks = {}
+ self._dump(pool, 0)
+ print("Total %d/%d free (%d blocks)" % (self.free, self.size, self.nodes))
+ sum = 0
+ for key in self.total_free_blocks:
+ sum = sum + self.total_free_blocks[key]
+ print("Total free allocator blocks: %i kiB" % (sum))
+
+DumpPoolAndChilds ()
+end
+document dump_pool_and_children
+ Dump the whole pool hierarchy starting from the given pool.
+end
+
+# Set sane defaults for common signals:
+handle SIGPIPE noprint pass nostop
+handle SIGUSR1 print pass nostop