===========================================================
.___ __ __
_________________ __ __ __| _/|__|/ |_
/ ___\_` __ \__ \ | | \/ __ | | \\_ __\
/ /_/ > | \// __ \| | / /_/ | | || |
\___ /|__| (____ /____/\____ | |__||__|
/_____/ \/ \/
grep rough audit - static analysis tool
v2.8 written by @Wireghoul
=================================[justanotherhacker.com]===
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c-1683- "(cond ((= chr ?s)"
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c:1684: "(if addr (concat (car addr) \" <\" (cdr addr) \">\")"
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c-1685- "(or (and (boundp 'report-xemacs-bug-beta-address)"
##############################################
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c-9182- /* it's called that's in the linux kernel. But, it's pretty */
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c:9183: /* fast as is, and this is portable without writing asm code. */
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c-9184- /* Er, portable, except for assuming an int is 32 bits. */
##############################################
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c-9196- /* undoubtedly the best way to find the first empty bit in an array of ints */
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c:9197: /* is some custom ASM code. But, this is portable, and seems fast enough. */
wordwarvi-1.00+dfsg1/.pc/skip_non-dfsg_music/wordwarvi.c-9198- /* profile says we spend about 3.8% of time in here. */
##############################################
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c-1683- "(cond ((= chr ?s)"
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c:1684: "(if addr (concat (car addr) \" <\" (cdr addr) \">\")"
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c-1685- "(or (and (boundp 'report-xemacs-bug-beta-address)"
##############################################
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c-9182- /* it's called that's in the linux kernel. But, it's pretty */
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c:9183: /* fast as is, and this is portable without writing asm code. */
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c-9184- /* Er, portable, except for assuming an int is 32 bits. */
##############################################
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c-9196- /* undoubtedly the best way to find the first empty bit in an array of ints */
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c:9197: /* is some custom ASM code. But, this is portable, and seems fast enough. */
wordwarvi-1.00+dfsg1/.pc/complete_help_text/wordwarvi.c-9198- /* profile says we spend about 3.8% of time in here. */
##############################################
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c-1683- "(cond ((= chr ?s)"
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c:1684: "(if addr (concat (car addr) \" <\" (cdr addr) \">\")"
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c-1685- "(or (and (boundp 'report-xemacs-bug-beta-address)"
##############################################
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c-9182- /* it's called that's in the linux kernel. But, it's pretty */
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c:9183: /* fast as is, and this is portable without writing asm code. */
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c-9184- /* Er, portable, except for assuming an int is 32 bits. */
##############################################
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c-9196- /* undoubtedly the best way to find the first empty bit in an array of ints */
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c:9197: /* is some custom ASM code. But, this is portable, and seems fast enough. */
wordwarvi-1.00+dfsg1/.pc/fix-ftbfs-on-hurd/wordwarvi.c-9198- /* profile says we spend about 3.8% of time in here. */
##############################################
wordwarvi-1.00+dfsg1/wordwarvi.c-1688- "(cond ((= chr ?s)"
wordwarvi-1.00+dfsg1/wordwarvi.c:1689: "(if addr (concat (car addr) \" <\" (cdr addr) \">\")"
wordwarvi-1.00+dfsg1/wordwarvi.c-1690- "(or (and (boundp 'report-xemacs-bug-beta-address)"
##############################################
wordwarvi-1.00+dfsg1/wordwarvi.c-9187- /* it's called that's in the linux kernel. But, it's pretty */
wordwarvi-1.00+dfsg1/wordwarvi.c:9188: /* fast as is, and this is portable without writing asm code. */
wordwarvi-1.00+dfsg1/wordwarvi.c-9189- /* Er, portable, except for assuming an int is 32 bits. */
##############################################
wordwarvi-1.00+dfsg1/wordwarvi.c-9201- /* undoubtedly the best way to find the first empty bit in an array of ints */
wordwarvi-1.00+dfsg1/wordwarvi.c:9202: /* is some custom ASM code. But, this is portable, and seems fast enough. */
wordwarvi-1.00+dfsg1/wordwarvi.c-9203- /* profile says we spend about 3.8% of time in here. */