Thanks all for the reminders ... I had forgotten that the operands for BXH and BXLE were signed operands (which made all the difference).
FYI: The example shown in "BXH Example 2" (p. A-13 in SA22-7832-13) makes a few assumptions that are probably safe, but architecturally dicey: 1. On return from the SEARCH function shown in the example, R8 is zero if no entry in the table is found. Of course, this assumes that the table never contains a valid argument of zero. 2. It assumes that a wrap-around from a positive index to a negative index is never valid. With any reasonable operating system and address-space mapping, this is probably true, but not necessarily so. Thanks for all of the insight (and for reminding me that I'm really getting old).
