首页> 外国专利> SYSTEM AND METHOD WITH LOWER SYSTEM LOAD FOR EXAMINING CROSS-BORDER CROSSING FROM JAVA ARRAYS

SYSTEM AND METHOD WITH LOWER SYSTEM LOAD FOR EXAMINING CROSS-BORDER CROSSING FROM JAVA ARRAYS

机译:系统负载较低的系统和方法,用于检查JAVA数组中的跨界交叉

摘要

An array boundary checking method is disclosed for providing hardware based array boundary checking in a Java environment. During the first machine cycle of a current array access command, an array reference value is loaded into a system-data address controller and an array boundary checker. Next, during the second machine cycle of the current array access command, an array index value is written to the system-data address controller and the array boundary checker. Also during the second machine cycle of the current array access command, a maximum array index value is read from the Java array and written to the array boundary checker. The array boundary checker utilizes these values to determine the validity of the current array access command. Finally, during the third machine cycle an array value is accessed in memory. In the present invention the array value is only accessed when the current array access command is valid.
机译:公开了一种阵列边界检查方法,用于在Java环境中提供基于硬件的阵列边界检查。在当前阵列访问命令的第一个机器周期内,将阵列参考值加载到系统数据地址控制器和阵列边界检查器中。接下来,在当前阵列访问命令的第二个机器周期内,将阵列索引值写入系统数据地址控制器和阵列边界检查器。同样,在当前数组访问命令的第二个机器周期中,将从Java数组读取最大数组索引值并将其写入数组边界检查器。阵列边界检查器利用这些值来确定当前阵列访问命令的有效性。最后,在第三个机器周期内,将在内存中访问数组值。在本发明中,仅当当前阵列访问命令有效时才访问阵列值。

著录项

  • 公开/公告号AT375550T

    专利类型

  • 公开/公告日2007-10-15

    原文格式PDF

  • 申请/专利权人 NXP B.V.;

    申请/专利号AT20010969757T

  • 发明设计人 GOFF LONNIE;EVOY DAVID;LINDWER MENNO;

    申请日2001-09-21

  • 分类号G06F9/45;G06F11/30;G06F9/44;G06F9/445;

  • 国家 AT

  • 入库时间 2022-08-21 20:54:54

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号