September 2025 - Crash-utility - Crash Utility List Archives

[PATCH] help: Add 'help -l' to show memory layout

by Rongwei Wang

From: Rongwei Wang <rongwei.wrw(a)gmail.com> 'help -m' can show most of variables which relates to memory layout, e.g. userspace_top, page_offset, vmalloc_start_addr, etc. They aren't a visual way to show a memory layout for kernel space. This patch provides 'help -l' to show memory layout, usage likes: crash> help -l Gap Hole: 0xffffffffff7ff001 - 0xffffffffffffffff Size: 8.0 MB Fixmap Area: 0xffffffffff578000 - 0xffffffffff7ff000 Size: 2.5 MB Gap Hole: 0xffffffffff000001 - 0xffffffffff577fff Size: 5.5 MB Module Area: 0xffffffffa0000000 - 0xffffffffff000000 Size: 1.5 GB Gap Hole: 0xffffffff84826001 - 0xffffffff9fffffff Size: 439.9 MB Kernel Image: 0xffffffff81000000 - 0xffffffff84826000 Size: 56.1 MB Gap Hole: 0xffffeb0000000000 - 0xffffffff80ffffff Size: 21.0 TB Vmemmap Area: 0xffffea0000000000 - 0xffffeaffffffffff Size: 1.0 TB Gap Hole: 0xffffe90000000000 - 0xffffe9ffffffffff Size: 1.0 TB Vmalloc Area: 0xffffc90000000000 - 0xffffe8ffffffffff Size: 32.0 TB Gap Hole: 0xffffc88000000000 - 0xffffc8ffffffffff Size: 512.0 GB Linear Mapping: 0xffff888000000000 - 0xffffc87fffffffff Size: 64.0 TB Linear Gap: 0xffff800000000000 - 0xffff887fffffffff Size: 8.5 TB Gap Hole: 0x0000800000000000 - 0xffff7fffffffffff Size: 16776960.0 TB User Space: 0x0000000000000000 - 0x00007fffffffffff Size: 128.0 TB Signed-off-by: Rongwei Wang <rongwei.wrw(a)gmail.com> --- defs.h | 14 +++- help.c | 7 +- memory.c | 11 +++ x86_64.c | 236 +++++++++++++++++++++++++++++++++++++++++++++++++++++++ 4 files changed, 266 insertions(+), 2 deletions(-) diff --git a/defs.h b/defs.h index 4fecb83..a3f00d5 100644 --- a/defs.h +++ b/defs.h @@ -4100,12 +4100,23 @@ typedef signed int s32; #define __PHYSICAL_MASK_SHIFT_5LEVEL 52 #define __PHYSICAL_MASK_SHIFT (machdep->machspec->physical_mask_shift) #define __PHYSICAL_MASK ((1UL << __PHYSICAL_MASK_SHIFT) - 1) -#define __VIRTUAL_MASK_SHIFT 48 +#define __VIRTUAL_MASK_SHIFT 47 #define __VIRTUAL_MASK ((1UL << __VIRTUAL_MASK_SHIFT) - 1) #define PAGE_SHIFT 12 #define PAGE_SIZE (1UL << PAGE_SHIFT) #define PHYSICAL_PAGE_MASK (~(PAGE_SIZE-1) & __PHYSICAL_MASK ) + +#define KASAN_SHADOW_OFFSET 0xdffffc0000000000 +#define KASAN_SHADOW_SCALE_SHIFT 3 + +#define KASAN_SHADOW_START (KASAN_SHADOW_OFFSET + \ + ((-1UL << __VIRTUAL_MASK_SHIFT) >> \ + KASAN_SHADOW_SCALE_SHIFT)) +#define KASAN_SHADOW_END (KASAN_SHADOW_START + \ + (1ULL << (__VIRTUAL_MASK_SHIFT - \ + KASAN_SHADOW_SCALE_SHIFT))) + #define _PAGE_BIT_NX 63 #define _PAGE_PRESENT 0x001 #define _PAGE_RW 0x002 @@ -5911,6 +5922,7 @@ int phys_to_page(physaddr_t, ulong *); int generic_get_kvaddr_ranges(struct vaddr_range *); int l1_cache_size(void); int dumpfile_memory(int); +void dump_memory_layout(void); #define DUMPFILE_MEM_USED (1) #define DUMPFILE_FREE_MEM (2) #define DUMPFILE_MEM_DUMP (3) diff --git a/help.c b/help.c index 5d61e0d..cd54744 100644 --- a/help.c +++ b/help.c @@ -538,7 +538,7 @@ cmd_help(void) oflag = 0; while ((c = getopt(argcnt, args, - "efNDdmM:ngcaBbHhkKsvVoptTzLOr")) != EOF) { + "efNDdmM:ngcaBbHhkKsvVoptTzLOrl")) != EOF) { switch(c) { case 'e': @@ -666,6 +666,7 @@ cmd_help(void) fprintf(fp, " -v - vm_table\n"); fprintf(fp, " -V - vm_table (verbose)\n"); fprintf(fp, " -z - help options\n"); + fprintf(fp, " -l - show memory layout\n"); return; case 'L': @@ -676,6 +677,10 @@ cmd_help(void) dump_registers(); return; + case 'l': + dump_memory_layout(); + return; + default: argerrs++; break; diff --git a/memory.c b/memory.c index 400d31a..55ed2f1 100644 --- a/memory.c +++ b/memory.c @@ -17657,6 +17657,17 @@ dumpfile_memory(int cmd) return retval; } +#ifdef X86_64 +extern void x86_64_dump_memory_layout(void); +#endif + +void dump_memory_layout(void) +{ +#ifdef X86_64 + x86_64_dump_memory_layout(); +#endif +} + /* * Functions for sparse mem support */ diff --git a/x86_64.c b/x86_64.c index d7da536..bfb53b4 100644 --- a/x86_64.c +++ b/x86_64.c @@ -1151,6 +1151,242 @@ x86_64_dump_machdep_table(ulong arg) fprintf(fp, "excpetion_functions_orig\n"); } +#define MAX_LAYOUT 32 +struct mem_segment { + char name[64]; + char desc[64]; + unsigned long start; + unsigned long end; +}; + +struct mem_layout { + int count; + struct mem_segment segs[MAX_LAYOUT]; +}; + +char* format_bytes(unsigned long bytes, char* buffer, int buffer_size) +{ + const char* units[] = {"B", "KB", "MB", "GB", "TB"}; + int i = 0; + double readable_size = (double)bytes; + + /* Handle the edge case of zero bytes */ + if (bytes == 0) { + snprintf(buffer, buffer_size, "0 B"); + return buffer; + } + + /* Handle negative values if necessary, though size is typically non-negative */ + if (bytes < 0) { + snprintf(buffer, buffer_size, "Invalid size"); + return buffer; + } + + while (readable_size >= 1024 && i < (sizeof(units) / sizeof(units[0]) - 1)) { + readable_size /= 1024; + i++; + } + + memset(buffer, '\0', buffer_size); + snprintf(buffer, buffer_size, "%.1f %s", readable_size, units[i]); + + return buffer; +} + +int compare_segments(const void *a, const void *b) +{ + const struct mem_segment *seg_a = (const struct mem_segment *)a; + const struct mem_segment *seg_b = (const struct mem_segment *)b; + + if (seg_a->start > seg_b->start) return -1; + if (seg_a->start < seg_b->start) return 1; + return 0; +} + +void print_layout(struct mem_layout *layout) +{ + struct mem_segment *segs = layout->segs; + struct mem_segment seg; + int i; + + if (layout == NULL) + return; + + for (i=0; i<layout->count; i++) { + seg = segs[i]; + + fprintf(fp, "%s:\t 0x%016lx - 0x%016lx\t Size: %s\n", seg.name, seg.start, + seg.end, seg.desc); + } +} + +#define __round_mask(x, y) ((__typeof__(x))((y)-1)) +#define round_up(x, y) ((((x)-1) | __round_mask(x, y))+1) +#define round_down(x, y) ((x) & ~__round_mask(x, y)) + +/* + * memory layout: + * + * Gap Area: 0xffffffffff7ff001 - 0xffffffffffffffff Size: 8.0 MB + * Fixmap Area: 0xffffffffff578000 - 0xffffffffff7ff000 Size: 2.5 MB + * Gap Area: 0xffffffffff000001 - 0xffffffffff577fff Size: 5.5 MB + * Module Area: 0xffffffffa0000000 - 0xffffffffff000000 Size: 1.5 GB + * Gap Area: 0xffffffff84826001 - 0xffffffff9fffffff Size: 439.9 MB + * Kernel Image: 0xffffffff81000000 - 0xffffffff84826000 Size: 56.1 MB + * Gap Area: 0xffffeb0000000000 - 0xffffffff80ffffff Size: 21.0 TB + * Vmemmap Area: 0xffffea0000000000 - 0xffffeaffffffffff Size: 1.0 TB + * Gap Area: 0xffffe90000000000 - 0xffffe9ffffffffff Size: 1.0 TB + * Vmalloc Area: 0xffffc90000000000 - 0xffffe8ffffffffff Size: 32.0 TB + * Gap Area: 0xffffc88000000000 - 0xffffc8ffffffffff Size: 512.0 GB + * Linear Mapping: 0xffff888000000000 - 0xffffc87fffffffff Size: 64.0 TB + * Linear Gap: 0xffff800000000000 - 0xffff887fffffffff Size: 8.5 TB + * Gap Area: 0x0000800000000000 - 0xffff7fffffffffff Size:16776960.0 TB + * User Space: 0x0000000000000000 - 0x00007fffffffffff Size: 128.0 TB + * + * kernel space: + * _end, _text + * vmemmap_end: ms->vmemmap_end + * vmemmap_vaddr: ms->vmemmap_vaddr + * vmalloc_end: ms->vmalloc_end + * vmalloc_start_addr: ms->vmalloc_start_addr + * page_offset_base: ms->page_offset + * + * user space: + * userspace_top: ms->userspace_top + * + */ +void x86_64_dump_memory_layout(void) +{ + struct mem_layout *layout = NULL; + ulong text_start, text_end; + struct machine_specific *ms = machdep->machspec; + int i, next_idx; + char size_buf[20]; + long value = 0; + + layout = malloc(sizeof(struct mem_layout)); + if (layout == NULL || layout->count == 0) { + printf("Layout is empty, nothing to print.\n"); + return; + } + + /* Create a temporary copy to sort for printing, preserving the original order. */ + struct mem_segment *segments = layout->segs; + if(!segments) { + perror("Failed to allocate memory for sorting"); + return; + } + + if (!symbol_exists("_text")) + return; + else + text_start = symbol_value("_text"); + + if (!symbol_exists("_end")) + return; + else + text_end = symbol_value("_end"); + + snprintf(segments[0].name, 64, "Kernel Image"); + snprintf(segments[0].desc, 64, "%s", + format_bytes(text_end - text_start + 1, size_buf, 20)); + segments[0].start = text_start; + segments[0].end = text_end; + + snprintf(segments[1].name, 64, "Vmemmap Area"); + snprintf(segments[1].desc, 64, "%s", + format_bytes(ms->vmemmap_end - ms->vmemmap_vaddr + 1, size_buf, 20)); + segments[1].start = (ulong)ms->vmemmap_vaddr; + segments[1].end = (ulong)ms->vmemmap_end; + + snprintf(segments[2].name, 64, "Module Area"); + snprintf(segments[2].desc, 64, "%s", + format_bytes(ms->modules_end - ms->modules_vaddr + 1, size_buf, 20)); + segments[2].start = (ulong)ms->modules_vaddr; + segments[2].end = (ulong)ms->modules_end; + + snprintf(segments[3].name, 64, "Vmalloc Area"); + snprintf(segments[3].desc, 64, "%s", + format_bytes(ms->vmalloc_end - ms->vmalloc_start_addr + 1, size_buf, 20)); + segments[3].start = (ulong)ms->vmalloc_start_addr; + segments[3].end = (ulong)ms->vmalloc_end; + + snprintf(segments[4].name, 64, "Linear Mapping"); + segments[4].start = (ulong)ms->page_offset; + segments[4].end = (ulong)ms->page_offset + (1UL << machdep->max_physmem_bits) - 1; + snprintf(segments[4].desc, 64, "%s", + format_bytes(1UL << machdep->max_physmem_bits, size_buf, 20)); + + snprintf(segments[5].name, 64, "User Space"); + snprintf(segments[5].desc, 64, "%s", + format_bytes((ulong)ms->userspace_top, size_buf, 20)); + segments[5].start = 0UL; + segments[5].end = (ulong)ms->userspace_top - 1; + + snprintf(segments[6].name, 64, "Linear Gap"); + segments[6].start = -1UL - (1UL << __VIRTUAL_MASK_SHIFT) + 1; + segments[6].end = (ulong)ms->page_offset - 1; + snprintf(segments[6].desc, 64, "%s", + format_bytes(segments[6].end - segments[6].start + 1, size_buf, 20)); + + layout->count = 7; + if (kernel_symbol_exists("kasan_init")) { + snprintf(segments[7].name, 64, "KASAN"); + segments[7].start = KASAN_SHADOW_START; + segments[7].end = KASAN_SHADOW_END; + snprintf(segments[7].desc, 64, "%s", + format_bytes(segments[7].end - segments[7].start + 1, size_buf, 20)); + layout->count++; + } + + if (enumerator_value("__end_of_permanent_fixed_addresses", &value)) { + unsigned fixaddr_size = 0; + int idx = layout->count; + + fixaddr_size = value << PAGE_SHIFT; + + snprintf(segments[7].name, 64, "Fixmap Area"); + segments[idx].end = round_up(VSYSCALL_START + PAGE_SIZE, 1 << PMD_SHIFT) - PAGE_SIZE; + segments[idx].start = segments[idx].end - fixaddr_size; + + snprintf(segments[idx].desc, 64, "%s", + format_bytes(segments[idx].end - segments[idx].start + 1, size_buf, 20)); + layout->count++; + } + + /* Sort segments from highest address to lowest. */ + qsort(segments, layout->count, sizeof(struct mem_segment), compare_segments); + + next_idx = layout->count; + /* Insert gap area */ + for (i=0; i<layout->count; i++) { + unsigned long prev_start; + unsigned long end = segments[i].end; + + if (i == 0) + prev_start = -1UL; + else + prev_start = segments[i-1].start; + + if (prev_start == (end + 1)) + continue; + + snprintf(segments[next_idx].name, 64, "Gap Hole"); + segments[next_idx].start = end + 1; + segments[next_idx].end = (i == 0) ? prev_start : prev_start - 1; + snprintf(segments[next_idx].desc, 64, "%s", + format_bytes(segments[next_idx].end - segments[next_idx].start + 1, size_buf, 20)); + + next_idx++; + } + + layout->count = next_idx; + qsort(segments, layout->count, sizeof(struct mem_segment), compare_segments); + + print_layout(layout); + free(layout); +} + /* * Gather the cpu_pda array info, updating any smp-related items that * were possibly bypassed or improperly initialized in kernel_init(). -- 2.43.5

2 months, 1 week

1
1
0 / 0

[PATCH] Fix "mount <address>" and MNT_CURSOR entries.

by Aureau, Georges (Kernel Tools ERT)

Fix "mount <address>" and MNT_CURSOR entries: 1/ "mount <address>" is failing on kernels without "super_block.s_files": crash> mount ff35d61d80200000 mount: the super_block.s_files linked list does not exist in this kernel mount: -f option not supported or applicable on this architecture or kernel The MOUNT_PRINT_FILES flags should only be passed when "super_block.s_files" is available. 2/ "mount" is not skipping MNT_CURSOR entries (kernel >= 5.8): crash> mount > mount.out WARNING: cannot get super_block from vfsmnt: 0xff35d65eb1cc1820 crash> struct mount.mnt.mnt_sb,mnt.mnt_flags -x 0xff35d65eb1cc1820 mnt.mnt_sb = 0x0, mnt.mnt_flags = 0x10000000, When crashing with running "findmnt" commands, the mount list will have entries with mnt.mnt_flags==MNT_CURSOR (and mnt.mnt_sb==NULL). Such entries should be skipped without errors. Signed-off-by: Georges Aureau <georges.aureau(a)hpe.com> -- defs.h | 1 + filesys.c | 16 +++++++++++++++- symbols.c | 2 ++ 3 files changed, 18 insertions(+), 1 deletion(-) diff --git a/defs.h b/defs.h index 156ac02..9e37f26 100644 --- a/defs.h +++ b/defs.h @@ -1508,6 +1508,7 @@ struct offset_table { /* stash of commonly-used offsets */ long vfsmount_mnt_devname; long vfsmount_mnt_dirname; long vfsmount_mnt_sb; + long vfsmount_mnt_flags; long vfsmount_mnt_list; long vfsmount_mnt_mountpoint; long vfsmount_mnt_parent; diff --git a/filesys.c b/filesys.c index 8d13807..7439c2e 100644 --- a/filesys.c +++ b/filesys.c @@ -1296,7 +1296,7 @@ cmd_mount(void) * through it for each search argument entered. */ open_tmpfile(); - show_mounts(0, MOUNT_PRINT_FILES | + show_mounts(0, (VALID_MEMBER(super_block_s_files) ? MOUNT_PRINT_FILES : 0) | (VALID_MEMBER(super_block_s_dirty) ? MOUNT_PRINT_INODES : 0), namespace_context); @@ -1371,6 +1371,14 @@ cmd_mount(void) * Do the work for cmd_mount(); */ +/* For kernels >= 5.8, we need to skip MNT_CURSOR entries. + * See https://elixir.bootlin.com/linux/v5.8/source/include/linux/mount.h#L73 + * https://elixir.bootlin.com/linux/v5.8/source/fs/namespace.c#L661 + * https://elixir.bootlin.com/linux/v5.8/source/fs/namespace.c#L690 + * https://elixir.bootlin.com/linux/v5.8/source/fs/proc_namespace.c#L283 + */ +#define MNT_CURSOR 0x10000000 + static void show_mounts(ulong one_vfsmount, int flags, struct task_context *namespace_context) { @@ -1492,6 +1500,11 @@ show_mounts(ulong one_vfsmount, int flags, struct task_context *namespace_contex sbp = ULONG(vfsmount_buf + OFFSET(vfsmount_mnt_sb)); if (!IS_KVADDR(sbp)) { + if (sbp == 0 && VALID_MEMBER(vfsmount_mnt_flags)) { + int mnt_flags = INT(vfsmount_buf + OFFSET(vfsmount_mnt_flags)); + if (mnt_flags == MNT_CURSOR) + continue; + } error(WARNING, "cannot get super_block from vfsmnt: 0x%lx\n", *vfsmnt); continue; } @@ -2070,6 +2083,7 @@ vfs_init(void) MEMBER_OFFSET_INIT(mount_mnt_devname, "mount", "mnt_devname"); MEMBER_OFFSET_INIT(vfsmount_mnt_dirname, "vfsmount", "mnt_dirname"); MEMBER_OFFSET_INIT(vfsmount_mnt_sb, "vfsmount", "mnt_sb"); + MEMBER_OFFSET_INIT(vfsmount_mnt_flags, "vfsmount", "mnt_flags"); MEMBER_OFFSET_INIT(vfsmount_mnt_list, "vfsmount", "mnt_list"); if (INVALID_MEMBER(vfsmount_mnt_devname)) MEMBER_OFFSET_INIT(mount_mnt_list, "mount", "mnt_list"); diff --git a/symbols.c b/symbols.c index 112bcc6..92098a8 100644 --- a/symbols.c +++ b/symbols.c @@ -10685,6 +10685,8 @@ dump_offset_table(char *spec, ulong makestruct) OFFSET(vfsmount_mnt_dirname)); fprintf(fp, " vfsmount_mnt_sb: %ld\n", OFFSET(vfsmount_mnt_sb)); + fprintf(fp, " vfsmount_mnt_flags: %ld\n", + OFFSET(vfsmount_mnt_flags)); fprintf(fp, " vfsmount_mnt_list: %ld\n", OFFSET(vfsmount_mnt_list)); fprintf(fp, " vfsmount_mnt_mountpoint: %ld\n",

2 months, 1 week

1
0
0 / 0

Best Google Scholar Research Topics in Education Service

by jessicamark0819＠gmail.com

My approach to academic projects has completely changed since I recently learnt about the Google Scholar research topics in education service. In addition to offering topic suggestions, this service links me to the most important discussions in education, which saves time and improves the caliber of my research right away. Visit Site: https://www.dissertationproposal.co.uk/research-topics/google-scholar-res...

2 months, 1 week

1
0
0 / 0

[PATCH v2 0/2] extension: Several improvements on eppic extension

by Tao Liu

Eppic works as a crash extension for a long time, and it is a very convenient tool to extend crash's function: 1) People don't need to write an actual crash extension, which requires knowledge of crash APIs, such as readmem(), gdb_interface() etc. Implementing such an crash extension is hard for normal users. 2) Eppic programs are C-syntax-like scripting, no compile needed, so friendly to kernel developers who are already familiar with C. It's a good alternative for people who are unfamiliar with python (comparing to drgn/pykdump). 3) Writing eppic programs is similar to do kernel programming, people can use kernel data structures/global variables directly, again, friendly to kernel developers. Personally I think eppic is a good tool and would like to push it forward to make it used more widely, improved consistently. However I hardly heard anyone who are using it, I guess it is due to it's extension position and unknown to others. In this patchset, I will make several improvements on eppic, although it is still a crash extension, but I think it is made more easily for compile/run/scripting. To-do: Some crash functions should be exposed to eppic, such as maple_tree/rbtree etc, so people can iterate these kernel structures with the existing crash functions, otherwise people need to reimplement those in eppic. A more aggresive improvement of eppic can be found in [1], which people can use call_crash_func() to call any crash's function within eppic script, please refer to code example in [2]. Not sure if people like this, so any feedback/comments are welcomed. v2 -> v1: Removed v1's No.2 & 3 & 5 patch, these 3 are used for compile/preload/alias eppic by default, these are a little aggressive and left to [1] instead. [1]: https://github.com/liutgnu/crash-dev/tree/eppic [2]: https://github.com/liutgnu/crash-dev/blob/eppic/extensions/eppic.patch#L298 Tao Liu (2): extensions: Search all possible paths eppic.patch: Add customized functions to eppic extensions.c | 63 +++++++------ extensions/eppic.mk | 13 ++- extensions/eppic.patch | 210 +++++++++++++++++++++++++++++++++++++++++ 3 files changed, 258 insertions(+), 28 deletions(-) create mode 100644 extensions/eppic.patch -- 2.47.0

2 months, 1 week

1
2
0 / 0

Reliable Professional Security Services for Your Safety

by florance-james＠proton.me

A professional security service that genuinely redefines peace of mind is something I recently found. Their staff has been dependable, well-trained, and incredibly polite from the first consultation to the continuing protection. Their constant watchfulness guarantees safety around-the-clock, and their obvious presence serves as a powerful deterrent. I didn't realise I was lacking the deep sense of security that this flawless fusion of professionalism and sincere dedication has given me. Visit Site: https://guardianfm.co.uk/security-services/

2 months, 1 week

1
0
0 / 0

[PATCH] Optimize extensions's compiler from gcc to $(CC)

by 高建云

Change the default compiler of the extensions from the fixed gcc to $(CC) passed in by the upper layer Makefile, to facilitate cross_compile. Signed-off-by: jianyun.gao <jianyungao89(a)gmail.com> --- Makefile | 2 +- extensions/Makefile | 10 +++++----- 2 files changed, 6 insertions(+), 6 deletions(-) diff --git a/Makefile b/Makefile index b277129..58b1326 100644 --- a/Makefile +++ b/Makefile @@ -727,7 +727,7 @@ extensions: make_configure @$(MAKE) do_extensions do_extensions: - @$(MAKE) -C extensions -i TARGET=$(TARGET) TARGET_CFLAGS="$(CFLAGS) $(TARGET_CFLAGS)" GDB=$(GDB) GDB_FLAGS=$(GDB_FLAGS) + @$(MAKE) -C extensions -i CC=$(CC) TARGET=$(TARGET) TARGET_CFLAGS="$(CFLAGS) $(TARGET_CFLAGS)" GDB=$(GDB) GDB_FLAGS=$(GDB_FLAGS) memory_driver: make_configure @$(MAKE) -C memory_driver -i diff --git a/extensions/Makefile b/extensions/Makefile index e4c68c3..67d3839 100644 --- a/extensions/Makefile +++ b/extensions/Makefile @@ -23,7 +23,7 @@ # suffice, create a .mk file with the same prefix as the .c file, # and that makefile will be invoked. # - +CC ?= gcc CONTRIB_SO := $(patsubst %.c,%.so,$(wildcard *.c)) all: link_defs $(CONTRIB_SO) @@ -37,11 +37,11 @@ $(CONTRIB_SO): %.so: %.c defs.h $(MAKE) -f $*.mk; \ else \ grep -q '((constructor))' $*.c && { \ - echo "gcc -Wall -g -shared -rdynamic -o $@ $*.c -fPIC -D$(TARGET) $(TARGET_CFLAGS) $(GDB_FLAGS)"; \ - gcc -Wall -g -shared -rdynamic -o $@ $*.c -fPIC -D$(TARGET) $(TARGET_CFLAGS) $(GDB_FLAGS); \ + echo "$(CC) -Wall -g -shared -rdynamic -o $@ $*.c -fPIC -D$(TARGET) $(TARGET_CFLAGS) $(GDB_FLAGS)"; \ + $(CC) -Wall -g -shared -rdynamic -o $@ $*.c -fPIC -D$(TARGET) $(TARGET_CFLAGS) $(GDB_FLAGS); \ } || { \ - echo "gcc -Wall -g -nostartfiles -shared -rdynamic -o $@ $*.c -fPIC -D$(TARGET) $(TARGET_CFLAGS) $(GDB_FLAGS)"; \ - gcc -Wall -g -nostartfiles -shared -rdynamic -o $@ $*.c -fPIC -D$(TARGET) $(TARGET_CFLAGS) $(GDB_FLAGS); \ + echo "$(CC) -Wall -g -nostartfiles -shared -rdynamic -o $@ $*.c -fPIC -D$(TARGET) $(TARGET_CFLAGS) $(GDB_FLAGS)"; \ + $(CC) -Wall -g -nostartfiles -shared -rdynamic -o $@ $*.c -fPIC -D$(TARGET) $(TARGET_CFLAGS) $(GDB_FLAGS); \ }; \ fi -- 2.34.1

2 months, 2 weeks

1
0
0 / 0

Patch for Optimize extensions's compilation

by jianyungao89＠gmail.com

2 months, 2 weeks

1
0
0 / 0

Alternative Career Paths with a Law Degree in the UK

by timothyl.barnett1＠gmail.com

I was unsure about committing to the conventional solicitor or barrister path after years of obtaining my law degree. My perspective was totally altered when I learnt about the Alternative Careers with a Law Degree UK Service. Under their direction, I was able to see how my research, analysis, and persuasive abilities could be applied to jobs in policy analysis, legal technology, compliance, and other fields. I learnt to view my degree as a strong asset that could open many doors and guide me towards a more rewarding career rather than as a limitation. Visit Site: https://lawessayhelponline.uk/highest-paying-law-jobs-career-path/

2 months, 2 weeks

1
0
0 / 0

Pay Someone to Take My Proctored Exam Service – Reliable Help for Online Tests

by christinejohn999＠gmail.com

Before I discovered a trustworthy service where I could pay someone to take the test for me, I was totally overwhelmed by the pressure of my impending proctored exam. Sharing my login information and exam schedule was all that was required, and on the day, a professional handled everything discreetly and without incident. An outstanding grade and, more significantly, a reprieve from all the tension and worry were the outcomes. For my academic peace of mind, it really changed everything. Visit Site: https://eazyresearch.com/take-my-exam-for-me

2 months, 2 weeks

1
0
0 / 0

Expert Dissertation Help Online – Get Professional Support for Your Research

by christinejohn999＠gmail.com

<a href="https://eazyresearch.com/take-my-exam-for-me">Visit Site</a> [url="https://eazyresearch.com/take-my-exam-for-me]Visit Site[/url]

2 months, 2 weeks

1
0
0 / 0

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

Crash-utility September 2025