Replace CraneStation by bytecodealliance everywhere; (#1221)

This commit is contained in:
Benjamin Bouvier
2019-11-12 19:09:31 +01:00
committed by Dan Gohman
parent f4b021c072
commit 9080a02e10
35 changed files with 66 additions and 66 deletions

View File

@@ -5,7 +5,7 @@ version = "0.49.0"
description = "Low-level code generator library"
license = "Apache-2.0 WITH LLVM-exception"
documentation = "https://cranelift.readthedocs.io/"
repository = "https://github.com/CraneStation/cranelift"
repository = "https://github.com/bytecodealliance/cranelift"
categories = ["no-std"]
readme = "README.md"
keywords = ["compile", "compiler", "jit"]
@@ -70,4 +70,4 @@ basic-blocks = []
[badges]
maintenance = { status = "experimental" }
travis-ci = { repository = "CraneStation/cranelift" }
travis-ci = { repository = "bytecodealliance/cranelift" }

View File

@@ -4,7 +4,7 @@ authors = ["The Cranelift Project Developers"]
version = "0.49.0"
description = "Metaprogram for cranelift-codegen code generator library"
license = "Apache-2.0 WITH LLVM-exception"
repository = "https://github.com/CraneStation/cranelift"
repository = "https://github.com/bytecodealliance/cranelift"
readme = "README.md"
edition = "2018"
@@ -14,7 +14,7 @@ cranelift-entity = { path = "../../cranelift-entity", version = "0.49.0" }
[badges]
maintenance = { status = "experimental" }
travis-ci = { repository = "CraneStation/cranelift" }
travis-ci = { repository = "bytecodealliance/cranelift" }
[package.metadata.docs.rs]
rustdoc-args = [ "--document-private-items" ]

View File

@@ -1879,7 +1879,7 @@ pub(crate) fn define(
// SIMD register movement: store, load, spill, fill, regmove. All of these use encodings of
// MOVUPS and MOVAPS from SSE (TODO ideally all of these would either use MOVAPS when we have
// alignment or type-specific encodings, see https://github.com/CraneStation/cranelift/issues/1039).
// alignment or type-specific encodings, see https://github.com/bytecodealliance/cranelift/issues/1039).
for ty in ValueType::all_lane_types().filter(allowed_simd_type) {
// Store
let bound_store = store.bind(vector(ty, sse_vector_size)).bind(Any);
@@ -2003,7 +2003,7 @@ pub(crate) fn define(
// allows SIMD shifts to be legalized more easily. TODO ideally this would be typed as an
// I128x1 but restrictions on the type builder prevent this; the general idea here is that
// the upper bits are all zeroed and do not form parts of any separate lane. See
// https://github.com/CraneStation/cranelift/issues/1146.
// https://github.com/bytecodealliance/cranelift/issues/1146.
e.enc_both(
bitcast.bind(vector(I64, sse_vector_size)).bind(I32),
rec_frurm.opcodes(&MOVD_LOAD_XMM),

View File

@@ -349,7 +349,7 @@ pub(crate) fn define(shared: &mut SharedDefinitions, x86_instructions: &Instruct
def!(y = splat_any8x16(x)),
vec![
def!(a = scalar_to_vector(x)), // move into the lowest 8 bits of an XMM register
// TODO replace the following two instructions with `vconst(0)` when this is possible; see https://github.com/CraneStation/cranelift/issues/1052
// TODO replace the following two instructions with `vconst(0)` when this is possible; see https://github.com/bytecodealliance/cranelift/issues/1052
def!(b = f64const(ieee64_zero)), // zero out a different XMM register; the shuffle mask for moving the lowest byte to all other byte lanes is 0x0
def!(c = bitcast_f64_to_any8x16(b)), // no instruction emitted; informs the SSA that the 0 in b can be used as a vector of this type
def!(y = x86_pshufb(a, c)), // PSHUFB takes two XMM operands, one of which is a shuffle mask (i.e. b)

View File

@@ -4,7 +4,7 @@ name = "cranelift-codegen-shared"
version = "0.49.0"
description = "For code shared between cranelift-codegen-meta and cranelift-codegen"
license = "Apache-2.0 WITH LLVM-exception"
repository = "https://github.com/CraneStation/cranelift"
repository = "https://github.com/bytecodealliance/cranelift"
readme = "README.md"
edition = "2018"

View File

@@ -66,7 +66,7 @@
//! Our current implementation uses a sorted array of compressed intervals, represented by their
//! boundaries (Ebb, Inst), sorted by Ebb. This is a simple data structure, enables coalescing of
//! intervals easily, and shows some nice performance behavior. See
//! https://github.com/CraneStation/cranelift/issues/1084 for benchmarks against using a
//! https://github.com/bytecodealliance/cranelift/issues/1084 for benchmarks against using a
//! bforest::Map<Ebb, Inst>.
//!
//! ## EBB ordering
@@ -112,7 +112,7 @@
//! the necessary API to make coalescing easy, nor does it optimize for our types' sizes.
//!
//! Even the specialized `bforest::Map<Ebb, Inst>` implementation is slower than a plain sorted
//! array, see https://github.com/CraneStation/cranelift/issues/1084 for details.
//! array, see https://github.com/bytecodealliance/cranelift/issues/1084 for details.
use crate::entity::SparseMapValue;
use crate::ir::{Ebb, ExpandedProgramPoint, Inst, Layout, ProgramOrder, ProgramPoint, Value};