ev67-strcat.S (498495dba268b20e8eadd7fe93c140c68b6cc9d2) | ev67-strcat.S (f3c78e949d3fb0afcc1bdd8e44b0902897fc2f84) |
---|---|
1/* SPDX-License-Identifier: GPL-2.0 */ 2/* 3 * arch/alpha/lib/ev67-strcat.S 4 * 21264 version contributed by Rick Gorton <rick.gorton@alpha-processor.com> 5 * 6 * Append a null-terminated string from SRC to DST. 7 * 8 * Much of the information about 21264 scheduling/coding comes from: --- 6 unchanged lines hidden (view full) --- 15 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1 16 * Try not to change the actual algorithm if possible for consistency. 17 * Commentary: It seems bogus to walk the input string twice - once 18 * to determine the length, and then again while doing the copy. 19 * A significant (future) enhancement would be to only read the input 20 * string once. 21 */ 22 | 1/* SPDX-License-Identifier: GPL-2.0 */ 2/* 3 * arch/alpha/lib/ev67-strcat.S 4 * 21264 version contributed by Rick Gorton <rick.gorton@alpha-processor.com> 5 * 6 * Append a null-terminated string from SRC to DST. 7 * 8 * Much of the information about 21264 scheduling/coding comes from: --- 6 unchanged lines hidden (view full) --- 15 * L - lower subcluster; L0 - subcluster L0; L1 - subcluster L1 16 * Try not to change the actual algorithm if possible for consistency. 17 * Commentary: It seems bogus to walk the input string twice - once 18 * to determine the length, and then again while doing the copy. 19 * A significant (future) enhancement would be to only read the input 20 * string once. 21 */ 22 |
23#include <asm/export.h> | 23#include <linux/export.h> |
24 .text 25 26 .align 4 27 .globl strcat 28 .ent strcat 29strcat: 30 .frame $30, 0, $26 31 .prologue 0 --- 25 unchanged lines hidden --- | 24 .text 25 26 .align 4 27 .globl strcat 28 .ent strcat 29strcat: 30 .frame $30, 0, $26 31 .prologue 0 --- 25 unchanged lines hidden --- |