Google Groups no longer supports new Usenet posts or subscriptions. Historical content remains viewable.
Dismiss

IEFBR14

3 views
Skip to first unread message

Ted Rolle

unread,
Dec 11, 1994, 1:19:00 AM12/11/94
to
Hello All!

I heard a story that IEFBR14 was written by a temporary employee of IBM
(student on work-study), and started out life as:

IEFBR14 CSECT
BR 15

which wastes a _lot_ of machine cycles <g>.

Ted


Lee Stewart

unread,
Dec 12, 1994, 11:11:23 AM12/12/94
to

I remember hearing that too. But IEFBR14 still has the highest number
of errors per kloc in IBM. The original version didn't zero R15....


-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*
Lee A. Stewart 303-673-4955
Software Engineering l...@deathstar.stortek.com
Storage Tek Louisville, Colorado, USA


Mark Hanisco

unread,
Dec 12, 1994, 5:35:40 PM12/12/94
to
I always wanted to APAR IEFBR14 for performance reasons. It could be
dragged out to two different APARs.

The first performance improvement would be to change the SR R15,R15 to
an SLR R15,R15. SLR is faster than SR.

Then we could APAR the SLR R15,R15 with an XR R15,R15. XR is faster
than SLR.

Then it would be even more famous as to APARs per lines of code.

<snicker, snicker>

Paul Gilmartin

unread,
Dec 13, 1994, 12:05:42 AM12/13/94
to
Lee Stewart (l...@endor.stortek.com) wrote:

: I remember hearing that too. But IEFBR14 still has the highest number
: of errors per kloc in IBM. ...

It's an amusing superlative, but can you substantiate it? Who did
the research? What stands in second place? Third, etc.?
What's the average?

For example, I wouldn't be overly surprised if some program, originally
100 lines long, had 101 errors in its life history. Does your authoritative
source exclude such a possibility?

43% of all statistics are simply made up.
-- gil

Jeff Andre

unread,
Dec 13, 1994, 11:42:46 AM12/13/94
to
Paul Gilmartin (p...@sanitas.stortek.com) wrote:
: Lee Stewart (l...@endor.stortek.com) wrote:

Paul,

I don't remember the PTF number but I sort-of remember when it happened. Until
some early release of OS/MVT, around 16 or 17, return codes were not processed
by the initator. Until that time, it didn't matter what the job step returned
because it wasn't used. When IBM added support for return code, the "bug" in
IEFBR14 showed itself. A lot of very large return codes were in user's JCL
listing for a while until it was fixed.

Jeff

--

Jeff_...@stortek.com | Aggressive - adj. - Optimistic
Storage Technology Corporation |
2770 S. 88th Street MS 4232 | "We are developing the next
Louisville, Colorado 80028-4232 | release on a very aggressive
(303) 673-3720 | schedule."

Bill Manry - Oracle Corporation

unread,
Dec 14, 1994, 2:01:30 PM12/14/94
to
Mark Hanisco (han...@omni.voicenet.com) wrote:
[...]

> SLR is faster than SR.
[...] XR is faster
>than SLR.

This hasn't been true for a very long time if ever - the
pipeline architecture machines spit out all arithmetic and
logical RR instructions at the same rate.

/b
----------
Bill Manry
Oracle Corp. / Mainframe & Integration Technologies / BMa...@us.oracle.com
#include <disclaimer.usual>

Melvin Klassen

unread,
Dec 15, 1994, 4:35:18 PM12/15/94
to
han...@omni.voicenet.com (Mark Hanisco) writes:
>I always wanted to APAR IEFBR14 for performance reasons.
>It could be dragged out to two different APARs.
>The first performance improvement would be to change the SR R15,R15 to
>an SLR R15,R15. SLR is faster than SR.

Then, I would be forced to ask for a APAR,
since the "condition-code" set by 'SLR R15,R15' is *never* "zero",
while the "condition-code" set by 'SR R15,R15' is *always* "zero".

>Then we could APAR the SLR R15,R15 with an XR R15,R15. XR is faster than SLR.
>Then it would be even more famous as to APARs per lines of code.

Your APAR would be rejected, if you appealed on a "faster" criterium,
since that is processor-dependent, and probably unprovable, anyway.

David Andrews

unread,
Dec 15, 1994, 6:46:12 PM12/15/94
to
bma...@upsizeme.us.oracle.com writes in article <3cnfea$3...@dcsun4.us.oracle.com>:

>
> Mark Hanisco (han...@omni.voicenet.com) wrote:
> > SLR is faster than SR.
> > XR is faster than SLR.
>
> This hasn't been true for a very long time if ever - the
> pipeline architecture machines spit out all arithmetic and
> logical RR instructions at the same rate.

FWIW, I remember poring over the microcode listings on the /145
a VERY long time ago. SR was (a tiny bit) faster than XR or SLR
on that machine. Go figure.

If you have access to very old issues of SHARE's "CME Compendium",
there were several articles in the early 1980's that talk about
measuring instruction timing. Volume 7 has several of these.

--
David Andrews
d...@redbug.oau.org

0 new messages